analysis of a 3d toroidal network for a shared memory architecture
This paper describes a synchronized network model suitable for the Horizon architecture. The model is defined in terms of a topology and routing policy. A three dimensional toroidal topology is investigated for its multiple redundant paths, memory locality and simplicity in both routing and construction. The routing policy is based on a desperation routing scheme in which it is not guaranteed that a message will make progress on a given network cycle. This scheme requires no complex deadlock avoidance algorithms or node to node flow control, allowing a very simple and efficient implementation. Design considerations and preliminary performance results are discussed.
analysis 3d network shared memory memorialized architecture paper synchronization network model model topologies routing policy redundancy locality scheme message complexity deadlock algorithm flow control efficiency implementation design performance