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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, A. “Limits on Interconnection Network Performance,” IEEE Trans. on Parallel and Distributed Systems, Vol. 2, Oct 1991, pp 398–412.
Arvind and R. A. Ianucci. “Two Fundamental Issues in Multiprocessing,” Proceedings of DFVLR — Conference 1987 on Parallel Processing in Science and Engineering, Bonn-Bad Godesberg, D, 6-1987.
Arvind, R. S. Nikhil and K. K. Pingali. “I-Structures: Data Structures for Parallel Computing,” Workshop on Graph Reduction, Los Alamos, NM, 10-1-1986.
Bennett, J.K. et al, “Munin: Distributed Shared Memory Based on Type-specific memory coherence,” Proceedings of the Second Symposium on Principles and Practice of Parallel Programming, Seatlle, Wash, Mar. 1990, pp. 168–175
BBN. “Inside the BBN TC2000,” Cambridge, Mass., Feb. 1990.
Gibbons, P.B. and S.S. Muchnik, “Efficient Instruction Scheduling for a Pipelined Processor,” SIGPLAN '86 Symp/ on Compiler Construction, ACM, Palo Alto, CA, Jun 1986.
Knuth, D. “The Art of Computer Programming,” Eddison Weslsy, 1968.
Li, K. and R. Schaefer, “A Hypercube Shared Memory System,” Proceedings of the 1989 International Conference on Parallel Processing, St. Charles, Ill, Aug. 1989, pp I-125–132.
Maquelin, O. “ADAM: a Coarse-Grain Dataflow Architecture that Adresses the Load Balancing and Throttling Problems,” Proceedings of CONPAR 90-VAPPIV, Zürich, September 1990, Springer LNCS 457.
McGraw, J. et al., “SISAL, Streams and Iterations in a Single Assignment Language,” Lawrence Livermore National Laboratory Report 1985.
Mitrovic, S. et al. “A Distributed Memory Multiprocessor Based on Dataflow Synchronization,” Proceedings of International Phoenix Conference on Computers and Communication, March 1990
Murer, S. “A Latency Tolerant Code Generation Algorithm for a Coarse &. in Dataflow Machine,” Proceedings of CONPAR 90-VAPPIV, Zurich, September 1990, Springer LNCS 457.
Pfister et al, “The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture,” Proceedings of the 1985 International Conference on Parallel Processing, St. Charles, III, Aug.1985, pp 764–771.
Schwehm, M. and A. Strey, “A Comparison of Interconnection Networks for Large SIMD Parallel Computers,” Proceedings of the International Conference on Parallel Computing Technologies, Novosibirsk, USSR, Sept. 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murer, S., Färber, P. (1992). A scalable distributed shared memory. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_443
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_443
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive