By Topic

Design and analysis of product networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
A. Youssef ; Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA

In this paper a unified theory of Cartesian product networks is developed. Product networks (PN) include meshes, tori, and hypercubes among others. This paper studies the fundamental issues of topological properties, cost-performance ratio optimization, scalability, routing, embedding, and fault tolerance properties of PNs. In particular, the degree, diameter, average distance, connectivity, and node-symmetry of PNs are related to those of their constituent factor networks. Cost/performance analysis and comparison between different PNs, especially n-dimensional meshes/tori and n-dimensional r-ary hypercubes, are conducted, and the optimal trade-off between the number of dimensions and the size along each dimension are identified. Fast generic algorithms for point-to-point routing, broadcasting and permuting on PNs are designed, making use of the corresponding algorithms of the factor networks. Finally, efficient embeddings on PNs are constructed for linear arrays, rings, meshes, tori and trees

Published in:

Frontiers of Massively Parallel Computation, 1995. Proceedings. Frontiers '95., Fifth Symposium on the

Date of Conference:

6-9 Feb 1995