The KSR 1: bridging the gap between shared memory and MPPs

The KSR 1 bridges the gap between the historical shared memory model and massively parallel processors (MPPs) by delivering the shared memory programming model and all of its benefits in a scalable, highly parallel architecture. The KSR 1 runs a broad range of mainstream applications, ranging from numerically intensive computation to online transaction processing (OLTP) and database management and inquiry. The use of shared memory makes possible a standards-based open environment. The KSR 1's shared memory programming model is made possible by a new architectural technique called ALLCACHE memory.<<ETX>>

[1]  Andrew A. Chien,et al.  The J-Machine: A Fine Grain Concurrent Computer , 1989 .

[2]  Eugene D. Brooks,et al.  Programming costs of explicit memory localization on a large scale shared memory multiprocessor , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[3]  S. J. Frank,et al.  Tightly coupled multiprocessor system speeds memory-access times , 1984 .

[4]  Ronald G. Minnich,et al.  The Mether System: Distributed Shared Memory for SunOS 4.0 , 1993 .

[5]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[6]  Bell Cg,et al.  Multis: a new class of multiprocessor computers. , 1985 .

[7]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[8]  Elliott I. Organick,et al.  The multics system: an examination of its structure , 1972 .

[9]  David Reiner,et al.  The Kendall Square Query Decomposer , 1993, Digest of Papers. Compcon Spring.

[10]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1986, PODC '86.

[11]  Tom Kilburn,et al.  One-Level Storage System , 1962, IRE Trans. Electron. Comput..

[12]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[13]  S. R. Breit,et al.  Technical applications on the KSR 1: high performance and ease of use , 1993, Digest of Papers. Compcon Spring.

[14]  Alan Jay Smith,et al.  Cache Memories , 1982, CSUR.

[15]  Peter J. Denning,et al.  On modeling program behavior , 1972, AFIPS '72 (Spring).

[16]  Samuel H. Fuller,et al.  Cm*: a modular, multi-microprocessor , 1977, AFIPS '77.

[17]  E. Burke.  An overview of system software for the KSR 1 , 1993, Digest of Papers. Compcon Spring.

[18]  Charles E. Leiserson,et al.  VLSI theory and parallel supercomputing , 1989 .

[19]  C. G. Bell.  Multis: A New Class of Multiprocessor Computers , 1985, Science.

[20]  Anant Agarwal,et al.  LimitLESS directories: A scalable cache coherence scheme , 1991, ASPLOS IV.