Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Computing Technologies

PaCT 1999: Parallel Computing Technologies pp 77–92Cite as

Dynamic Task Scheduling with Precedence Constraints and Communication Delays

  • Conference paper
  • First Online:

  • 352 Accesses

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

Abstract

In this paper we have introduced the K1 heuristic algorithm for dynamic task scheduling with precedence constraints and communication delays. The execution of a task set repeats in cycles, while the execution and communication profile of a task set changes in time. During a task set execution, a new schedule is generated by tuning the previous schedule. The scheduling is distributed - performed on the processors of a highly parallel computer architecture. The goal is to reduce a dominant sequence of a task set during run-time. Only the tasks that can have an influence on dominant sequence reduction are considered for reordering/migration. The applied techniques are load balancing, task reordering, and data-wait reduction. Simulation is used for the algorithm validation and evaluation.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chang, H. W. D., Oldham, W. J. B.: Dynamic Task Allocation Models for Large Distributed Computing Systems. IEEE Trans. on Parallel and Distr. Systems, Vol. 6, No. 12 (1995) 1301–1315

    Article  Google Scholar 

  2. Dennis, J. B.: Machines and Models for Parallel Computing. International Journal of Parallel Programming, Vol. 22, No. 1 (1994) 47–77

    Article  MathSciNet  Google Scholar 

  3. Gerasoulis, A., Yang, T.: On the Granularity and Clustering of Directed Acyclic Task Graphs. IEEE Trans. on Parallel and Distr. Systems, Vol. 4, No. 6 (1993) 686–701

    Article  Google Scholar 

  4. Ha, S., Lee, E. A.: Compile-Time Scheduling and Assignment of Data-Flow Program Graphs with Data-Dependent Iteration. IEEE Trans. on Comp., Vol. 40, No. 11 (1991) 1225–1238

    Article  Google Scholar 

  5. KaoH, B., Molina, H. G.: Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers. IEEE Trans. on Parallel and Distr. Systems. Vol. 7, No. 1 (1996) 56-68

    Google Scholar 

  6. Kruatrauche, B., Lewis, T.: Grain Size Determination for Parallel Processing. IEEE Software, Vol. 5, No. 1 (1988) 23–32

    Article  Google Scholar 

  7. Leslie, I. M. et al.: The Design and Implementation of an Operating System to Support Distributed Multimedia Application. IEEE Journal on Selected Areas in Communications, Vol. 14, No. 7 (1996) 1280–1297

    Article  Google Scholar 

  8. Loh, P.-K., Hsu, W. J., Wentong, C., Sriskanthan, N.: How Network Topology Affects Dynamic Load Balancing. IEEE Parallel&Distributed Technology, Fall 1996 25-32

    Google Scholar 

  9. Palis, M. A., Liou, J.-C., Wei, D. S. L.: Task Clustering and Scheduling for Distributed Memory Parallel Architecture. IEEE Trans. on Parallel and Distr. Systems, Vol. 7, No. 1 (1996) 46–55

    Article  Google Scholar 

  10. Ramamritham, K., Stankovic, J. A., Shiah, P.-F.: Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems. IEEE Trans. on Parallel and Distr. Systems, Vol. 1, No. 2 (1990) 184–194

    Article  Google Scholar 

  11. Shang, S., Hwang, K.: Distributed Hardwired Barrier Synchronization for Scalable Multiprocessors Clusters. IEEE Trans. on Parallel and Distributed Systems, vol. 6, No. 6 (1995) 591–605

    Article  Google Scholar 

  12. Shin, K. G., Hou, C.-J.: Design and Evaluation of Effective Load Sharing in Distributed Real-Time Systems. IEEE Trans. on Parrallel and Distr. Systems, Vol. 5, No. 7 (1994) 704-719

    Google Scholar 

  13. Sih, G. C.: Multiprocessor Scheduling to Account for Interprocessor Communication. P. H. D Theses, U. C. Berkley (1991)

    Google Scholar 

  14. Stone, H. S.: Multiprocessor Scheduling with the Aid of Network Flow Algorithms. IEEE Trans. on Softw. Eng.., Vol. SE-3, No. 1 (1977) 85–93

    Article  Google Scholar 

  15. Wang, Y.-T., Morris, R. J. T.: Load Sharing in Distributed Systems. IEEE Trans. on Computers, Vol. C-34, No. 3 (1985) 204–217

    Article  Google Scholar 

  16. Willebeek-LeMair, M. H., Reeves, A. P.: Strategies for Dynamic Load Balancing on Highly Parallel Computers. IEEE Trans. on Parallel and Distr. Systems, Vol. 4, No. 9 (1993), 979-993

    Google Scholar 

  17. Yang, T., Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Trans. on Parallel. and Distr. Systems, Vol. 5, No. 9 (1994) 951–967

    Article  Google Scholar 

  18. Zhou, S.: A Trace-Driven Simulation Study of Dynamic Load Balancing. IEEE Trans. on Softw. Eng.., Vol. 14, No. 11 (1988) 1327–1341

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering, University of Banja Luka, Republic of Srpska, Bosnia and Herzegovina

    Slavko Marić

  2. School of Electrical Engineering, University of Belgrade, Yugoslavia

    Zoran Jovanović

Authors
  1. Slavko Marić
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zoran Jovanović
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Center, 6 Lavrentiev Avenue, Novosibirsk, 630090, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marić, S., Jovanović, Z. (1999). Dynamic Task Scheduling with Precedence Constraints and Communication Delays. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-48387-X_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66363-8

  • Online ISBN: 978-3-540-48387-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation