A New Tag Scheme and Its Tree Representation for a Shuffle-Exchange Network

Authors:
Tse-yun Feng;Yanggon Kim
Affiliations:
The Pennsylvania State University, USA;The Pennsylvania State University, USA
Venue:
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Year:
1994

Citing 6
Cited 0

Study of multistage SIMD interconnection networks

ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
A Sampler of Circuit Switching Networks

Computer
A Self-Routing Benes Network and Parallel Permutation Algorithms

IEEE Transactions on Computers
Graph Theoretical Analysis and Design of Multistage Interconnection Networks

IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor

IEEE Transactions on Computers
The Multistage Cube: A Versatile Interconnection Network

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new tag scheme having a flexibility and a bidirectionality for an N 脳 N k-stage shuffle-exchange network where k \ge log_2 N. Based on the interstage correlations for a path, the EB-tag generating rules are presented. In addition, an elegant and simple graphical representation called a N-leaf Dual Complete Binary tree (N-leaf DCB-tree) for a given permutation is proposed and its characteristics are discussed. Then the universal necessary condition for a conflict-free connection pattern is given. Due to this condition, the conflict-free routing problem can be transformed to the perfect assignment problem.