Allowing each node to communicate only once in a distributed system: shared whiteboard models

DOI10.1007/S00446-014-0221-8MaRDI QIDQ2355326zbMATH OpenOpenAlexWikidataFDO

Authors Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca, Martin Matamala

Publication date 22 July 2015

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-014-0221-8

zbMATH Keywords

bounded communicationdistributed computinggraph propertieslocal computation

Mathematics Subject Classification ID

Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Communication complexity in vertex partition whiteboard model
• scientific article; zbMATH DE number 4104372
• scientific article; zbMATH DE number 1950675
• Minimal communication in a distributed discrete-event system
• scientific article; zbMATH DE number 915978
• scientific article; zbMATH DE number 2112158
• Communication patterns in distributed computations

Cites work

• An extremal function for contractions of graphs
• Communication Complexity of Simultaneous Messages
• Distributed Computing: A Locality-Sensitive Approach
• Equal sums of like powers
• Locality in Distributed Graph Algorithms
• Logical locality entails frugal distributed computation over graphs (extended abstract)
• Lower bound of the Hadwiger number of graphs by their average degree
• On distributing symmetric streaming computations
• The extremal function for complete minors
• Towards a complexity theory for local distributed computing
• What Can be Computed Locally?
• What cannot be computed locally!

Cited in

(5)

• Deciding and verifying network properties locally with few output bits
• The role of randomness in the broadcast congested clique model
• The effect of range and bandwidth on the round complexity in the congested clique model
• The impact of locality in the broadcast congested clique model
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Allowing each node to communicate only once in a distributed system: shared whiteboard models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355326)