TY - GEN

T1 - A competitive analysis for balanced transactional memory workloads

AU - Sharma, Gokarna

AU - Busch, Costas

N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.

PY - 2010

Y1 - 2010

N2 - We consider transactional memory contention management in the context of balanced workloads, where if a transaction is writing, the number of write operations it performs is a constant fraction of its total reads and writes. We explore the theoretical performance boundaries of contention management in balanced workloads from the worst-case perspective by presenting and analyzing two new polynomial time contention management algorithms. The first algorithm Clairvoyant is O(√s)-competitive, where s is the number of shared resources. This algorithm depends on explicitly knowing the conflict graph. The second algorithm Non-Clairvoyant is O(√s·log n)-competitive, with high probability, which is only a O(log n) factor worse, but does not require knowledge of the conflict graph, where n is the number of transactions. Both of these algorithms are greedy. We also prove that the performance of Clairvoyant is tight, since there is no polynomial time contention management algorithm that is better than O((√s)1-ε)-competitive for any constant ε > 0, unless NP⊆ZPP. To our knowledge, these results are significant improvements over the best previously known O(s) competitive ratio bound.

AB - We consider transactional memory contention management in the context of balanced workloads, where if a transaction is writing, the number of write operations it performs is a constant fraction of its total reads and writes. We explore the theoretical performance boundaries of contention management in balanced workloads from the worst-case perspective by presenting and analyzing two new polynomial time contention management algorithms. The first algorithm Clairvoyant is O(√s)-competitive, where s is the number of shared resources. This algorithm depends on explicitly knowing the conflict graph. The second algorithm Non-Clairvoyant is O(√s·log n)-competitive, with high probability, which is only a O(log n) factor worse, but does not require knowledge of the conflict graph, where n is the number of transactions. Both of these algorithms are greedy. We also prove that the performance of Clairvoyant is tight, since there is no polynomial time contention management algorithm that is better than O((√s)1-ε)-competitive for any constant ε > 0, unless NP⊆ZPP. To our knowledge, these results are significant improvements over the best previously known O(s) competitive ratio bound.

UR - http://www.scopus.com/inward/record.url?scp=78650855858&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650855858&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-17653-1_26

DO - 10.1007/978-3-642-17653-1_26

M3 - Conference contribution

AN - SCOPUS:78650855858

SN - 3642176526

SN - 9783642176524

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 348

EP - 363

BT - Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings

T2 - 14th International Conference on Principles of Distributed Systems, OPODIS 2010

Y2 - 14 December 2010 through 17 December 2010

ER -