Skip to main content
SpringerLink
Log in

Distributed Shared Memory

  • Chapter
  • First Online:
Introduction to Distributed Computer Systems

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 27))

  • 1047 Accesses

Abstract

In accordance with general objectives of distributed systems, Distributed Shared Memory (DSM) aims at making possible usage of local memory of all computers by the programmer, as if constituted jointly a single private local memory in his/her computer.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Cantin, J. F., Lipasti, M. H., & Smith, J. E. (2005). The complexity of verifying memory coherence and consistency. IEEE Transactions on Parallel and Distributed Systems, 16(7), 651–663.

    Article  Google Scholar 

  • Courtois, J., Heymans, F., & Parnas, D. L. (1971). Concurrent control with “Readers” and “Writers”. Communication of the ACM, 14(10), 667–668.

    Article  Google Scholar 

  • Czaja, L. (1968). Organization of segment exchange in ALGOL for ZAM 21 ALFA and ZAM 41 ALFA computers. Algorytmy, 5(9), 77–84.

    Google Scholar 

  • Czaja, L. (1980). Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems. Information Processing Letters, 10(4–5), 234–239.

    Google Scholar 

  • Czaja, L. (2002). Elementary Cause-Effect Structures. Wydawnictwa Uniwersytetu Warszawskiego (Warsaw University Publisher).

    Google Scholar 

  • Czaja, L. (2012). Exclusive access to resources in distributed shared memory architecture. Fundamenta Informaticae, 119(3–4), 265–280.

    Google Scholar 

  • Diekert, V., & Rozenberg, G. (Eds.). (1995). The book of traces. World Scientific Publishing Co.

    Google Scholar 

  • Gibbons, P. B., & Korach, E. (1992). The Complexity of Sequential Consistency. In Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium (pp. 317–325).

    Google Scholar 

  • Hoogeboom, H. J., & Rozenberg, G. (1995). Dependence graphs. In The book of traces. Singapore: World Scientific.

    Google Scholar 

  • Hu, W., Chen, Y., Chen, T., Qian, C., & Li, L. (2011). Linear time memory consistency verification. IEEE Transactions on Computers, 61(4), 502–516.

    Article  MathSciNet  MATH  Google Scholar 

  • Hutto, P. W., & Ahamad, M. (1990). Slow memory: Weakening consistency to enhance concurrency in distributed shared memories. In Distributed Computing Systems, 1990. Proceedings, 10th International Conference IEEE (pp. 302–311).

    Google Scholar 

  • Lamport L. (1979). How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, 28, 690–691.

    Google Scholar 

  • Li, K., & Hudak, P. (1989). Memory coherence in shared virtual memory systems. ACM Transaction On Computer Systems, 7(4), 321–359.

    Article  Google Scholar 

  • Lipton, R. J., & Sandberg, J. S. (1998). Pram: A scalable shared memory. Technical Report CS-TR-180-88, New Jersey: Princeton University.

    Google Scholar 

  • Madnick, S. E., & Donovan, J. J. (1974). Operating systems (Vol. 197). New York: McGraw-Hill Book Company.

    Google Scholar 

  • Mazurkiewicz, A. (1987). Trace theory. In W. W. Brauer et al. (Eds.), Petri Nets, Application and Relationship to other Models of Concurrency: Vol. 255. Lecture notes in computer sciences (pp. 279–324).

    Google Scholar 

  • Mosberger, D. (1993). Memory consistency models. ACM SIGOPS Operating Systems Review, 27(1), 18–26.

    Article  Google Scholar 

  • Nutt, G. (2002). Operating systems: A modern perspective (2nd ed.). Boston: Addison-Wesley.

    Google Scholar 

  • Petri, C. A. (1966). Communication with automata (Report, Vol. 1 Suppl. 1 RADC TR-65-377), Applied Data Research, Contract AF 30 Princeton N.J.

    Google Scholar 

  • Reisig, W. (1985). Petri nets: An introduction, monographs on theoretical computer science (Vol. 4). Berlin: Springer.

    Google Scholar 

  • Silberschatz, A., Galvin, P. B., & Gagne, G. (2009). Operating system concepts (8th ed.). New Jersey: Wiley.

    Google Scholar 

  • Tanenbaum, A. S. (1995). Distributed operating systems. United States: Prentice-Hall.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vistula University, Warsaw, Poland

    Ludwik Czaja

  2. Institute of Informatics, University of Warsaw, Warsaw, Poland

    Ludwik Czaja

Authors
  1. Ludwik Czaja
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ludwik Czaja .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Czaja, L. (2018). Distributed Shared Memory. In: Introduction to Distributed Computer Systems . Lecture Notes in Networks and Systems, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-319-72023-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72023-4_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72022-7

  • Online ISBN: 978-3-319-72023-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation