Title :
New degree four networks: properties and performance
Author :
Gessesse, Gebre A. ; Chalasani, Suresh
Author_Institution :
Wisconsin Univ., Madison, WI, USA
Abstract :
Two-dimensional tori, or its variants such as the midimew networks, are the most popular degree-four interconnection networks. However, the number of nodes interconnected by two-dimensional tori or the midimew networks grows as a square of their diameters. The authors discuss two different types of degree-four interconnection networks, the starcake networks and the k-ary 2-cliques. These graphs are regular, vertex-symmetric, maximally fault-tolerant and have a better diameter than the popular degree-four networks. They discuss the construction and routing of these networks and compare them with other interconnection networks. A preliminary performance comparison indicates that the proposed networks offer better throughput-delay characteristics than tori and midimew networks
Keywords :
fault tolerant computing; multiprocessor interconnection networks; performance evaluation; degree four networks; interconnection networks; k-ary 2-cliques; maximally fault-tolerant; performance; properties; regular; routing; starcake networks; throughput-delay characteristics; vertex-symmetric; Algorithm design and analysis; Communication networks; Data processing; Fault tolerance; Multiprocessor interconnection networks; Parallel processing; Routing;
Conference_Titel :
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Conference_Location :
Newport, CA
Print_ISBN :
0-8186-3442-1
DOI :
10.1109/IPPS.1993.262875
