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
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Broadcasting on recursively decomposable Cayley graphs
Proceedings of the international workshop on Broadcasting and gossiping 1990
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Neighborhood Information Dissemination in the Star Graph
IEEE Transactions on Computers
Optimally Balanced Spanning Tree of the Star Network
IEEE Transactions on Computers
A parallel algorithm for Lagrange interpolation on the star graph
Journal of Parallel and Distributed Computing
Optimal Total Exchange in Cayley Graphs
IEEE Transactions on Parallel and Distributed Systems
Reliable Communication in Faulty Star Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
One-to-All Broadcasting Scheme for Static Interconnection Networks with Arbitrary Topology
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On the topological properties of the arrangement-star network
Journal of Systems Architecture: the EUROMICRO Journal
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
An efficient heuristic for broadcasting in networks
Journal of Parallel and Distributed Computing
Efficient heuristics for message dissemination in networks
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Mathematical performance modelling of stretched hypercubes
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Embedding algorithms for bubble-sort, macro-star, and transposition graphs
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Container problem in burnt pancake graphs
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Parallel clustering on the star graph
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Node-to-Set disjoint paths problem in bi-rotator graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Computing the diameter of 17-pancake graph using a PC cluster
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
| Hi-index | 0.01 |
This paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide and conquer paradigm for some problems on very complex architectures as the star graph or the pancake. As applications, we introduce algorithms for broadcasting and prefix-like operations that improve the best known bounds for these problems. We also give the first nontrivial optimal gossiping algorithms for these networks. In star-graphs and pancakes with N = n! processors, our algorithms take less than $\lceil {\rm log}\ N\rceil + 1.5n$ steps.