On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounds on shared memory for mutual exclusion
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Serverless network file systems
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Communications of the ACM
Computing with faulty shared objects
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Petal: distributed virtual disks
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Frangipani: a scalable distributed file system
Proceedings of the sixteenth ACM symposium on Operating systems principles
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Active disks: programming model, algorithms and evaluation
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
A cost-effective, high-bandwidth storage architecture
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Revisiting the PAXOS algorithm
Theoretical Computer Science
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
How to Build a Highly Available System Using Consensus
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The Timed Asynchronous Distributed System Model
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Highly Concurrent Shared Storage
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Backoff Protocols for Distributed Mutual Exclusion and Ordering
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
The Swarm Scalable Storage System
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Data management in a distributed file system for storage area networks
Data management in a distributed file system for storage area networks
ACM SIGACT News
Early-Delivery Dynamic Atomic Broadcast
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
On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Byzantine disk paxos: optimal resilience with byzantine shared memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Light-weight leases for storage-centric coordination
International Journal of Parallel Programming
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
Remote storage with byzantine servers
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Dissecting distributed computations
Future directions in distributed computing
A data-centric approach for scalable state machine replication
Future directions in distributed computing
Brief announcement: flash-log - a high throughput log
DISC'10 Proceedings of the 24th international conference on Distributed computing
DepSky: dependable and secure storage in a cloud-of-clouds
Proceedings of the sixth conference on Computer systems
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
DISC'06 Proceedings of the 20th international conference on Distributed Computing
From paxos to CORFU: a flash-speed shared log
ACM SIGOPS Operating Systems Review
Proactive leader election in asynchronous shared memory systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
DepSky: Dependable and Secure Storage in a Cloud-of-Clouds
ACM Transactions on Storage (TOS)
Computing with infinitely many processes
Information and Computation
Hi-index | 0.00 |
We present an improvement to the Disk Paxos protocol by Gafni and Lamport which utilizes extended functionality and flexibility provided by Active Disks and supports unmediated concurrent data access by an unlimited number of processes. The solution facilitates coordination by an infinite number of clients using finite shared memory. It is based on a collection of read-modify-write objects with faults, that emulate a new, reliable shared memory abstraction called a ranked register. The required read-modify-write objects are readily available in Active Disks and in Object Storage Device controllers, making our solution suitable for state-of-the-art Storage Area Network (SAN) environments.