DocumentCode :
3012986
Title :
On some combinatorial properties of meshes
Author :
Sarbazi-Azad, Hamid
Author_Institution :
Dept. of Comput. Eng., Sharif Univ. of Technol., Tehran, Iran
fYear :
2004
fDate :
10-12 May 2004
Firstpage :
117
Lastpage :
122
Abstract :
The mesh structure has been used as the underlying topology for many practical multicomputers, and has been extensively studied in the past. In this paper, we investigate some topological properties of meshes. In particular, we study the problem of finding the number of nodes located at a given distance from a given node (surface area) and the number of nodes located within a given distance from a given node (volume), and have derived some expressions calculating these numbers.
Keywords :
hypercube networks; mesh generation; parallel architectures; topology; combinatorial properties; mesh structure; multicomputer topology; node finding; surface area; topological properties; Analytical models; Broadcasting; Computer science; Costs; Delay; Network topology; Performance analysis; Telecommunication traffic; Tree data structures; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on
ISSN :
1087-4089
Print_ISBN :
0-7695-2135-5
Type :
conf
DOI :
10.1109/ISPAN.2004.1300468
Filename :
1300468
Link To Document :
بازگشت