“Agency scheduling” A model for dynamic task scheduling

  • Johann Rost
  • Franz-Josef Markus
  • Li Yan-Hua
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 966)


This paper describes a class of algorithms for scheduling parallel programs represented by macro dataflow graphs (task precedence graphs) onto a multiprocessor system such that the total execution time is minimized. The schedule will be computed dynamically during the runtime of the process system. The model allows to represent centralized and fully distributed algorithms as well as intermediate forms. The algorithms are able to schedule static as well as dynamic dataflow graphs. Knowledge of the execution times of the tasks is not necessary. Some variants of the model have been implemented using a multi-transputer system. Practical experiences are included in the paper.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BBM91]
    Andreas Bauch, Reinhold Braam, Erik Maehle: DAMP — A Dynamic Reconfigurable Multiprocessor System With a Distributed Switching Network. In A. Bode (Ed.): Distributed Memory Computing. Lecture Notes in Computer Sciences, Vol. 487, Springer-Verlag 1991, pp. 495–504.Google Scholar
  2. [BMM94]
    Andreas Bauch, Erik Maehle, Franz-Josef Markus: A Distributed Algorithm for Fault-Tolerant Dynamic Task Scheduling. Proc. 1994 EUROMICRO Workshop on Parallel and Distributed Processing, Malaga, IEEE Computer Society Press 1994, pp. 309–316Google Scholar
  3. [Bok87]
    Shahid H. Bokhari: Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers 1987.Google Scholar
  4. [CaK88]
    Thomas L. Casavant and Jon G. Kuhl: A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems. IEEE Trans. on Software Engineering, Vol. 14, No. 2, February 1988, pp. 141–154.Google Scholar
  5. [CGJ87]
    E. G. Coffman, Jr. and M. R. Garey, D. S. Johnson: Bin Packing with Divisible Item Sizes. Journal of Complexity 3, 1987, pp. 406–428Google Scholar
  6. [CHL80]
    Wesley W. Chu, Leslie J. Holloway, Min-Tsung Lan, Kemal Efe: Task Allocation in Distributed Data Processing. IEEE Computer, Nov. 80, pp. 57–69.Google Scholar
  7. [Hwa93]
    Kai Hwang: Advanced Computer Architecture. Mc Graw Hill, 1993.Google Scholar
  8. [KaN84]
    Hironori Kasahara, Seinosuke Narita: Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing. IEEE Trans. on Computers, Vol. C-33, No. 11, Nov. 1984, pp. 1023–1029.Google Scholar
  9. [LeA87]
    Soo-Young Lee, J. K. Aggarwal: A Mapping Strategy for Parallel Processing. IEEE Trans. on Computers, Vol. C-36, No. 4, April 1987, pp. 433–442.Google Scholar
  10. [Lo88]
    Virginia Mary Lo: Heuristic Algorithms for Task Assignment in Distributed Systems. IEEE Trans. on Computers, Vol. C-37, Nov. 1988, pp. 1384–1397.Google Scholar
  11. [LüL93]
    Reinhard Lüling, Burkhard Monien: A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance, Proc. of the 5th ACM Symposium on Parallel Algorithms and Architectures (SPAA '93), 1993, pp. 164–173Google Scholar
  12. [MaO92]
    Erik Maehle, Wolfgang Obelöer: DELTA-T: A User Transparent Software-Monitoring Tool for Multi-Transputer Systems. Proc. EUROMICRO 92, Microprocessing and Microprogramming, 1992, Vol. 32, pp. 245–252Google Scholar
  13. [MaL86]
    Pauline Markenscoff, Weikuo Liaw: Task Allocation Problems in Distributed Computer Systems. Proc. Conf. on Parallel Processing, Aug. 86, pp. 953–960.Google Scholar
  14. [ReF87]
    Daniel A. Reed, Richard M. Fujimoto: Multicomputer Networks — Message Based Parallel Processing. The MIT Press, Cambridge MA, 1987.Google Scholar
  15. [RoM90]
    Johann Rost, Erik Maehle: A Distributed Algorithm for Dynamic Task Scheduling. In H. Burkhart (Ed.): CONPAR 90 — VAPP IV. Proc. Joint Intl. Conf. on Vector and Parallel Processing, Zürich 1990, Lecture Notes in Computer Science, Vol. 457, Springer-Verlag, 1990, pp. 628–639.Google Scholar
  16. [Ros94]
    Johann Rost: Dynamic Distributed Task Scheduling on Multicomputers based on Dataflow Graphs. Ph.D. Thesis, University Paderborn, Germany, June 1994 (in German).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Johann Rost
    • 1
  • Franz-Josef Markus
    • 2
  • Li Yan-Hua
    • 3
  1. 1.J. Rost GmbHNürnbergGermany
  2. 2.Institut für Technische InformatikMedizinische Universität zu LübeckLübeckGermany
  3. 3.Beijing Research Institute of TelemetryBeijingP. R. China

Personalised recommendations