Abstract
Parallel systems with distributed memory are difficult to program due in part to the complexity of the communication models used for interaction among processes. Memory models of interaction can partially alleviate these problems.
In this paper we present the N-Mixed memory model which is a generalization of the strict and sufficient memory models. This model weakens the strict memory model, but still maintains its simplicity.
The N-Mixed memory model has been implemented on a distributed configuration, showing the performance analisys we have done a good performance, even when reduced to the strict and sufficient memory models.
This work has been partially funded by CICYT grants TIC90-0815 and TIC93-0304
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
Preview
Unable to display preview. Download preview PDF.
References
Bernabéu, J.M., Cholvi, V. Memory Access Analysis. III Jornadas de Con-currencia (Gandia), 373–393, May 1993.
Bernabéu, J.M., Cholvi, V. Implementing a Distributed Compiler Library that Provides a N-Mixed Memory Model, Technical Report DSIC-II/4/94, Universidad Politécnica de Valencia, 1994.
Carter, J.B., Bennett, J.K., Zwaenepoel, W. Implementation and Performance of Munin. Operating Systems Review, 25(5):152–164, October 1991.
Cheriton, D.R. Problem-Oriented Shared Memory: A Decentralized Approach to Distributed System Design. Proc. Sixth Int’l Conf. Distributed Computer Systems, 190–197, May 1986.
Gifford, D.K., Glasser, N. Remote Pipes and Procedures for Efficient Distributed Comunication. ACM Transactions on computer Systems, 6(3):258–283, August 1988.
Khalidi, M.Y.A. Hardware Support for Distributed Object-Based Systems. PhD thesis, School of Information and Computer Science, Georgia Institute of Technology, 1989.
Li, K., Hudak, P. Memory Coherence in Shared Virtual Memory Systems. A CM Transactions on Computer Systems, 7(4):321–359, November 1989.
Schwarz, R., Mattern, F. Detecting Causal Relationship in Distributed Computations: In Search of the Holy Grail. Technical Report SFB124-15/92, Department of Computer Science, University of Kaiserslautern, Germany, 1992.
Stumm, S., Zhou, S. Algorithms Implementing Distributed Shared Memory. IEEE Computer, 23(5):54–64, May 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Basel AG
About this paper
Cite this paper
Cholvi-Juan, V., Bernabéu-Aubán, J.M. (1994). Implementing a N-Mixed-Memory Model on a Distributed Memory System. In: Decker, K.M., Rehmann, R.M. (eds) Programming Environments for Massively Parallel Distributed Systems. Monte Verità. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8534-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8534-8_42
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9668-9
Online ISBN: 978-3-0348-8534-8
eBook Packages: Springer Book Archive