Abstract
The component systems of a distributed system can interact by message passing or by shared memory. In the former, their programs have send and receive calls. In the latter their programs read and write shared memory locations. Component systems that interact over a channel typically interact by message passing because that is the natural way to use the channel. Distributed shared memory provides an alternative [6, 8]. Here, a distributed system uses message passing to implement a shared memory accessible to component systems on different computers (perhaps on the same chip). The memory address space is divided into pages, and the pages are allocated among the component systems. When a component system attempts access a page that is not locally present, the distributed shared memory implementation brings the page to the component system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Y. Afek, G. Brown, M. Merritt, Lazy caching. ACM Trans. Program. Lang. Syst. 15(1), 182–205 (1993). doi:http://doi.acm.org/10.1145/151646.151651
M. Dubois, C. Scheurich, Retrospective: memory access buffering in multiprocessors, in 25 Years of the International Symposia on Computer Architecture (Selected Papers), ISCA ’98 (ACM, New York, 1998), pp. 48–50. doi:10.1145/285930.285951. http://doi.acm.org/10.1145/285930.285951
M. Dubois, C. Scheurich, F. Briggs, Memory access buffering in multiprocessors, in 25 Years of the International Symposia on Computer Architecture (Selected Papers), ISCA ’98 (ACM, New York, 1998), pp. 320–328. doi:10.1145/285930.285991. http://doi.acm.org/10.1145/285930.285991
L. Lamport, How to make a correct multiprocess program execute correctly on a multiprocessor. IEEE Trans. Comput. 46(7), 779–782 (1997). doi:10.1109/12.599898. http://dx.doi.org/10.1109/12.599898
D. Lenoski, J. Laudon, K. Gharachorloo, W.D. Weber, A. Gupta, J. Hennessy, M. Horowitz, M.S. Lam, The Stanford Dash multiprocessor. Computer 25(3), 63–79 (1992). doi:10.1109/2.121510. http://dx.doi.org/10.1109/2.121510
K. Li, P. Hudak, Memory coherence in shared virtual memory systems. ACM Trans. Comput. Syst. 7(4), 321–359 (1989). doi:http://doi.acm.org/10.1145/75104.75105
D. Mosberger, Memory consistency models. SIGOPS Oper. Syst. Rev. 27(1), 18–26 (1993). doi:10.1145/160551.160553. http://doi.acm.org/10.1145/160551.160553
J. Protic, M. Tomasevic, V. Milutinovic (eds.), Distributed Shared Memory: Concepts and Systems, 1st edn. (IEEE Computer Society Press, Los Alamitos, 1997)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shankar, A.U. (2013). Distributed Shared Memory Service. In: Distributed Programming. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4881-5_17
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4881-5_17
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-4880-8
Online ISBN: 978-1-4614-4881-5
eBook Packages: Computer ScienceComputer Science (R0)