Skip to Main content Skip to Navigation

Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power

Florent Becker 1 Adrian Kosowski 2, 3 Nicolas Nisse 4 Ivan Rapaport 5, 6 Karol Suchan 7 
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
4 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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. A message is only based on the local knowledge of the node and the current content of the whiteboard. When the protocol terminates, each node computes the output based on the final contents of the whiteboard in order to answer some question on the network's topology. We propose a framework to formally define several scenarios modelling how nodes access the whiteboard, in a synchronous way or not. This extends the work of Becker {\it et al.} [IPDPS 2011] where nodes were imposed to create their messages only based on their local knowledge (i.e., with the whiteboard empty). We prove that the four models studied have increasing power of computation: any problem that can be solved in the weakest one can be solved in the the second, and so on. Moreover, we exhibit problems that {\it separate} models, i.e., that can be solved in one model but not in a weaker one. These problems are related to Maximal Independent Set and detection of cycles. Finally we investigate problems related to connectivity as the construction of spanning- or BFS-tree in our different models.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Nicolas Nisse Connect in order to contact the contributor
Submitted on : Thursday, September 29, 2011 - 7:35:48 PM
Last modification on : Saturday, June 25, 2022 - 11:06:45 PM
Long-term archiving on: : Sunday, December 4, 2016 - 6:12:23 AM


Files produced by the author(s)


  • HAL Id : inria-00627910, version 1


Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan. Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. [Research Report] RR-7746, INRIA. 2011. ⟨inria-00627910⟩



Record views


Files downloads