Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Parallel routing algorithms for incomplete hypercube 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
$31 $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

3 Author(s)
Horng, M.S. ; Inst. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Chen, D.J. ; Kuo-Lung Ku

A severe restriction on a complete hypercube topology is that the number of processors must be a power of 2. Such a restriction limits its applicability. An incomplete hypercube may provide more flexibility in system sizes. There are three classes of variant incomplete hypercube interconnection networks: I/sup r//sub m/, I/sup r//sub M/ and I/sup r//sub A/. The authors focus on the parallel routing algorithms for these three classes of incomplete hypercubes. Parallel paths between any given two nodes mean that these paths have the same source and destination nodes but with different intermediate nodes. Parallel communication can speed up the data transfer operation and increase the system fault-tolerance and the communication reliability between two nodes.<>

Published in:

CompEuro '92 . 'Computer Systems and Software Engineering',Proceedings.

Date of Conference:

4-8 May 1992