Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
LimitLESS directories: A scalable cache coherence scheme
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Comparative performance evaluation of cache-coherent NUMA and COMA architectures
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
The DASH Prototype: Logic Overhead and Performance
IEEE Transactions on Parallel and Distributed Systems
Parallel Evaluation of a Parallel Architecture by Means of Calibrated Emulation
Proceedings of the 8th International Symposium on Parallel Processing
The Data Diffusion Machine with a Scalable Point-to-Point Network
The Data Diffusion Machine with a Scalable Point-to-Point Network
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer
IEEE Transactions on Computers
Scalable Federation of Web Cache Servers
World Wide Web
| Hi-index | 0.00 |
The Data Diffusion Machine is a scalable virtual shared memory architecture. A hierarchical network is used to ensure that all data can be located in a time bounded by O(log p), where p is the number of processors. The DDM hierarchy requires a high degree of connectivity between clusters of nodes, which can be provided with point-to-point links. For large machines however the wiring will be complex. In this article we discuss the implementation of such networks, and develop three alternative implementations. The base level performance of each alternative has been measured on an emulator of the DDM. The final solution collapses the physical hierarchy, and we show that this does not affect the performance, while clearly simplifying the design. It demonstrates that with the use of crossbar routers we can make a cheap, scalable and high performance implementation of the DDM.