Enhanced hypercubes

Author

Tzeng, Nian-Feng ; Wei, Sizheng

Author_Institution

Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayatte, LA, USA

Volume

40

Issue

3

fYear

1991

fDate

3/1/1991 12:00:00 AM

Firstpage

284

Lastpage

294

Abstract

A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the improvement of the performance measure of interest under various traffic distributions. The resulting hypercube, called the enhanced hypercube, requires a simple routing algorithm and is guaranteed not to create any traffic-congested points or links. The enhanced hypercube achieves noticeable improvement in diameter, mean internode distance, and traffic density, and it also is more cost effective than a regular hypercube. An efficient broadcast algorithm that can considerably speed up the broadcast process in enhanced hypercubes is provided

Keywords

hypercube networks; performance evaluation; algorithm; broadcast algorithm; connections; diameter; enhanced hypercube; mean internode distance; node pairs; performance measure; traffic density; traffic distributions; unused links; Broadcasting; Computer architecture; Delay; High performance computing; Hypercubes; Manufacturing; Performance analysis; Routing; Telecommunication traffic; Traffic control;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.76405

Filename

76405