scispace - formally typeset
Proceedings ArticleDOI

Enhancing efficiency of hybrid transactional memory via dynamic data partitioning schemes

TLDR
DMP-TM (Dynamic Memory Partitioning-TM), a novel HyTM algorithm that exploits the idea of leveraging operating system-level memory protection mechanisms to detect conflicts between HTM and STM transactions, to achieve robust performance even in unfavourable workload that exhibits high contention between the STM and HTM path.
Abstract
Transactional Memory (TM) is an emerging paradigm that promises to significantly ease the development of parallel programs. Hybrid TM (HyTM) is probably the most promising implementation of the TM abstraction, which seeks to combine the high efficiency of hardware implementations (HTM) with the robustness and flexibility of software-based ones (STM). Unfortunately, though, existing Hybrid TM systems are known to suffer from high overheads to guarantee correct synchronization between concurrent transactions executing in hardware and software. This article introduces DMP-TM (Dynamic Memory Partitioning-TM), a novel HyTM algorithm that exploits, to the best of our knowledge for the first time in the literature, the idea of leveraging operating system-level memory protection mechanisms to detect conflicts between HTM and STM transactions. This innovative design allows for employing highly scalable STM implementations, while avoiding instrumentation on the HTM path. This allows DMP-TM to achieve up to ~ 20× speedups compared to state of the art Hybrid TM solutions in uncontended workloads. Further, thanks to the use of simple and lightweight self-tuning mechanisms, DMP-TM achieves robust performance even in unfavourable workload that exhibits high contention between the STM and HTM path.

read more

Citations
More filters
Journal Article

A Lazy Snapshot Algorithm with Eager Validation

TL;DR: This paper formally introduces a lazy snapshot algorithm that verifies at each object access that the view observed by a transaction is consistent and demonstrates that the performance is quite competitive by comparing other STMs with an STM that uses the algorithm.

Reduced hardware transactions: a new approach to hybrid transactional memory

TL;DR: Reduced hardware (RH) transactions overcomes the problem of unacceptably high instrumentation overhead in hardware transactions by using a new approach which is called reduced software slow-path, which is obstruction-free, allows execution of long transactions and protected instructions that may typically cause hardware transactions to fail, and allows complete concurrency between hardware and software transactions.
Journal ArticleDOI

Extending hardware transactional memory capacity via rollback-only transactions and suspend/resume

TL;DR: P8TM is proposed, a novel approach that mitigates this limitation on IBM’s POWER8 architecture by leveraging a key combination of hardware and software techniques to support different execution paths and also relies on self-tuning mechanisms aimed at dynamically switching between different execution modes to best adapt to the workload characteristics.

Techniques for Enhancing the Efficiency of Transactional Memory Systems

Shady Issa
TL;DR: Transactional Memory (TM) is an emerging programming paradigm that drastically simplifies the development of concurrent applications by relieving programmers from a major source of complexity: how to deal with distributed systems.
References
More filters
Proceedings ArticleDOI

Transactional memory: architectural support for lock-free data structures

TL;DR: Simulation results show that transactional memory matches or outperforms the best known locking techniques for simple benchmarks, even in the absence of priority inversion, convoying, and deadlock.
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 ArticleDOI

Schism: a workload-driven approach to database replication and partitioning

TL;DR: Schism consistently outperforms simple partitioning schemes, and in some cases proves superior to the best known manual partitioning, reducing the cost of distributed transactions up to 30%.
Proceedings ArticleDOI

RAPL: memory power estimation and capping

TL;DR: This paper proposes a new approach for measuring memory power and demonstrating its applicability to a novel power limiting algorithm and shows that it achieves up to 40% lower performance impact when compared to the state-of-art baseline across the power limiting range.
Proceedings ArticleDOI

Hybrid transactional memory

TL;DR: Using a simulated multiprocessor with HTM support, the viability of the HyTM approach is demonstrated: it can provide performance and scalability approaching that of an unbounded HTM implementation, without the need to support all transactions with complicatedHTM support.
Related Papers (5)