Memory servers for multicomputers

A virtual memory management technique for multicomputers called memory servers is investigated. The memory server model extends the memory hierarchy of multicomputers by introducing a remote memory server layer. Memory servers are multicomputer nodes whose memory is used for fast backing storage and logically lie between the local physical memory and disks. The authors present the model, describe how the model supports sequential programs, message-passing programs, and shared virtual memory systems, discuss several design issues, and show preliminary results of a prototype implementation on an Intel iPSC/860.<<ETX>>

[1]  Anoop Gupta,et al.  Competitive management of distributed shared memory , 1989, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[2]  Gabriel M. Silberman.  Determining Fault Ratios in Multilevel Delayed Staging Storage Hierarchies , 1982, IEEE Transactions on Computers.

[3]  Charles L. Seitz,et al.  Mosaic C: An Experimental Fine-Grain Multicomputer , 1992, 25th Anniversary of INRIA.

[4]  Brian N. Bershad,et al.  The Midway distributed shared memory system , 1993, Digest of Papers. Compcon Spring.

[5]  Peter J. Denning,et al.  Working Sets Past and Present , 1980, IEEE Transactions on Software Engineering.

[6]  Kai Li,et al.  A Hypercube Shared Virtual Memory System , 1989, ICPP.

[7]  Carla Schlatter Ellis,et al.  Exploiting operating system support for dynamic page placement on a NUMA shared memory multiprocessor , 1991, PPOPP '91.

[8]  Barbara S. Brawn,et al.  Program behavior in a paging environment , 1899, AFIPS '68 (Fall, part II).

[9]  Robert J. Fowler,et al.  NUMA policies and their relation to memory architecture , 1991, ASPLOS IV.

[10]  Kai Li,et al.  Evaluation of memory system extensions , 1991, ISCA '91.

[11]  Monica S. Lam,et al.  The cache performance and optimizations of blocked algorithms , 1991, ASPLOS IV.

[12]  Jim Griffioen,et al.  A New Design for Distributed Systems: The Remote Memory Model , 1990, USENIX Summer.

[13]  Anoop Gupta,et al.  Comparative evaluation of latency reducing and tolerating techniques , 1991, ISCA '91.

[14]  Irving L. Traiger,et al.  Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..

[15]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[16]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.

[17]  Peter J. Denning,et al.  Virtual memory , 1970, CSUR.

[18]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[19]  Alan Jay Smith,et al.  Disk cache—miss ratio analysis and design considerations , 1983, TOCS.

[20]  Carla Schlatter Ellis,et al.  The robustness of NUMA memory management , 1991, SOSP '91.

[21]  J DallyWilliam,et al.  Performance Analysis of k-ary n-cube Interconnection Networks , 1990 .

[22]  LiKai,et al.  Memory coherence in shared virtual memory systems , 1989 .

[23]  Mark A. Holliday,et al.  Reference history, page size, and migration daemons in local/remote architectures , 1989, ASPLOS III.

[24]  John K. Ousterhout,et al.  Why Aren't Operating Systems Getting Faster As Fast as Hardware? , 1990, USENIX Summer.

[25]  T. Mowry,et al.  Comparative evaluation of latency reducing and tolerating techniques , 1991, [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture.

[26]  Kai Li.  Scalability Issues of Shared virtual Memory for Multicomputers , 1992 .

[27]  Bill N. Schilit,et al.  Adaptive Remote Paging for Mobile Computers , 1991 .

[28]  Willy Zwaenepoel,et al.  Implementation and performance of Munin , 1991, SOSP '91.

[29]  Michael L. Scott,et al.  Simple but effective techniques for NUMA memory management , 1989, SOSP '89.