We consider a class of distributed algorithms. Algorithms in this class consist of processes that communicate using a broadcast. We show that local information suffices to implement such an algo rithm on an arbitrary network. We investigate the time complexity and present some experimental results.
|Title of host publication||Beauty is our business : a birthday salute to Edsger W. Dijkstra|
|Editors||W.H.J. Feijen, A.J.M. Gasteren, van, D. Gries, J. Misra|
|Place of Publication||Berlin|
|Publication status||Published - 1990|
|Name||Texts and monographs in computer science|