Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Shuffle-exchange type interconnection networks for multiprocessor systems

Thesis/Dissertation ·
OSTI ID:7162845
There are two major parts in this dissertation. In the first part, a new model, Finite Permutation Machine (FPM), and a set of theorems are developed to capture the theory of operations for the permutation networks used in SIMD mutliprocessor systems. Using this new framework, a long-lasting open problem is partially solved: Are 2n-1 passes of shuffle exchange necessary and sufficient to realize all permutations., where n = log/sub 2/N and N is the number of inputs and outputs interconnected by the network. In the second part, a solution is presented to the resource scheduling problem in large scale loosely coupled MIMD multiprocessor systems. First an interconnection network called circular shuffle network (CSN) is proposed. CSN is a circular form of shuffle-exchange type multistage interconnection network, with the switching node considered as processors. The author defines CSN with homogeneous switching nodes in the entire network as homogeneous CSN (HCSN). HCSN provides two important properties, namely, clustering of nodes in the entire network with respect to any node and efficient partial broadcast mechanisms. Second a distributed scheduling model is described that takes advantage of the above two properties that HCSN provides.
Research Organization:
Maryland Univ., College Park (USA)
OSTI ID:
7162845
Country of Publication:
United States
Language:
English