Classifying rendezvous tasks of arbitrary dimension

DOI10.1016/j.tcs.2009.01.033zbMath1166.68006OpenAlexW2162458446MaRDI QIDQ1019731

Zhiwei Xu, Xingwu Liu, Pan, Jian Zhong

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.033

zbMATH Keywords

classificationrendezvousdistributed computingcomputabilityloop agreement

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (4)

Unnamed Item ⋮ Power and limits of distributed computing shared memory models ⋮ Locality and checkability in wait-free computing ⋮ The evolution of non-degenerate and degenerate rendezvous tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to meet in anonymous network
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• A classification of wait-free loop agreement tasks
• Asynchronous deterministic rendezvous in graphs
• Tight bounds for k -set agreement
• The topological structure of asynchronous computability
• Impossibility of distributed consensus with one faulty process
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Wait-free k-set agreement is impossible
• Towards a topological characterization of asynchronous complexity
• Introduction to homotopy theory

This page was built for publication: Classifying rendezvous tasks of arbitrary dimension