Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks

Authors:
Behrooz Parhami;Mikhail A. Rakov
Affiliations:
IEEE;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2005

Citing 16
Cited 4

Fault diameter of interconnection networks

Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Modified-Mesh Connected Parallel Computers

IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Horizons of parallel computation

Journal of Parallel and Distributed Computing
Distributed loop computer networks: a survey

Journal of Parallel and Distributed Computing
The Cross Product of Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks

IEEE Transactions on Parallel and Distributed Systems
Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
Problems with Comparing Interconnection Networks: Is an Alligator Better Than an Armadillo?

IEEE Parallel & Distributed Technology: Systems & Technology
Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses

IEEE Transactions on Parallel and Distributed Systems
Hierarchical Swapped Networks: Efficient Low-Degree Alternatives to Hypercubes and Generalized Hypercubes

ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors

ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Incomplete k-ary n-cube and its derivatives

Journal of Parallel and Distributed Computing
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II

Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Global data computation in chordal rings

Journal of Parallel and Distributed Computing
A design methodology for optimally folded, pipelined architectures in VLSI applications using projective space lattices

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Perfect difference networks (PDNs) that are based on the mathematical notion of perfect difference sets have been shown to comprise an asymptotically optimal method for connecting a number of nodes into a network with diameter 2. Justifications for, and mathematical underpinning of, PDNs appear in a companion paper. In this paper, we compare PDNs and some of their derivatives to interconnection networks with similar cost/performance, including certain generalized hypercubes and their hierarchical variants. Additionally, we discuss point-to-point and collective communication algorithms and derive a general emulation result that relates the performance of PDNs to that of complete networks as ideal benchmarks. We show that PDNs are quite robust, both with regard to node and link failures that can be tolerated and in terms of blandness (not having weak spots). In particular, we prove that the fault diameter of PDNs is no greater than 4. Finally, we study the complexity and scalability aspects of these networks, concluding that PDNs and their derivatives allow the construction of very low diameter networks close to any arbitrary desired size and that, in many respects, PDNs offer optimal performance and fault tolerance relative to their complexity or implementation cost.