Interconnection Networks for SIMD Machines

Authors:
H. J. Siegel
Affiliations:
Purdue University
Venue:
Computer
Year:
1979

Citing 0
Cited 23

Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks

IEEE Transactions on Computers
Processor Scheduling for Linearly Connected Parallel Processors

IEEE Transactions on Computers
Permutations on Illiac IV-Type Networks

IEEE Transactions on Computers
Fault-Tolerant Single-Stage Interconnectiohl Networks

IEEE Transactions on Computers
Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Combinatorial Problem Concerning Processor Interconnection Networks

IEEE Transactions on Computers
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes

IEEE Transactions on Computers
Optimal BPC Permutations on a Cube Connected SIMD Computer

IEEE Transactions on Computers
The Gamma Network

IEEE Transactions on Computers
The Prime Memory System for Array Access

IEEE Transactions on Computers
The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems

IEEE Transactions on Computers
The Theory Underlying the Partitioning of Permutation Networks

IEEE Transactions on Computers
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks

IEEE Transactions on Computers
Routing Schemes for the Augmented Data Manipulator Network in an MIMD System

IEEE Transactions on Computers
PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition

IEEE Transactions on Computers
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Conflict-free memory allocation for associative data files

AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
Modeling Scalable SIMD DSPs in LISA

SAMOS '09 Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation
Dynamic lookup networks

Future directions in distributed computing
Scalable mpNoC for massively parallel systems - Design and implementation on FPGA

Journal of Systems Architecture: the EUROMICRO Journal
Memory Allocations for Multiprocessor Systems That Incorporate Content-Addressable Memories

IEEE Transactions on Computers
Shuffling with the Illiac and PM2I SIMD Networks

IEEE Transactions on Computers
Opportunistic P2P communications in delay-tolerant rural scenarios

EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks

Quantified Score

Hi-index	4.16

Visualization

Abstract

Many SIMD interconnection networks have been proposed. To put the different approaches into perspective, this analysis compares a number of single- and multistage networks.