Interconnection networks for large-scale parallel processing: theory and case studies
Interconnection networks for large-scale parallel processing: theory and case studies
Hierarchical cache/bus architecture for shared memory multiprocessors
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Parallel processing architectures and VLSI hardware: vol. 1
Parallel processing architectures and VLSI hardware: vol. 1
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
A New Routing Algorithm for a Class of Rearrangeable Networks
IEEE Transactions on Computers
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
HMIN: A New Method for Hierarchical Interconnection of Processors
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
Performance of Processor-Memory Interconnections for Multiprocessors
IEEE Transactions on Computers
Hypertree: A Multiprocessor Interconnection Topology
IEEE Transactions on Computers
A Class of Redundant Path Multistage Interconnection Networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
The traditional UPP MINs(Unique Path Property MIN) - Omega, Baseline, Multistage Cube Network - have usually been designed for constructing NxN MIN using (N/2)logN SEs. So far the multiple path MINs have been realized by adding additional hardware such as extra stages or duplicated data links. This paper presents a new Multistage Interconnection Network(MIN) topology called Hybrid MIN. Although the Hybrid MIN is constructed using only 2N-3 SEs which is much fewer than that of the traditional MINs, the Hybrid MIN satisfies full access capability(FAC) and has alternative paths. Since there exist alternative paths and the short cut path for the localized communication, it takes advantage of exploiting the locality of reference.