STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
End-to-end communication in unreliable networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bounded polynomial randomized consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Shared-memory vs. message-passing in an asynchronous distributed environment
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Fast randomized consensus using shared memory
Journal of Algorithms
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
ACM Transactions on Programming Languages and Systems (TOPLAS)
A bound first-in, first-enabled solution to the 1-exclusion problem
Proceedings of the 4th international workshop on Distributed algorithms
Bootstrap network resynchronization (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Simple constant-time consensus protocols in realistic failure models (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Distributed Computing
Distributed Computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
On k-set consensus problems in asynchronous systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A Dynamic Primary Configuration Group Communication Service
Proceedings of the 13th International Symposium on Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Failure Detection Lower Bounds on Registers and Consensus
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
An Efficient Universal Construction for Message-Passing Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Brief announcement: efficient replication of large data objects
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
How fast can a distributed atomic read be?
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
FAB: building distributed enterprise disk arrays from commodity components
ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
Distributed Computing
Constructing regular variables in message passing systems
Journal of Parallel and Distributed Computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Information and Computation
How fast can a very robust read be?
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Fault-tolerant semifast implementations of atomic read/write registers
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
Light-weight leases for storage-centric coordination
International Journal of Parallel Programming
Asynchronous bounded lifetime failure detectors
Information Processing Letters
SQUARE: scalable quorum-based atomic memory with local reconfiguration
Proceedings of the 2007 ACM symposium on Applied computing
FAB: enterprise storage systems on a shoestring
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Long-lived Rambo: Trading knowledge for communication
Theoretical Computer Science
The collective memory of amnesic processes
ACM Transactions on Algorithms (TALG)
Modularity: a first class concept to address distributed systems
ACM SIGACT News
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the robustness of (semi) fast quorum-based implementations of atomic shared memory
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Agreement and consistency without knowing the number of processes
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Local Maps: New Insights into Mobile Agent Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Optimistic Erasure-Coded Distributed Storage
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Fault-tolerant semifast implementations of atomic read/write registers
Journal of Parallel and Distributed Computing
Reconfigurable distributed storage for dynamic networks
Journal of Parallel and Distributed Computing
The extended BG-simulation and the characterization of t-resiliency
Proceedings of the forty-first annual ACM symposium on Theory of computing
Open-source grid technologies for web-scale computing
ACM SIGACT News
Dynamic atomic storage without consensus
Proceedings of the 28th ACM symposium on Principles of distributed computing
Remote storage with byzantine servers
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Efficient Robust Storage Using Secret Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Automatic Verification of Fault-Tolerant Register Emulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Performing work with asynchronous processors: Message-delay-sensitive bounds
Information and Computation
Asynchronous bounded lifetime failure detectors
Information Processing Letters
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
ACM SIGACT News
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Emulating shared-memory Do-All algorithms in asynchronous message-passing systems
Journal of Parallel and Distributed Computing
Communication and data sharing for dynamic distributed systems
Future directions in distributed computing
Brief announcement: a shared disk on distributed storage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Laplacian-based consensus on spatial computers
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Data-centric reconfiguration with network-attached disks
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
Distributed computing: a Glimmer of a theory
Algorithms and theory of computation handbook
The failure detector abstraction
ACM Computing Surveys (CSUR)
Brief announcement: sharing memory in a self-stabilizing manner
DISC'10 Proceedings of the 24th international conference on Distributed computing
Recursion in distributed computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Dynamic atomic storage without consensus
Journal of the ACM (JACM)
Accessing probabilistic quorums in dynamic networks
Proceedings of the Third International Workshop on Reliability, Availability, and Security
The complexity of robust atomic storage
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Robust data sharing with key-value stores
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Pragmatic self-stabilization of atomic memory in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
ACM SIGACT News
Fast Access to Distributed Atomic Memory
SIAM Journal on Computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
Multiwriter Consistency Conditions for Shared Memory Registers
SIAM Journal on Computing
New combinatorial topology bounds for renaming: The upper bound
Journal of the ACM (JACM)
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Brief announcement: fault-tolerant semifast implementations of atomic read/write registers
DISC'06 Proceedings of the 20th international conference on Distributed Computing
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Building and using quorums despite any number of process of crashes
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
(Almost) all objects are universal in message passing systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and Distributed Computing
Supporting domain-specific state space reductions through local partial-order reduction
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Surviving congestion in geo-distributed storage systems
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Self-stabilizing distributed data fusion
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Brief announcement: atomic consistency and partition tolerance in scalable key-value stores
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Distributing trusted third parties
ACM SIGACT News
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
PoWerStore: proofs of writing for efficient and robust storage
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Leveraging sharding in the design of scalable replication protocols
Proceedings of the 4th annual Symposium on Cloud Computing
Theoretical Computer Science
Eliminating unscalable communication in transaction processing
The VLDB Journal — The International Journal on Very Large Data Bases
Dagstuhl seminar review: consistency in distributed systems
ACM SIGACT News
| Hi-index | 0.01 |
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, single-writer multi-reader register in unreliable, asynchronous networks. The two message-passing models considered are a complete network with processor failures and an arbitrary network with dynamic link failures.These results make it possible to view the shared-memory model as a higher-level language for designing algorithms in asynchronous distributed systems. Any wait-free algorithm based on atomic, single-writer multi-reader registers can be automatically emulated in message-passing systems, provided that at least a majority of the processors are not faulty and remain connected. The overhead introduced by these emulations is polynomial in the number of processors in the system.Immediate new results are obtained by applying the emulators to known shared-memory algorithms. These include, among others, protocols to solve the following problems in the message-passing model in the presence of processor or link failures: multi-writer multi-reader registers, concurrent time-stamp systems, l-exclusion, atomic snapshots, randomized consensus, and implementation of data structures.