On Routing Maskable Messages in Hypercube-Derived Multistage Interconnection Networks

Authors:
Feng-Hsu Wang;Ferng-Ching Lin
Affiliations:
Ming Chuan Univ., Taipei, Taiwan;National Taiwan Univ., Taipei, Taiwan
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1997

Citing 6
Cited 0

Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks

IEEE Transactions on Computers - The MIT Press scientific computation series
A Unified theory of interconnection network structure

Theoretical Computer Science
On the computational equivalence of hypercube-derived networks

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks

Journal of Parallel and Distributed Computing
Message pattern routing in hypercubes: a distribute-concentrate approach

Journal of Parallel and Distributed Computing
Partitioning Message Patterns for Bundled Omega Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A vast number of message patterns can be represented by $\left( {_d^s} \right)\!\hbox{-}$masks. In this paper, we consider the problem of routing maskable messages in the hypercube-derived multistage interconnection networks. Network contention is settled by delivering conflicting data in different network cycles. We propose an indirect, two-phase routing strategy which is optimal within two network cycles. For $\left( {_d^s} \right)\!\hbox{-}$masks message patterns in which every destination receives data from 2驴 sources, we identify a subclass of maskable messages that can be routed in minimal 2驴 network cycles, and the other maskable messages can be routed in 2驴 + 2 network cycles.