DocumentCode
3782680
Title
Distributed and randomized enumeration
Author
P. Dembinski
Author_Institution
Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw, Poland
fYear
2000
Firstpage
62
Lastpage
66
Abstract
The paper describes a randomized distributed enumeration algorithm which (in contrast to deterministic solutions) works for all network topologies and with fully asynchronous communication. The algorithm correctness and efficiency are considered. The expected execution time is of the order of the time needed for a broadcast.
Keywords
"Network topology","Asynchronous communication","Broadcasting"
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 2000. Proceedings. 8th Euromicro Workshop on
ISSN
1066-6192
Print_ISBN
0-7695-0500-7
Type
conf
DOI
10.1109/EMPDP.2000.823395
Filename
823395
Link To Document