Window-based greedy contention management for transactional memory

Gokarna Sharma, Brett Estrade, Costas Busch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

We consider greedy contention managers for transactional memory for M × N execution windows of transactions with M threads and N transactions per thread. Assuming that each transaction has duration τ and conflicts with at most C other transactions inside the window, a trivial greedy contention manager can schedule them within τCN time. In this paper, we explore the theoretical performance boundaries of this approach from the worst-case perspective. Particularly, we present and analyze two new randomized greedy contention management algorithms. The first algorithm Offline-Greedy produces a schedule of length O(τ•(C + N log (MN))) with high probability, and gives competitive ratio O(log (MN)) for C ≤ N log (MN). The offline algorithm depends on knowing the conflict graph which evolves while the execution of the transactions progresses. The second algorithm Online-Greedy produces a schedule of length O(τ•(C log (MN) + N log2(MN))), with high probability, which is only a O(log (NM)) factor worse, but does not require knowledge of the conflict graph. Both of the algorithms exhibit competitive ratio very close to O(s), where s is the number of shared resources. Our algorithms provide new tradeoffs for greedy transaction scheduling that parameterize window sizes and transaction conflicts within the window.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 24th International Symposium, DISC 2010, Proceedings
Pages64-78
Number of pages15
DOIs
StatePublished - 2010
Externally publishedYes
Event24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States
Duration: Sep 13 2010Sep 15 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6343 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Symposium on Distributed Computing, DISC 2010
CountryUnited States
CityCambridge, MA
Period9/13/109/15/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Window-based greedy contention management for transactional memory'. Together they form a unique fingerprint.

Cite this