Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
An efficient reliable broadcast protocol
ACM SIGOPS Operating Systems Review
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tools for Distributed Application Management
Computer - Distributed computing systems: separate resources acting as one
Proving sequential consistency of high-performance shared memories (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Alpha architecture reference manual
Alpha architecture reference manual
A correctness condition for high-performance multiprocessors (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Specifying non-blocking shared memories (extended abstract)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
ACM Transactions on Programming Languages and Systems (TOPLAS)
The process group approach to reliable distributed computing
Communications of the ACM
Implementing hybrid consistency with high-level synchronization operations
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
Making operations of concurrent data types fast
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Weak ordering—a new definition
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Memory consistency and event ordering in scalable shared-memory multiprocessors
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
ACM Transactions on Computer Systems (TOCS)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Implementing FIFO Queus and Stacks (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Deceit: A Flexible Distributed File System
Deceit: A Flexible Distributed File System
Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions
Proceedings of the 13th International Symposium on Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Specifying memory consistency of write buffer multiprocessors
ACM Transactions on Computer Systems (TOCS)
| Hi-index | 0.00 |
In recent years, there is a growing tendency to support high-level synchronization operations, such as read-modify-write, FIFO queues and stacks, as part of the programmer's shared memory model. This paper examines the problem of implementing hybrid consistency with high-level synchronization operations. It is shown that for any implementation of weak consistency, the time required to execute a read-modify-write, a dequeue or a pop operation is Ω(d), where d is the network delay. Following this, an efficient and simple algorithm for providing hybrid consistency that supports most types of high-level synchronization operations and weak read and weak write operations is presented. Weak read and weak write operations are executed instantaneously, while the time required to execute strong operations is O(d). This is within a constant factor of the lower bounds for most of the commonly used types of operations.