On the power of synchronization between two adjacent processes

DOI10.1007/s00446-010-0115-3zbMath1231.68167OpenAlexW2171323316MaRDI QIDQ660989

Jérémie Chalopin, Yves Métivier

Publication date: 6 February 2012

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-010-0115-3

zbMATH Keywords

local computationselection algorithmlabelled edges

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items (4)

Election in partially anonymous networks with arbitrary knowledge in message passing systems ⋮ Locality and checkability in wait-free computing ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Locality and Checkability in Wait-Free Computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed enumeration
• A complete complexity classification of the role assignment problem
• A self-stabilizing enumeration algorithm.
• Characterizations of classes of graphs recognizable by local computations
• Computation in networks of passively mobile finite-state sensors
• Locally constrained graph homomorphisms and equitable partitions
• Distributed Systems
• Graph Labelings Derived from Models in Distributed Computing
• On the minimal synchronism needed for distributed consensus
• Communicating sequential processes
• Concurrent Processes and Their Syntax
• Introduction to Distributed Algorithms
• Foundations of Software Science and Computation Structures
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: On the power of synchronization between two adjacent processes