Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18042
Title: Routing Properties of a Recursive Interconnection Network
Authors: Chang, RKC 
Wang, HY
Keywords: Communication locality
Cubic networks
Interconnection networks
Recursive topologies
Shortest-path routing algorithms
Issue Date: 2001
Publisher: Academic Press
Source: Journal of parallel and distributed computing, 2001, v. 61, no. 6, p. 838-849 How to cite?
Journal: Journal of parallel and distributed computing 
Abstract: In this paper, we consider a highly recursive interconnection network known as the fully connected cubic network (FCCN). By exploiting its recursive properties, we thoroughly analyze the performance of a simple routing algorithm for the FCCN. We show that at least 80% of the routes obtained from this simple algorithm are shortest paths, and this percentage increases further with the network size. Subsequently, we obtain the network diameter and average internodal distance, taking into account the communication locality that is exhibited in many parallel computations. The presence of the communication locality significantly reduces the average internodal distance.
URI: http://hdl.handle.net/10397/18042
ISSN: 0743-7315
DOI: 10.1006/jpdc.2001.1729
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Nov 6, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Nov 1, 2017

Page view(s)

50
Last Week
0
Last month
Checked on Nov 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.