Afficher la notice abrégée

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

hal.structure.identifierLaboratoire d'Informatique Fondamentale d'Orléans [LIFO]
dc.contributor.authorBECKER, Florent
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorKOSOWSKI, Adrian
hal.structure.identifierAlgorithms, simulation, combinatorics and optimization for telecommunications [MASCOTTE]
dc.contributor.authorNISSE, Nicolas
hal.structure.identifierDepartamento de Ingeniería Matemática [Santiago] [DIM]
hal.structure.identifierCentre de modélisation mathématique / Centro de Modelamiento Matemático [Santiago] [CMM]
dc.contributor.authorRAPAPORT, Ivan
hal.structure.identifierFacultad de Ingeniería y Ciencias [Santiago]
dc.contributor.authorSUCHAN, Karol
dc.date.accessioned2024-04-15T09:46:53Z
dc.date.available2024-04-15T09:46:53Z
dc.date.issued2011
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198047
dc.description.abstractEnIn 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.
dc.language.isoen
dc.title.enInterconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power
dc.typeRapport
dc.subject.halInformatique [cs]/Algorithme et structure de données [cs.DS]
dc.subject.halInformatique [cs]/Théorie de l'information [cs.IT]
dc.subject.halMathématiques [math]/Théorie de l'information et codage [math.IT]
dc.description.sponsorshipEuropeEUropean software defined radio for WireLEss in joint secuRity operations.
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.type.institutionINRIA
bordeaux.type.reportrr
hal.identifierinria-00627910
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00627910v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2011&rft.au=BECKER,%20Florent&KOSOWSKI,%20Adrian&NISSE,%20Nicolas&RAPAPORT,%20Ivan&SUCHAN,%20Karol&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée