Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models

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 , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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 {\it 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.
Type de document :
Communication dans un congrès
SPAA - 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012, United States. pp.7, 2012
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00704200
Contributeur : Nicolas Nisse <>
Soumis le : lundi 4 juin 2012 - 22:51:00
Dernière modification le : mercredi 14 décembre 2016 - 01:03:28
Document(s) archivé(s) le : jeudi 15 décembre 2016 - 11:00:59

Fichier

spaa-12.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00704200, version 1

Citation

Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan. Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models. SPAA - 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012, United States. pp.7, 2012. <hal-00704200>

Partager

Métriques

Consultations de
la notice

542

Téléchargements du document

145