Skip to main content
SpringerLink
Log in

Scheduling algorithms for strict multithreaded computations

  • Session 10a: Invited Presentation
  • Conference paper
  • First Online:
Book cover Algorithms and Computation (ISAAC 1996)

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

Included in the following conference series:

Abstract

In this paper, two scheduling algorithms that solve the problem of efficient scheduling k-strict multithreaded computations are presented. Both of them use the work-stealing technique, in which a processor that doesn't have work to do, steals threads from other processors. Our results achieve linear speedup and linear expansion of memory, for constant k (that is k ∈ O(1)). However, they are general and hold for all values of k.

This work was partially supported by the EU ESPRIT Long Term Research Projects ALCOM-IT (Proj. Nr 20244) and GEPPCOM (Proj. Nr 9072) and the Greek Ministry of Education.

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. Fatourou, P., Spirakis, P.: Scheduling Algorithms for Strict Multithreaded Computations. Computer Technology Institute, T.R. 96.5.13, (1996).

    Google Scholar 

  2. Blumofe, R., Leiserson, Ch.: Scheduling Multithreaded Computations by Work Stealing. Proc. of the 35th Ann. Symp. on Foundations of Computer Science (FOCS). (1994), 356–368.

    Google Scholar 

  3. Blumofe, R., Leiserson, Ch.: Space-Efficient Scheduling of Multithreaded Computation. Proc. of the 25th Ann. ACM Symposium on the Theory of Computing (STOC). San Diego, California, (May 1993), 362–371.

    Google Scholar 

  4. Liu, P., Aielo, W., Bhatt, S.: An atomic model for message passing. Proc. of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). Velen, Germany, (June 1993), 154–163.

    Google Scholar 

  5. Feller, W.: An Introduction to Probability Theory and its Application. Third Edition, vol.1, John Wiley & Sons, Inc., 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Technology Institute, P.O. Box 1122, GR-26110, Patras, Greece

    Panagiota Fatourou & Paul Spirakis

Authors
  1. Panagiota Fatourou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fatourou, P., Spirakis, P. (1996). Scheduling algorithms for strict multithreaded computations. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009517

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation