Implementing a N-Mixed-Memory Model on a Distributed Memory System
Vicent Cholvi, José M. Bernabéu‐Aubán · Birkhäuser Basel eBooks · 1994
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.