Efficient Architectures for Data Access in a Shared Memory Hierarchy

Abstract Interconnection structures that can provide access to multiple levels of a shared memory hierarchy in a multiprocessor are investigated. The results are also applicable to distributed memory architectures in which localities of communication can be statically defined. All the structures presented conform in some fashion to the binary cube topology, with per-processor logic cost ranging from O(log N) to O(log2N). The results illustrate that without resorting to separate networks for access at each level, several architectures can provide fast access at tower levels in the hierarchy and progressively slower access at higher levels. Even at the highest communication level (corresponding to systemwide communication), messages encounter less delay than in a nonhierarchical access situation.

[1]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[2]  Kyungsook Y. Lee,et al.  Performance analysis of buffered banyan networks under nonuniform traffic , 1989, ICS '89.

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

[4]  Eugene D. Brooks.  The shared memory hypercube , 1988, Parallel Comput..

[5]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[6]  Jang-Ping Sheu,et al.  Fault-Tolerant Two-Level Multistage Interconnection Networks , 1987, ICDCS.

[7]  Robert E. McGrath,et al.  Using Memory in the Cedar System , 1988, ICS.

[8]  K. Padmanabhan.  Towards a synthesis of direct and indirect cube structures for multiprocessors , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[9]  Duncan H. Lawrie,et al.  A Class of Redundant Path Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[10]  Krishnan Padmanabhan.  The composite binary cube — a family of interconnection networks for multiprocessors , 1989, ICS '89.

[11]  D J Kuck,et al.  Parallel Supercomputing Today and the Cedar Approach , 1986, Science.

[12]  Keki B. Irani,et al.  Performance study of a clustered shared-memory multiprocessor , 1988, ICS '88.

[13]  J. Zahorjan,et al.  Introducing memory into the switch elements of multiprocessor interconnection networks , 1989, ISCA '89.

[14]  Krishnan Padmanabhan.  Cube structures for multiprocessors , 1990, CACM.

[15]  Laxmi N. Bhuyan,et al.  An Interference Analysis of Interconnection Networks , 1983, ICPP.

[16]  Krishnan Padmanabhan,et al.  Performance of the Direct Binary n-Cube Network for Multiprocessors , 1989, IEEE Trans. Computers.

[17]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[18]  Jang-Ping Sheu,et al.  Performance analysis of multiple bus interconnection networks with hierarchical requesting model , 1988, [1988] Proceedings. The 8th International Conference on Distributed.