# BKN+12

### Summary

**Florent Becker and Adrian Kosowski and Nicolas Nisse and Ivan Rapaport and Karol Suchan** (2012) *Allowing each node to communicate only once in a distributed system: shared whiteboard models..* In 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). jun. ACM, pages 11-17. (PDF)

### Abstract

In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and links may indicate telephone calls). Since such graphs are massive they need to be processed in a distributed and streaming way. When computing graph-theoretic properties, nodes become natural units for distributed computation. Links do not necessarily represent communication channels between the computing units and therefore do not restrict the communication flow. Our goal is to model and analyze the computational power of such distributed systems where one computing unit is assigned to each node. Communication takes place on a whiteboard where each node is allowed to write at most one message. Every node can read the contents of the whiteboard and, when activated, can write one small message based on its local knowledge. When the protocol terminates its output is computed from the final contents of the whiteboard. We describe four synchronization models for accessing the whiteboard. We show that message size and synchronization power constitute two orthogonal hierarchies for these systems. We exhibit problems that separate these models, i.e., that can be solved in one model but not in a weaker one, even with increased message size. These problems are related to maximal independent set and connectivity. We also exhibit problems that require a given message size independently of the synchronization model. #BKN+12Bib

### Bibtex entry

`@INPROCEEDINGS { BKN+12,`

AUTHOR = { Florent Becker and Adrian Kosowski and Nicolas Nisse and Ivan Rapaport and Karol Suchan },

TITLE = { Allowing each node to communicate only once in a distributed system: shared whiteboard models. },

BOOKTITLE = { 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) },

ABSTRACT = { In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and links may indicate telephone calls). Since such graphs are massive they need to be processed in a distributed and streaming way. When computing graph-theoretic properties, nodes become natural units for distributed computation. Links do not necessarily represent communication channels between the computing units and therefore do not restrict the communication flow. Our goal is to model and analyze the computational power of such distributed systems where one computing unit is assigned to each node. Communication takes place on a whiteboard where each node is allowed to write at most one message. Every node can read the contents of the whiteboard and, when activated, can write one small message based on its local knowledge. When the protocol terminates its output is computed from the final contents of the whiteboard. We describe four synchronization models for accessing the whiteboard. We show that message size and synchronization power constitute two orthogonal hierarchies for these systems. We exhibit problems that separate these models, i.e., that can be solved in one model but not in a weaker one, even with increased message size. These problems are related to maximal independent set and connectivity. We also exhibit problems that require a given message size independently of the synchronization model. },

YEAR = { 2012 },

MONTH = { jun },

PAGES = { 11-17 },

PUBLISHER = { ACM },

EE = { http://arxiv.org/abs/1109.6534 },

PDF = { http://hal.inria.fr/inria-00627910/PDF/RR-7746.pdf },

}