A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computational geometry
Parallel computational geometry
Static and dynamic communication in parallel computing
Static and dynamic communication in parallel computing
Optimal communication algorithms on star graphs using spanning tree constructions
Journal of Parallel and Distributed Computing
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Transposition Networks as a Class of Fault-Tolerant Robust Networks
IEEE Transactions on Computers
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets
IEEE Transactions on Parallel and Distributed Systems
Communication Aspects of the Star Graph Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Embedding Complete Binary Trees into Star Networks
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
A New Representation of Graphs and Its Applications to Parallel Processing
ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
The Index-Permutation Graph Model for Hierarchical Interconnection Networks
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Routing and Embeddings in Cyclic Petersen Networks: An Efficient Extension of the Petersen Graph
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Efficient low-degree interconnection networks for parallel processing: topologies, algorithms, vlsi layouts, and fault tolerance
| Hi-index | 0.00 |
In this paper, we introduce super Cayley graphs, a class of communication-efficient networks for parallel processing. We show that super Cayley graphs can embed trees, meshes, hypercubes, as well as star, bubble-sort graphs, and transposition networks with constant dilation. We also show that algorithms developed for star graphs can be emulated on suitably constructed super Cayley graphs with asymptotically optimal slowdown, under several communication models. Basic communication tasks, such as the multinode broadcast (MNB) and the total exchange (TE), can be executed in suitably constructed super Cayley graphs in asymptotically optimal time. Moreover, no interconnection network with similar node degree can perform these communication tasks in time that is better by more than a constant factor than that required in suitably constructed super Cayley graphs.