@InProceedings{Hellwagner1993a, author = {Hellwagner, Hermann}, booktitle = {Parallel Computer Architectures: Theory, Hardware, Software, Applications}, title = {Randomized Shared Memory - Concept and Efficiency of a Scalable Shared Memory Scheme}, year = {1993}, address = {London, UK}, editor = {Arndt, Bode and Dal Cin, Mario}, month = {jan}, pages = {102-117}, publisher = {Springer Verlag}, series = {LNCS}, abstract = {Our work explores the practical relevance of Randomized Shared Memory (RSM), a theoretical concept that has been proven to enable an (asymptotically) optimally efficient implementation of scalable and universal shared memory in a distributed-memory parallel system. RSM (address hashing) pseudo-randomly distributes global memory addresses throughout the nodes' local memories. High memory access latencies are masked through massive parallelism. This paper introduces the basic principles and properties of RSM and analyzes its practical efficiency in terms of constant factors through simulation studies, assuming a state-of-the-art parallel architecture. Bottlenecks in the architecture are pointed out, and improvements are being made and their effects assessed quantitatively. The results show that RSM efficiency is encouragingly high, even in a non-optimized architecture. We propose architectural features to support RSM and conclude that RSM may indeed be a feasible shared-memory implementation in future massively parallel computers.}, issn = {3-540-57307-0}, language = {EN}, talktype = {none} }