Proceedings ArticleDOI
Deadline-aware scheduling for Software Transactional Memory
Walther Maldonado,Patrick Marlier,Pascal Felber,Julia Lawall,Giller Muller,Etienne Rivière +5 more
- pp 257-268
Reads0
Chats0
TLDR
This paper proposes to support reactive applications by allowing the developer to annotate some transaction blocks with deadlines by adjusting the transaction execution strategy by decreasing the level of optimism as the deadlines near through two modes of conservative execution, without overly limiting the progress of concurrent transactions.Abstract:
Software Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies the development of parallel programs. Still, the interest of STM has not yet been demonstrated for reactive applications that require bounded response time for some of their operations. We propose to support such applications by allowing the developer to annotate some transaction blocks with deadlines. Based on previous execution statistics, we adjust the transaction execution strategy by decreasing the level of optimism as the deadlines near through two modes of conservative execution, without overly limiting the progress of concurrent transactions. Our implementation comprises a STM extension for gathering statistics and implementing the execution mode strategies. We have also extended the Linux scheduler to disable preemption or migration of threads that are executing transactions with deadlines. Our experimental evaluation shows that our approach significantly improves the chance of a transaction meeting its deadline when its progress is hampered by conflicts.read more
Citations
More filters
Patent
Using the transaction-begin instruction to manage transactional aborts in transactional memory computing environments
TL;DR: In this paper, a transaction-begin instruction specifies an initial value for a transaction count-to-completion (CTC) value, which is adjusted as the transaction progresses.
Proceedings ArticleDOI
Automated Workload Characterization in Cloud-based Transactional Data Grids
Bruno Ciciani,Diego Didona,Pierangelo Di Sanzo,Roberto Palmieri,Sebastiano Peluso,Francesco Quaglia,Paolo Romano +6 more
TL;DR: The key design choices underlying the development of Cloud-TM's Workload Analyzer (WA) are presented, a crucial component of the Cloud- TM platform that is change of three key functionalities: aggregating, filtering and correlating the streams of statistical data gathered from the various nodes of the cloud platform.
Proceedings ArticleDOI
FastLane: improving performance of software transactional memory for low thread counts
TL;DR: Evaluation results indicate that the approach provides promising performance at low thread counts: FastLane almost systematically wins over a classical STM in the 1-6 threads range, and often performs better than sequential execution of the non-instrumented version of the same application starting with 2 threads.
Patent
Hint instruction for managing transactional aborts in transactional memory computing environments
Fadi Y. Busaba,Harold W. Cain,Dan F. Greiner,Michael K. Gschwind,Maged M. Michael,Valentina Salapura,Chung-Lung K. Shum,Timothy J. Slegel +7 more
TL;DR: In this paper, a transaction-hint instruction specifies a transaction count-to-completion (CTC) value for a transaction, which indicates how far a transaction is from completion.
Patent
Adaptive process for data sharing with selection of lock elision and locking
TL;DR: In this article, the authors predict whether a HLE transaction should actually acquire a lock and execute non-transactionally, based on encountering an HLE lock-acquire instruction.
References
More filters
Journal ArticleDOI
Random sampling with a reservoir
TL;DR: Theoretical and empirical results indicate that Algorithm Z outperforms current methods by a significant margin, and an efficient Pascal-like implementation is given that incorporates these modifications and that is suitable for general use.
Proceedings ArticleDOI
STAMP: Stanford Transactional Applications for Multi-Processing
TL;DR: This paper introduces the Stanford Transactional Application for Multi-Processing (STAMP), a comprehensive benchmark suite for evaluating TM systems and uses the suite to evaluate six different TM systems, identify their shortcomings, and motivate further research on their performance characteristics.
Journal Article
Transactional locking II
Dave Dice,Ori Shalev,Nir Shavit +2 more
TL;DR: This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory (STM) algorithm based on a combination of commit-time locking and a novel global version-clock based validation technique, which is ten-fold faster than a single lock.
Book ChapterDOI
Transactional locking II
Dave Dice,Ori Shalev,Nir Shavit +2 more
TL;DR: TL2 as mentioned in this paper is a software transactional memory (STM) algorithm based on a combination of commit-time locking and a novel global version-clock based validation technique, which is ten times faster than a single lock.
Practical lock-freedom
TL;DR: This dissertation introduces and evaluates practical abstractions and data structures that facilitate the development of large-scale lock-free systems and presents an implementation of two useful abstractions that make it easier to develop arbitrary lock- free data structures.