Skip to main content
SpringerLink
Log in

A parallel algorithm for two processors precedence constraint scheduling

  • Parallel Algorithms (Session 10)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

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

Included in the following conference series:

Abstract

We present a new parallel algorithm for the two processors scheduling problem. The algorithm uses only O(n 3) processors and takes time O(log2 n) time on a PRAM. In order to prove the above bounds we show how to compute in NC the lexicographically first matching for a special kind of convex bipartite graphs.

This work was done during the visit of the first and second authors to Patras University and it is supported by the Ministry of Industry, Energy and Technology of Greece, by a bilateral research agreement between Greece and Germany and by the ESPRIT II Basic Research Actions Program of the EC under contract No. 3075 (project ALCOM)

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. M. J. Atallah, P. Callaham, and M. T. Goodrich. P-complete geometric problems. SPAA 90

    Google Scholar 

  2. E. G. Coffman, and R. L. Graham. Optimal scheduling for two processors systems. Acta Informatica, 1:200–213, 1972.

    Google Scholar 

  3. E. Dekel, D. Nassimi, and S. Sahni. Parallel matrix and graph algorithms. SIAM Journal of computing, 10:657–675, 1981.

    Google Scholar 

  4. M. Fujii, T. Kasami, and K. Ninomiya. Optimal sequencing of two equivalent processors. SIAM Journal of computing, 17:784–789, 1969.

    Google Scholar 

  5. H. N. Gabow. An almost linear time algorithm for two processors scheduling. Journal of the ACM, 29(3):766–780, 1982.

    Google Scholar 

  6. M. R. Garey, and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP completeness. Freeman, San Francisco, 1979.

    Google Scholar 

  7. D. Hembold, and E. Mayr. Two processor scheduling is in NC. AWOC 86, pp. 12–25, 1986.

    Google Scholar 

  8. J. D. Ullman. NP-complete scheduling problems. Journal of Computer and System Sciences, 10:384–393, 1975.

    Google Scholar 

  9. U. V. Vazirani, and V. V. Vazirani. The two processor scheduling is in RNC. STOC 85, pp. 11–21, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Humboldt Universität, PSF 1297, DDR 1086, Berlin, Germany

    Hermann Jung

  2. Dept. de Llentguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028, Barcelona, Spain

    Maria Serna

  3. Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece

    Paul Spirakis

Authors
  1. Hermann Jung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Serna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jung, H., Serna, M., Spirakis, P. (1991). A parallel algorithm for two processors precedence constraint scheduling. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_152

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_152

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation