Skip to main content
SpringerLink
Log in

Scheduling dags to minimize time and communication

  • Parallel Tree Contraction
  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1988)

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

Included in the following conference series:

Abstract

We study the complexity of a generalization of the unit-execution-time multiprocessor scheduling problem under precedence constraints, in which the number of communication arcs is also minimized. Most versions of the problem are shown NP-complete, and two polynomial algorithms are presented for specialized cases.

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. D. Adolphson and T. C. Hu “Optimal Linear Ordering”, SIAM J. Appl. Math., 25, pp. 403–423, (1973).

    Article  MATH  MathSciNet  Google Scholar 

  2. E. G. Coffman, R. L. Graham “Optimal Scheduling for Two Processor Systems”, Acta Informatica, 1, pp. 200–213, (1972).

    Article  MathSciNet  Google Scholar 

  3. E. G. Coffman, ed. Computer and Jobshop Scheduling Theory, Wiley, 1978.

    Google Scholar 

  4. M. R. Garey, D. S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979.

    Google Scholar 

  5. E. L. Lawler “Optimal Sequencing of a Single Machine Subject to Precedence Constraints”, Management Science, 19, pp. 544–546, (1973).

    Article  MATH  Google Scholar 

  6. C. H. Papadimitriou, K. Steiglitz Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1983.

    Google Scholar 

  7. C. H. Papadimitriou, J. D. Ullman. “A Communication-Time Trade-off”, Proc. 1985 STOC Conference; also, SIAM J. Comp., 1987.

    Google Scholar 

  8. C. H. Papadimitriou, M. Yannakakis “Towards an Architecture-Independent Analysis of Parallel Algorithms”, Proceedings 1988 STOC, to appear.

    Google Scholar 

  9. E. Petrohilos, Diploma Thesis, National Technical University of Athens, 1986 (in Greek).

    Google Scholar 

  10. M. Prastein, manuscript, University of Illinios at Urbana-Champaign, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Technical University of Athens, Greece

    Foto Afrati & George Papageorgiou

  2. University of California at San Diego, USA

    Christos H. Papadimitriou

Authors
  1. Foto Afrati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George Papageorgiou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Afrati, F., Papadimitriou, C.H., Papageorgiou, G. (1988). Scheduling dags to minimize time and communication. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040381

Download citation

  • DOI: https://doi.org/10.1007/BFb0040381

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation