Title :
Optimal information dissemination in Star and Pancake networks
Author :
Berthome, P. ; Ferreira, A. ; Perennes, S.
Author_Institution :
Lab. de l´´Inf. du Parallelisme, Ecole Normale Superieure de Lyon, France
Abstract :
The paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide and conquer paradigm for weak order problems on very complex architectures as the Star graph or the Pancake. As applications, we introduce asymptotically optimal algorithms for broadcasting, gossiping, and semigroup operations for such interconnection networks, improving the best known bounds for these problems
Keywords :
divide and conquer methods; graph theory; multiprocessor interconnection networks; parallel algorithms; parallel architectures; Pancake networks; Star graph; asymptotically optimal algorithms; broadcasting; decomposition technique; divide and conquer paradigm; gossiping; hierarchical Cayley graphs; interconnection networks; optimal information dissemination; semigroup operations; weak order problems; Algorithm design and analysis; Application software; Broadcasting; Computer architecture; Computer networks; Concurrent computing; Costs; Intelligent networks; Multiprocessor interconnection networks; Network topology;
Conference_Titel :
Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-4222-X
DOI :
10.1109/SPDP.1993.395462
