DocumentCode
3783382
Title
Regular d-neighbours topologies
Author
R. Trobec;U. Jovanovic
Author_Institution
Inst. of Jozef Stefan, Jamova, Slovenia
fYear
2001
fDate
6/23/1905 12:00:00 AM
Firstpage
34
Lastpage
38
Abstract
Topological parameters and routing performances of regular d-neighbours topologies are analysed and discussed in this paper. Average and maximal distances between nodes are compared for hypercubes, 3D-tori, arrangement graphs and recently introduced d-meshes, an extended family of two-dimensional regular meshes of an arbitrary degree d and an isomorphic node neighbourhood. d-meshes are superior in node-to-node distances, in the expansion scalability and in the potential for a planar implementation.
Keywords
"Topology","Hypercubes","Routing","High performance computing","Scalability","Performance evaluation","Multidimensional systems"
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 2001. Proceedings. Ninth Euromicro Workshop on
Print_ISBN
0-7695-0987-8
Type
conf
DOI
10.1109/EMPDP.2001.905004
Filename
905004
Link To Document