A scalable distributed shared memory

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Parallel computers of the future will require a memory model which offers a global address space to the programmer, while performing equally well under various system configurations. We present a logically shared and physically distributed memory to match both requirements. This paper introduces the memory system used in the ADAM coarse-grain dataflow machine which preserves scalability by tolerating latency and offers programmability through its object-based structure. We show how to support data objects of arbitrary size and different access bandwidth and latency characteristics, and present a possible implementation of this model. The proposed system is evaluated by analysis of the bandwidth and latency characteristics of the three different object classes and by examination of the impact of different network topologies. Finally, we present a number of simulation results which confirm the previous analysis.

Cite

CITATION STYLE

APA

Murer, S., & Färber, P. (1992). A scalable distributed shared memory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 634 LNCS, pp. 453–466). Springer Verlag. https://doi.org/10.1007/3-540-55895-0_443

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free