Skip to main content
SpringerLink
Log in

Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

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

Abstract

It is known that task scheduling problem of a complete k-ary intree with unit time tasks and general communication delays onto an unlimited number of processors is NP-complete. In this paper, we show that such a problem can be solved in linear time if we restrict communication delays within the range from (k − 1) to k unit times. We also show that naive scheduling is optimal if communication delays are constant and at most (k − 1) unit times.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahmad, I. and Kwok, Y.: On Exploiting Task Duplication in Parallel Program Scheduling, IEEE Trans. on Parallel and Distributed Systems, Vol. 9, No. 9 (1998) 872–892

    Article  Google Scholar 

  2. Blazewicz, J., Guinand, F., Penz, B., and Trystram, D.: Scheduling Complete Trees on Two Uniform Processors with Integer Speed Ratios and Communication Delays, Parallel Processing Letters, Vol. 10, No. 4 (2000) 267–277

    Article  Google Scholar 

  3. Chrétienne, P.: A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System under Tree-like Precedence Constraints, European J. Oper. Res. Vol. 43 (1989) 225–230

    Article  MathSciNet  MATH  Google Scholar 

  4. Chrétienne, P. and Picouleau, C.: Scheduling with Communication Delays: A Survey, Scheduling Theory and Its Applications, Wiley (1995) 65–90

    Google Scholar 

  5. Colin, J. Y. and Chritienne, P.: C.P.M. Scheduling with Small Communication Delays and Task Duplication, Operations Research, Vol. 39, No. 4 (1991) 680–684

    Article  MATH  Google Scholar 

  6. Darbha, S. and Agrawal, D. P.: Optimal Scheduling Algorithm for Distributed-Memory Machines, IEEE Trans. on Parallel and Distributed Systems, Vol. 9, No. 1 (1998) 87–95

    Article  Google Scholar 

  7. El-Rewini, H., Lewis, T.G., and Ali, H.H.: TASK SCHEDULING in PARALLEL and DISTRIBUTED SYSTEMS, PTR Prentice Hall (1994)

    Google Scholar 

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

    Article  Google Scholar 

  9. Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Ann. Discrete Math. Vol. 5 (1979) 287–326

    Article  MATH  Google Scholar 

  10. Guinand, F. and Trystram, D.: Optimal Scheduling of UECT Trees on Two Processors, RAIRO Operations Research, Vol. 34, No. 2(2000) 131–144

    Article  MathSciNet  MATH  Google Scholar 

  11. Jakoby, A. and Reischuk, R.: The Complexity of Scheduling Problems with Communication Delays for Trees, Lecture Notes in Computer Science, Vol. 621. Springer-Verlag (1992) 165–177

    Google Scholar 

  12. Jung, H., Kirousis, L., and Spirakis, P.: Lower bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays, the Information and Computation Journal, Vol. 105, No. 1 (1993) 94–104

    Article  MathSciNet  MATH  Google Scholar 

  13. Lawler, E. L.: Scheduling Trees on Multiprocessors with Unit Communication Delays, Presented at the First Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Lake Como, Italy, unpublished manuscript, June (1993)

    Google Scholar 

  14. Lenstra, J. K., Veldhorst, M., and Veltman, B.: The Complexity of Scheduling Trees with Communication Delays, Journal of Algorithms, Vol. 20 (1996) 157–173

    Article  MathSciNet  MATH  Google Scholar 

  15. Picouleau, C.: Etude de Problèmes les Systèmes Distribués, Ph.D. thesis, Univ. Piere et Marie Curie, Paris, France (1992)

    Google Scholar 

  16. Thurimella, R. and Yesha, Y.: A scheduling principle for precedence graphs with communication delay, International Conference on Parallel Processing, 3 (1992) 229–236

    Google Scholar 

  17. Varvarigou, T. A., Roychowdhury, V. P., Kailath, T., and Lawler, E.: Scheduling In and Out Forests in the Presence of Communication Delays, IEEE Trans. on Parallel and Distributed Systems, Vol. 7, No. 10 (1996) 1065–1074

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Engineering Science, Osaka University, 1-3, Machikaneyama, Toyonaka, Osaka, 560-8531, Japan

    Noriyuki Fujimoto & Kenichi Hagihara

Authors
  1. Noriyuki Fujimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenichi Hagihara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujimoto, N., Hagihara, K. (2002). Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation