• DocumentCode
    3089102
  • Title

    On Adaptive Contention Management Strategies for Software Transactional Memory

  • Author

    Yu, Xiao ; He, Zhengyu ; Hong, Bo

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
  • fYear
    2012
  • fDate
    10-13 July 2012
  • Firstpage
    24
  • Lastpage
    31
  • Abstract
    Software Transaction Memory (STM) is an alternative synchronization method to the traditional lock-based schemes. In an STM system, the contention manager(CM) decides what action to take when a conflict occurs. CM is crucial to the performance of STM systems. However, the performance of existing CMs is sensitive to the transaction workloads and STM configurations. A static policy is therefore unsatisfactory. In this paper, we argue that adaptive contention manager (ACM) is necessary and feasible. We further present an ACM policy that can adaptively choose a suitable CM during run-time. We prove that our adaptation strategy preserves live-lock (starvation) freedom as long as the pool of CMs to adapt from contains at least one live-lock free (starvation free) CM. Experimental results demonstrate that our approach can choose proper CMs and achieves higher average throughput than existing static CM strategies.
  • Keywords
    parallel programming; software engineering; storage management; transaction processing; STM systems; adaptive contention management; lock-based schemes; software transactional memory; static policy; Approximation methods; Benchmark testing; History; Memory management; Software; Switches; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing with Applications (ISPA), 2012 IEEE 10th International Symposium on
  • Conference_Location
    Leganes
  • Print_ISBN
    978-1-4673-1631-6
  • Type

    conf

  • DOI
    10.1109/ISPA.2012.12
  • Filename
    6280271