Abstract
Distributed shared memory systems offer the possibility of implementing parallel algorithms using the familiar operations of shared memory access. In this paper we present the proof of correctness of an algorithm implementing such a shared memory system over a distributed environment. Such proof is based in the formal model for memory systems introduced by the authors in previous works.
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
Bernabéu-Aubán, J.M., Cholvi-Juan, V.: Formalizing memory coherency models. Journal of Computing and Information 1 (1994) 653–672
Cholvi-Juan, V.: Formalizing memory models. PhD thesis, Department of Computer Science, Polythechnic University of Valencia (1994)
Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects 12 3 (1990) 463–492
Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Transactions on Computers 28 9 (1979) 690–691
Lynch, N.: I/O Automata: A model for discrete event system. Massachusetts Institute of Technology, Technical Report MIT/LCS/TM-351 (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cholvi-Juan, V., Bernabéu-Aubán, J.M. (1996). Correctness proof for a distributed memory system. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_72
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive