DocumentCode
2436796
Title
The postal network: a versatile interconnection topology
Author
Wu, Jie ; Yang, Yuanyuan
Author_Institution
Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA
fYear
1998
fDate
10-14 Aug 1998
Firstpage
612
Lastpage
619
Abstract
The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibonacci cubes as its special cases. The postal network can also be considered as a flexible version of the hypercube which relaxes the restriction on the number of nodes and thus makes it possible to construct multicomputers with arbitrary sizes. Basically, the postal network forms a series (with series number λ) that is based on the sequence Nλ(n)=Nλ(n-1)+Nλ (n-λ), where n is the dimension and Nλ (n) represents the number of nodes in an n-dimensional postal network in series λ. In this paper; we study topological properties of postal networks and relationships between different postal networks. One application of postal networks is also shown in implementing barrier synchronization using a special spanning tree called a postal tree
Keywords
multiprocessor interconnection networks; tree data structures; Fibonacci cubes; barrier synchronization; hypercube; hypercubes; interconnection network; multicomputers; network design; postal network; postal tree; spanning tree; Computer science; Degradation; Delay; Hamming distance; Hip; Hypercubes; Multiprocessor interconnection networks; Network topology; Routing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1998. Proceedings. 1998 International Conference on
Conference_Location
Minneapolis, MN
ISSN
0190-3918
Print_ISBN
0-8186-8650-2
Type
conf
DOI
10.1109/ICPP.1998.708536
Filename
708536
Link To Document