Abstract
Software Distributed Shared Memory (SDSM) systems use clusters to provide yet another level of scalability to multi-threaded shared-memory applications. However, linking with SDSM libraries usually requires adaptation of the program’s system calls to the SDSM specific APIs, alignment of program variables to page boundary, in-depth verification of the program against the SDSM memory model, transforming global variables to be dynamically allocated, and more of the like.
In this work we present the transparent SDSM – an SDSM that can efficiently execute any multi-threaded program (given in binary compiled form). The memory model of the transparent SDSM correctly supports any shared-memory application, whether programmed using relaxed or strict consistency in mind. By presenting a prototype and measurements, we show that the performance of the transparent SDSM is not compromised, essentially matching that of a non-transparent high-performance SDSM.
Chapter PDF
Similar content being viewed by others
Keywords
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
Bennett, J.K., Carter, J.B., Zwaenepoel, W.: Munin: Distributed shared memory based on type-specific memory coherence. In: Proc. of the Sixth ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPOPP 1997), June 1997, pp. 90–99 (1997)
Bershad, B.N., Zekauskas, M.J., Sawdon, W.A.: The midway distributed system. In: Proc. of 38th IEEE Int’l Computer Conf. (COMPCON Spring 1993), February 1993, pp. 528–537 (1993)
Carter, J.B.: Design of the munin distributed shared memory system. Journal of Parallel and Distributed Computing 29(2), 219–227 (1995)
Kohn, E.-D.: A Transparent Software Distributed Shared Memory, M.Sc. thesis, Computer Science Department, Technion (2002)
Hunt, G., Brubacher, D.: Detours: Binary interception of win32 functions. In: 3rd USENIX Windows NT Symposium. Microsoft Research (July 1999)
Itzkovitz, A., Schuster, A.: Multiview and millipage – fine-grain sharing in pagebased dsms. In: Proc. of the 1999 Intl’ Conf. on Parallel Processing (ICPP 1999), September 1999, pp. 220–227 (1999)
Kelehrer, P., Dwarkadas, S., Cox, A.L., Zwaenepoel, W.: Treadmarks: Distributed shared memory on standard workstations and operating systems. In: Proc. of the Winter 1994 USENIX Conference, January 1994, pp. 115–131 (1994)
Nitzann, N., Schuster, A.: Transparent Adaptation of Sharing Granularity in MultiView-based DSM Systems. Software, Practice & Experience 31, 1439–1459 (2001); Prelim. version (Best Paper Award) in proc. IPDPS, San Francisco (April 2001)
Scales, D.J., Gharachorloo, K., Thekkath, C.A.: Shasta: A low overhead, software-only approach for supporting fine-grain shared memory. In: Proc. of the 7th Symp. on Architectural Support for Programming Languages and Operating Systems (ASPLOS VII), October 1996, pp. 174–185 (1996)
Schoinas, I., Falsafi, B., Lebeck, A.R., Reinhardt, S.K., Larus, J.R., Wood, D.A.: Fine-grain access control for distributed shared memory. In: Proc. of the 6th Symp. on Architectural Support for Programming Languages and Operating Systems (ASPLOS VI), October 1994, pp. 297–307 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kohn, ED., Schuster, A. (2003). A Transparent Software Distributed Shared Memory. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds) Euro-Par 2003 Parallel Processing. Euro-Par 2003. Lecture Notes in Computer Science, vol 2790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45209-6_159
Download citation
DOI: https://doi.org/10.1007/978-3-540-45209-6_159
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40788-1
Online ISBN: 978-3-540-45209-6
eBook Packages: Springer Book Archive