Axioms for memory access in asynchronous hardware systems
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
The theory of database concurrency control
The theory of database concurrency control
Cache coherence protocols: evaluation using a multiprocessor simulation model
ACM Transactions on Computer Systems (TOCS)
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Memory access buffering in multiprocessors
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Correct memory operation of cache-based multiprocessors
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Memory Access Dependencies in Shared-Memory Multiprocessors
IEEE Transactions on Software Engineering
Munin: distributed shared memory based on type-specific memory coherence
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Proving sequential consistency of high-performance shared memories (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Sequential consistency versus linearizability (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A correctness condition for high-performance multiprocessors (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Consistency guarantees for concurrent shared objects: upper and lower bounds
Consistency guarantees for concurrent shared objects: upper and lower bounds
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)
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
Making operations of concurrent data types fast
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A comprehensive bibliography of distributed shared memory
ACM SIGOPS Operating Systems Review
On distributed object checkpointing and recovery
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
What critical algebraic property allows operations of concurrent abstract data types to be “fast”?
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Eventually-serializable data services
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fault tolerance bounds for memory consistency
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Implementing sequentially consistent shared objects using broadcast and point-to-point communication
Journal of the ACM (JACM)
Sequentially consistent versus linearizable counting networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Timed consistency for shared distributed objects
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Mu3D: a causal consistency protocol for a collaborative VRML editor
VRML '00 Proceedings of the fifth symposium on Virtual reality modeling language (Web3D-VRML)
Implementing a caching service a distributed COBRA objects
IFIP/ACM International Conference on Distributed systems platforms
On the interconnection of causal memory systems
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Sequential consistency as lazy linearizability
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Design and Performance Analysis of a Distributed Java Virtual Machine
IEEE Transactions on Parallel and Distributed Systems
Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions
Proceedings of the 13th International Symposium on Distributed Computing
Consistency Conditions for a CORBA Caching Service
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Sequential Consistency as Lazy Linearizability
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Quorum-Based Replication in Asynchronous Crash-Recovery Distributed Systems (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
View consistencies and exact implementations
Parallel Computing
On the composability of consistency conditions
Information Processing Letters
IEEE Transactions on Knowledge and Data Engineering
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Relationships between memory models
Information Processing Letters
An analysis of update ordering in distributed replication systems
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
On the interconnection of causal memory systems
Journal of Parallel and Distributed Computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Implementing hybrid consistency with high-level synchronization operations
Distributed Computing
Condition Adaptation in Synchronous Consensus
IEEE Transactions on Computers
What service replication middleware can learn from object replication middleware
Proceedings of the 1st workshop on Middleware for Service Oriented Computing (MW4SOC 2006)
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Information Processing Letters
Transformations of self-stabilizing algorithms
Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
Design of a cheat-resistant P2P online gaming system
Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts
A parametrized algorithm that implements sequential, causal, and cache memory consistencies
Journal of Systems and Software
Needed: foundations for transactional memory
ACM SIGACT News
Modularity: a first class concept to address distributed systems
ACM SIGACT News
Fork sequential consistency is blocking
Information Processing Letters
Interconnection of distributed memory models
Journal of Parallel and Distributed Computing
Revising 1-Copy Equivalence in Replicated Databases with Snapshot Isolation
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
On the probabilistic omission adversary
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A parametrized algorithm that implements sequential, causal, and cache memory consistency
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
An intuitionistic epistemic logic for sequential consistency on shared memory
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Competitive freshness algorithms for wait-free data objects
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
One-step consensus solvability
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Analyzing convergence in consistency models for distributed objects
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Allowing atomic objects to coexist with sequentially consistent objects
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
An improved algorithm for adaptive condition-based consensus
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Survey of state melding in virtual worlds
ACM Computing Surveys (CSUR)
Stronger semantics for low-latency geo-replicated storage
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
An epistemic perspective on consistency of concurrent computations
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Dynamic regular registers in systems with churn
Theoretical Computer Science
Hi-index | 0.00 |
The power of two well-known consistency conditions for shared-memory multiprocessors, sequential consistency and linearizability, is compared. The cost measure studied is the worst-case response time in distributed implementations of virtual shared memory supporting one of the two conditions. Three types of shared-memory objects are considered: read/write objects, FIFO queues, and stacks. If clocks are only approximately synchronized (or do not exist), then for all three object types it is shown that linearizability is more expensive than sequential consistency. We show that, for all three data types, the worst-case response time is very sensitive to the assumptions that are made about the timing information available to the system. Under the strong assumption that processes have perfectly synchronized clocks, it is shown that sequential consistency and linearizability are equally costly. We present upper bounds for linearizability and matching lower bounds for sequential consistency. The upper bounds are shown by presenting algorithms that use atomic broadcast in a modular fashion. The lower-bound proofs for the approximate case use the technique of “shifting,” first introduced for studying the clock synchronization problem.