30 marca 2017 12:15

Zostanie przedstawiona praca: Zvi Lotker, Boaz Patt--Shamir, Elan Pavlov, i David Peleg, Minimum-weight spanning tree construction in O(log log n) communication rounds.

Abstrakt tej pracy:

We consider a simple model for overlay networks, where all n processes are connected to all other processes, and each message contains at most O(log n) bits. For this model, we present a distributed algorithm which constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to every other process. If message size is Θ(n) for some > 0, then the number of communication rounds is O(log 1).