Skip to main content
SpringerLink
Log in

QSM: A general purpose shared-memory model for parallel computation

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1997)

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

Abstract

The Queuing Shared Memory (qsm) model is a general purpose shared-memory model for parallel computation. The QSM provides a high-level shared-memory abstraction for effective parallel algorithm design, as well as the ability to capture bandwidth limitations, as evidenced by a randomized work-preserving emulation on the bsp, which is a lower-level, distributed-memory model.

This research was supported in part by NSF grant CCR/GER-90-23059. E-mail: vlr@cs.utexas.edu. URL: http://www.cs.utexas.edu/users/vlr

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. Adler, P. B. Gibbons, Y. Matias, and V. Ramachandran. Modeling parallel bandwidth: Local vs. global restrictions. In Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, pages 94–105, June 1997.

    Google Scholar 

  2. G. E. Blelloch, P. B. Gibbons, Y. Matias, and M. Zagha. Accounting for memory bank contention and delay in high-bandwidth multiprocessors. In Proc. 7th ACM Syrnp. on Parallel Algorithms and Architectures, pages 84–94, July 1995.

    Google Scholar 

  3. R. Cole. Parallel merge sort. SIAM Journal on Computing, 17(4):770–785, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proc. 4th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pages 1–12, May 1993.

    Google Scholar 

  5. A. V. Gerbessiotis and L. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251–267, 1994.

    Article  Google Scholar 

  6. P. B. Gibbons, Y. Matias, and V. Ramachandran. The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms. SIAM Journal on Computing, 1997. To appear. Preliminary version appears in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 638–648, January 1994.

    Google Scholar 

  7. P. B. Gibbons, Y. Matias, and V. Ramachandran. Efficient low-contention parallel algorithms. Journal of Computer and System Sciences, 53(3):417–442, 1996. Special issue devoted to selected papers from the 1994 ACM Symp. on Parallel Algorithms and Architectures.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. B. Gibbons, Y. Matias, and V. Ramachandran. Can a shared-memory model serve as a bridging model for parallel computation? In Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, pages 72–83, June 1997. To appear.

    Google Scholar 

  9. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.

    Google Scholar 

  10. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, pages 869–941. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990.

    Google Scholar 

  11. P. MacKenzie and V. Ramachandran. Manuscript under preparation. 1997.

    Google Scholar 

  12. V. Ramachandran. A general purpose shared-memory model for parallel computation. Invited paper for IMA Volume in Mathematics and Its Applications on ‘Algorithms for Parallel Processing.’ R. Schreiber, M. Heath, A. Ranade, ed. Springer-Verlag. To appear.

    Google Scholar 

  13. J. H. Reif, editor. A Synthesis of Parallel Algorithms. Morgan-Kaufmann, San Mateo, CA, 1993.

    Google Scholar 

  14. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, 1990.

    Article  Google Scholar 

  15. L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, pages 943–972. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, The University of Texas at Austin, 78712, Austin, Texas

    Vijaya Ramachandran

Authors
  1. Vijaya Ramachandran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramesh G Sivakumar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramachandran, V. (1997). QSM: A general purpose shared-memory model for parallel computation. In: Ramesh, S., Sivakumar, G. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1997. Lecture Notes in Computer Science, vol 1346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0058018

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63876-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation