The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case

In Moran and Warmuth (1993, SIAM .J. Comput.22, No. 2, 379-399), it was shown that computing any non-constant function on a ring of n of processors requires Ω(n log) bits and this bound is tight. This model assumed that all the processors in the ring are identical (anonymous), i.e., all processors r...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation 1994-01, Vol.108 (1), p.34-50
Hauptverfasser:	Bodlaender, H.L., Moran, S., Warmuth, M.K.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Software Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!