Brief announcement: queuing or priority queuing? on the design of cache-coherence protocols for distributed transactional memory

Authors:
Bo Zhang;Binoy Ravindran
Affiliations:
Virginia Polytechnic Institute, Blacksburg, VA, USA;Virginia Polytechnic Institute, Blacksburg, VA, USA
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 4
Cited 0

Dynamic analysis of the arrow distributed protocol

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Toward a theory of transactional contention managers

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Transactional contention management as a non-clairvoyant scheduling problem

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Location-Aware Cache-Coherence Protocols for Distributed Transactional Contention Management in Metric-Space Networks

SRDS '09 Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In distributed transactional memory (TM) systems, both the management and consistency of a distributed transactional object are ensured by a cache-coherence protocol. We formalize two classes of cache-coherence protocols: distributed queuing cache-coherence (DQC) protocols and distributed priority queuing cache-coherence (DPQC) protocols, both of which can be implemented based on a given distributed queuing protocol. We analyze the two classes of protocols for a set of dynamically generated transactions and compare their time complexities against that of an optimal offline clairvoyant algorithm. We show that a DQC protocol is O(Nlog Dδ)-competitive and a DPQC protocol is O(log Dδ)-competitive for a set of N transactions, where Dδ is the normalized maximum communication latency provided by the underlying distributed queuing protocol.