Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Renaming in an asynchronous environment
Journal of the ACM (JACM)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Locality in distributed graph algorithms
SIAM Journal on Computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Designing programs that check their work
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
SIAM Journal on Computing
Information Processing Letters
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient learning of typical finite automata from random walks
Information and Computation
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Three-Processor Tasks Are Undecidable
SIAM Journal on Computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Distributed Algorithms
Self-Testing/Correcting Protocols (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Communication algorithms with advice
Journal of Computer and System Sciences
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Brief announcement: what can be computed without communication?
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
What can be computed without communications?
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Computability in distributed computing: a Tutorial
ACM SIGACT News
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
What can be decided locally without identifiers?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Hi-index | 0.00 |
This paper studies notions of locality that are inherent to the specification of a distributed task and independent of the computing environment, in a shared memory wait-free system. A locality property called projection-closed is identified, that completely characterizes tasks that are wait-free checkable. A task T = (I,O,Δ) is checkable if there exists a wait-free distributed algorithm that, given s ∈ I and t ∈ O, determines whether t ∈ Δ(s), i.e., if t is a valid output for s according to the specification of T. Moreover, determining whether a projection-closed task is wait-free solvable remains undecidable, and hence this is a rich class of tasks. A stronger notion of locality considers tasks where the outputs look identically to the inputs at every vertex (input value of a process). A task T = (I,O,Δ) is said to be locality-preserving if O is a covering complex of I. This topological property yields obstacles for wait-free solvability different in nature from the classical agreement impossibility results. On the other hand, locality-preserving tasks are projection-closed and therefore always wait-free checkable. A classification of localitypreserving tasks in term of their relative computational power is provided. A correspondence between locality-preserving tasks and subgroups of the edgepath group of an input complex shows the existence of hierarchies of locality-preserving tasks, each one containing at the top the universal task (induced by the universal covering complex), and at the bottom the trivial identity task.