Advertisement

Distributed Shared Memory

  • Ludwik CzajaEmail author
Chapter
  • 694 Downloads
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 27)

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.

Keywords

Distributed Shared Memory (DSM) Sequential Consistency Strict Consistency processProcess Execution Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 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.CrossRefGoogle Scholar
  2. Courtois, J., Heymans, F., & Parnas, D. L. (1971). Concurrent control with “Readers” and “Writers”. Communication of the ACM, 14(10), 667–668.CrossRefGoogle Scholar
  3. 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
  4. 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
  5. Czaja, L. (2002). Elementary Cause-Effect Structures. Wydawnictwa Uniwersytetu Warszawskiego (Warsaw University Publisher).Google Scholar
  6. Czaja, L. (2012). Exclusive access to resources in distributed shared memory architecture. Fundamenta Informaticae, 119(3–4), 265–280.Google Scholar
  7. Diekert, V., & Rozenberg, G. (Eds.). (1995). The book of traces. World Scientific Publishing Co.Google Scholar
  8. 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
  9. Hoogeboom, H. J., & Rozenberg, G. (1995). Dependence graphs. In The book of traces. Singapore: World Scientific.Google Scholar
  10. Hu, W., Chen, Y., Chen, T., Qian, C., & Li, L. (2011). Linear time memory consistency verification. IEEE Transactions on Computers, 61(4), 502–516.MathSciNetCrossRefzbMATHGoogle Scholar
  11. 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
  12. Lamport L. (1979). How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, 28, 690–691.Google Scholar
  13. Li, K., & Hudak, P. (1989). Memory coherence in shared virtual memory systems. ACM Transaction On Computer Systems, 7(4), 321–359.CrossRefGoogle Scholar
  14. Lipton, R. J., & Sandberg, J. S. (1998). Pram: A scalable shared memory. Technical Report CS-TR-180-88, New Jersey: Princeton University.Google Scholar
  15. Madnick, S. E., & Donovan, J. J. (1974). Operating systems (Vol. 197). New York: McGraw-Hill Book Company.Google Scholar
  16. 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
  17. Mosberger, D. (1993). Memory consistency models. ACM SIGOPS Operating Systems Review, 27(1), 18–26.CrossRefGoogle Scholar
  18. Nutt, G. (2002). Operating systems: A modern perspective (2nd ed.). Boston: Addison-Wesley.Google Scholar
  19. 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
  20. Reisig, W. (1985). Petri nets: An introduction, monographs on theoretical computer science (Vol. 4). Berlin: Springer.Google Scholar
  21. Silberschatz, A., Galvin, P. B., & Gagne, G. (2009). Operating system concepts (8th ed.). New Jersey: Wiley.Google Scholar
  22. Tanenbaum, A. S. (1995). Distributed operating systems. United States: Prentice-Hall.Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Vistula UniversityWarsawPoland
  2. 2.Institute of InformaticsUniversity of WarsawWarsawPoland

Personalised recommendations