DocumentCode :
2634475
Title :
A near-optimal algorithm for gossiping in a d-dimensional mesh bus interconnection network
Author :
Jagota, Arun
Author_Institution :
Dept. of Math. Sci., Memphis Univ., TN, USA
fYear :
1995
fDate :
25-28 Apr 1995
Firstpage :
331
Lastpage :
337
Abstract :
We present a near-optimal algorithm for gossiping in a d-dimensional mesh interconnection network (for arbitrary d⩾2) of busses, under the assumptions that a processor may send/receive simultaneously on all its ports, and message transmission takes unit time regardless of length. For d>2, this significantly improves the known upper bound for gossiping on the d-dimensional mesh bus. The algorithm has an interesting geometric characterization for d=3. We speculate on a possible improvement which, if realizable, would make the algorithm optimal for d=3
Keywords :
multiprocessor interconnection networks; parallel algorithms; d-dimensional mesh bus interconnection network; geometric characterization; gossiping; message transmission; near-optimal algorithm; upper bound; Concurrent computing; Data structures; Distributed computing; Genetic mutations; Intelligent networks; Multiprocessor interconnection networks; Partitioning algorithms; Routing; Sorting; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1995. Proceedings., 9th International
Conference_Location :
Santa Barbara, CA
Print_ISBN :
0-8186-7074-6
Type :
conf
DOI :
10.1109/IPPS.1995.395953
Filename :
395953
Link To Document :
بازگشت