Properties of multistage interconnection networks

Thesis/Dissertation · Fri Jan 01 04:00:00 EST 1988

OSTI ID:5501802

Youssef, A S

Regular rectangular multistage interconnection networks that are complete and have the single-path property are increasingly important in large parallel computing systems. The efficiency of such networks is critical to the overall system performance, and it depends on the structure, functional capabilities and routing control of the network. Much of the previous research has focused on specific networks. The objective of this dissertation is to study and characterize an important class of such networks. In particular, the relationships between network functionality and topology, switch size, control and modularity. The one-to-one correspondence between topology and functionality is shown, necessary and sufficient topological conditions for a network to realize all the permutations of another network are established, and optimal algorithms to decide if a network realizes all the permutations of another are developed. The single-path property makes control via control tags potentially efficient. Two different control schemes are introduced where the control tags are the same as, or a function of, destination tags. The structure of these easy-to-control networks is shown to be recursive.

• Research Organization: Princeton Univ., NJ (USA)
• OSTI ID: 5501802
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
COMPUTER NETWORKS
EFFICIENCY
FUNCTIONAL MODELS
MATHEMATICAL LOGIC
MATHEMATICS
PARALLEL PROCESSING
PROGRAMMING
RECURSION RELATIONS
TOPOLOGY