Abstract
In this work we study the computational power of graph-based models of distributed computing in which each node additionally has access to a global whiteboard. A node can read the contents of the whiteboard and, when activated, can write one message of O(log n) bits on it. When the protocol terminates, each node computes the output based on the final contents of the whiteboard. We consider several scheduling schemes for nodes, providing a strict ordering of their power in terms of the problems which can be solved with exactly one activation per node. The problems used to separate the models are related to Maximal Independent Set, detection of cycles of length 4, and BFS spanning tree constructions.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.