Skip to main content
SpringerLink
Log in
Book cover

International Conference on Vector and Parallel Processing

International Conference on Parallel Processing

VAPP 1990, CONPAR 1990: CONPAR 90 — VAPP IV pp 628–639Cite as

A distributed algorithm for dynamic task scheduling

  • Concurrency Control
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 457))

Abstract

This paper describes an approximate distributed algorithm for scheduling a set of partially ordered tasks 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. Estimations of the execution times of the tasks are not required, but can be used if available. Knowledge about the amount of intertask communication is assumed to be given. After the general description of the algorithm an example is discussed in detail. In this example the length of the schedule produced turns out to be only about 5% longer then the optimal schedule computed by a static scheduler. Similar results have been obtained for other schedules as well.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Thomas L. Casavant and John G. Kuhl: A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems. IEEE Transactions on Software Engineering, Vol. 14, No 2, February 1988, pp. 141–154.

    Article  Google Scholar 

  2. R. W. Hockney, C. R. Jesshope: Parallel Computers 2. Adam Hilger, Bristol and Philadelphia 1988.

    Google Scholar 

  3. Wolfgang Händler, Erik Maehle and Klaus Wirl: The DIRMU Testbed for High-Performance Multiprocessor Configurations. Proc. First Int. Conf. on Supercomnputing Systems, pp. 468–475, St. Petersburg. FL 1985.

    Google Scholar 

  4. Transputer Reference Manual. Prentice Hall, New York London 1988.

    Google Scholar 

  5. Hironori Kasahara and Seinosuke Narita: Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing. IEEE Transactions on Computers, Vol. C-33, No 11, November 1984, pp. 1023–1029.

    Google Scholar 

  6. Erik Maehle: Multiprozessortopologien. (In preparation for 1990).

    Google Scholar 

  7. Lionel M. Ni, Chong-Wei Xu and Thomas B. Gendreau: A Distributed Drafting Algorithm for Load Balancing. IEEE Transactions on Software Engineering, Vol. SE-11, No 10, October 1985, pp. 1153–1161.

    Google Scholar 

  8. Daniel A. Reed and Richard M. Fujimoto: Multicomputer Networks — Message Based Parallel Processing. The MIT Press, Cambridge MA, 1987.

    Google Scholar 

  9. Alois Schütte, Frank Opfer, Christopher Asp: Automatische Prozeßkonfiguration in Occam 2. Informationstechnik it 30, (1988) 4, pp. 272–284.

    Google Scholar 

  10. John A. Stankovic: Decentralized Decision Making for Task Reallocation in a Hard Real-Time System. IEEE Transactions on Computers, Vol. 38, March 1989, pp. 341–355.

    Article  Google Scholar 

  11. A. M. van Tilborg and L. D. Wittie: Wave Scheduling — Decentralized Scheduling of Task Forces in Multicomputers. IEEE Transactions on Computers, September 1984, Vol. C-33, No 9, pp. 835–844.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GfK, Nordwestring 101, D-8500, Nürnberg

    Johann Rost

  2. Fachgebiet Datentechnik, Universität-GH-Paderborn, Pohlweg 47-49, D-4790, Paderborn

    Erik Maehle

Authors
  1. Johann Rost
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erik Maehle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Helmar Burkhart

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rost, J., Maehle, E. (1990). A distributed algorithm for dynamic task scheduling. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_139

Download citation

  • DOI: https://doi.org/10.1007/3-540-53065-7_139

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53065-7

  • Online ISBN: 978-3-540-46597-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation