On routing maskable messages in hypercube-derived multistage interconnection networks

Author

Wang, Feng-Hsu ; Lin, Ferng-Ching

Author_Institution

Dept. of Inf. Manage., Ming Chuan Univ., Taipei, Taiwan

Volume

8

Issue

3

fYear

1997

fDate

3/1/1997 12:00:00 AM

Firstpage

285

Lastpage

291

Abstract

A vast number of message patterns can be represented by (^s_d) masks. 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 (^s _d) mask message patterns in which every destination receives data from 2^V sources, we identity a subclass of maskable messages that can be routed in minimal 2^V network cycles, and the other maskable messages can be routed in 2^V+2 network cycles

Keywords

circuit switching; hypercube networks; message passing; multistage interconnection networks; network routing; conflicting data; hypercube derived multistage interconnection networks; mask message patterns; maskable message routing; maskable messages; minimal 2^V network cycles; network contention; network cycles; two phase routing strategy; Broadcasting; Communication switching; Computer networks; Concurrent computing; Intelligent networks; Logic; Multiprocessor interconnection networks; Routing; Switches; Switching circuits;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.584094

Filename

584094