Abstract
In this paper we introduce a new model of consistency for distributed shared memory called Mume. It offers only the essentials to be considered as a shared memory system. This allows an efficient implementation on a message passing system, and due to this, it can be used to emulate other memory models.
This work has been supported in part by research grants TIC93-0304 and TIC96-0729
Chapter PDF
References
J. Bataller and J. Bernabeu. Constructive and adaptable distributed shared memory. In Proc. of the 3rd Int’l Workshop on High-Level Parallel Programming Models and Supportive Environments, pages 15–22, March 1998.
J. Bataller and J. Bernabeu-Auban. An adaptable dsm model: a formal description. Technical Report II-DSIC-17/97, Dep. de Sistemes Informatics i Computacio (DSIC), Universitat Politecnica de Valencia (Spain), 1997.
J. Bataller and J. Bernabeu-Auban. Synchronized DSM models. In Europar’97. Third Intl. Conf. on Parallel Processing, Lecture notes on computer science, pages 468–475. Springer-Verlag, August 1997.
J. B. Carter, J. K. Bennett, and W. Zwaenepoel. Techniques for reducing consistency-related communication in distributed shared memory systems. ACM Transactions on Computer Systems, 13(3):205–243, August 1995.
N. Lynch. I/O Automata: A model for discrete event system. Technical Report MIT/LCS/TM-351, Laboratory for Computer Science, Massachusetts Institute of Tecnology, March 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bataller, J., Bernabéu-Aubán, J.M. (1998). Adaptable distributed shared memory: A formal definition. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057944
Download citation
DOI: https://doi.org/10.1007/BFb0057944
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive