Skip to main content
SpringerLink
Log in

The complexity of scheduling problems with communication delays for trees

  • Conference paper
  • First Online:
Algorithm Theory — SWAT '92 (SWAT 1992)

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

Included in the following conference series:

Abstract

Scheduling problems with interprocessor communication delays have been shown to be NP-complete ([PY88],[C90],[CP91],[P91]). This paper considers the scheduling problem with the restriction that the underlying DAGs are trees and each task has unit execution time. It is shown that the problem remains NP-complete for binary trees and uniform communication delays. The same holds for complete binary trees, but varying communication delays. On the other hand, by a nontrivial analysis a polynomial time algorithm is obtained that solves the problem for complete k-ary trees and uniform communication delays.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Chrétienne, Complexity of Tree-Scheduling with Interprocessor Communication Delays, MASI Report 90.5, 1990

    Google Scholar 

  2. P. Chrétienne and C. Picouleau, The Basic Scheduling With Interprocessor Communication Delays, MASI Report 91.6, 1991

    Google Scholar 

  3. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide To the Theory of NP-Completeness, Freeman 1979.

    Google Scholar 

  4. A. Jakoby, Prozess-Prozessor-Allokationsprobleme für Baumförmige Datenfluss-graphen, Diplomarbeit, Technische Hochschule Darmstadt, 1991

    Google Scholar 

  5. H. Jung, L. Kirousis, P. Spirakis, Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of DAGs With Communication Delays, Proc. 1. SPAA, 1989, 254–264

    Google Scholar 

  6. A. Jakoby, R. Reischuk, Efficient Strategies for Bounded Delay Scheduling, Technical Report, Technische Hochschule Darmstadt, 1992

    Google Scholar 

  7. C. Picouleau, Two New NP-complete Scheduling Problems With Communication Delays and Unlimited Number of Processors, MASI Report 91.24,1991

    Google Scholar 

  8. C. Papadimitriou and M. Yannakakis, Towards an Architecture-Independent Analysis of Parallel Algorithms, Proc. 20. STOC, 1988, 510–513

    Google Scholar 

  9. R. Reischuk, Graph Theoretical Methods for the Design of Parallel Algorithms, Proc. 8. FCT, 1991, 61–67

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, Alexanderstraße 10, 6100, Darmstadt, Germany

    Andreas Jakoby & Rüdiger Reischuk

Authors
  1. Andreas Jakoby
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rüdiger Reischuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Otto Nurmi Esko Ukkonen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jakoby, A., Reischuk, R. (1992). The complexity of scheduling problems with communication delays for trees. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-55706-7_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47275-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation