By Topic

On routing maskable messages in hypercube-derived multistage interconnection networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Feng-Hsu Wang ; Dept. of Inf. Manage., Ming Chuan Univ., Taipei, Taiwan ; Ferng-Ching Lin

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 2V sources, we identity a subclass of maskable messages that can be routed in minimal 2V network cycles, and the other maskable messages can be routed in 2V+2 network cycles

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:8 ,  Issue: 3 )