A Key-based Adaptive Transactional Memory Executor

Bai, Tao; Shen, Xipeng; Zhang, C.; Scherer, William N.; Ding, Chen; Scott, Michael L.

doi:10.1109/ipdps.2007.370498

Cited by 21 publications

(9 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We produced versions with and without partition support. Applications were compiled to 32-bit executables and run on an 8-core machine 1 . We also used the classical Linked List micro-benchmark used to evaluate most STM designs for illustrative purposes.…”

Section: Discussionmentioning

confidence: 99%

“…To the best of our knowledge, in the context of transactional memories there are only few works that use partitioning techniques. The most notable is the partitioning of workloads in [1] . Since the focus of this paper is to investige partitioning in the context of transactional memories, we do not discuss partitioning techniques in other areas.…”

Section: Related Workmentioning

confidence: 99%

“…Workload partitioning is proposed in [1] for dictionary-like data structures; a good partitioning will assign transactions to processors in such a way that the load is balanced and data locality is exploited.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Automatic data partitioning in software transactional memories

Riegel¹,

Fetzer²,

Felber

2008

Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We investigate to which extent data partitioning can help improve the performance of software transactional memory (STM). Our main idea is that the access patterns of the various data structures of an application might be sufficiently different so that it would be beneficial to tune the behavior of the STM for individual data partitions. We evaluate our approach using standard transactional memory benchmarks. We show that these applications contain partitions with different characteristics and, despite the runtime overhead introduced by partition tracking and dynamic tuning, that partitioning provides significant performance improvements.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Automatic data partitioning in software transactional memories

Riegel¹,

Fetzer²,

Felber

2008

Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

“…Recently, CAR-STM [29] implemented a similar framework to SOA [21] for a different STM. Additionally, CAR-STM allows users can define a routine to serialize transactions they expect to conflict, although such functionality is similar to that presented by Bai et al [30].…”

Section: Related Workmentioning

confidence: 99%

Improving Performance by Reducing Aborts in Hardware Transactional Memory

Ansari

Khan

Luján

et al. 2010

High Performance Embedded Architectures and Compilers

View full text Add to dashboard Cite

Abstract. The optimistic nature of Transactional Memory (TM) systems can lead to the concurrent execution of transactions that are later found to conflict. Conflicts degrade scalability, and may lead to aborts that increase wasted work, and degrade performance. A promising approach to reducing conflicts at runtime is dynamically, and transparently, reordering the execution of transactions upon discovery of conflicts. This approach has been explored in Software TMs (STMs), but not in Hardware TMs (HTMs). Furthermore, STM implementations of this approach cannot be ported to HTMs easily. This paper investigates the feasibility of such reordering in HTMs, and presents two designs that are scalable, independent of the on-chip interconnect, require only minor modifications to each core, and add no execution overhead if no conflicts occur. The evaluation takes LogTM-SE as a base line and considers benchmarks with different levels of contention (transactional conflicts). The results show that the preferred design increases HTM performance by up to 17% when contention is low, 57% when contention is high, and never degrades performance. Finally, the designs are orthogonal to LogTM-SE; they require no modification to cache structures, and continue to support transaction virtualization, open and closed unbounded nesting, paging, thread suspension, and thread migration.

show abstract

“…Each processor then reconstructs the global work distribution list from the set of local worklists. A similar approach was used by Bai et al [108] to develope a software transactional memory executor that partitions transactions among processors by grouping them based on their search keys.…”

Section: Known Usesmentioning

confidence: 99%

A pattern language for parallelizing irregular algorithms

Monteiro

2010

Proceedings of the 2010 Workshop on Parallel Programming Patterns

View full text Add to dashboard Cite

A Key-based Adaptive Transactional Memory Executor

Cited by 21 publications

References 27 publications

Automatic data partitioning in software transactional memories

Automatic data partitioning in software transactional memories

Improving Performance by Reducing Aborts in Hardware Transactional Memory

A pattern language for parallelizing irregular algorithms

Contact Info

Product

Resources

About