On Scheduling Best-Effort HTM Transactions

Mohamedin, Mohamed; Palmieri, Roberto; Ravindran, Binoy

doi:10.1145/2755573.2755612

Cited by 2 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the information each transaction accesses a lock which is used as scheduling manager. Similarly, in [16], [17] the same principle is used but instead of locks, the number of queues is made variable, so it is increased or decreased based on commit/abort rate. Our research can be considered similar, since we also reduce parallelism (recall several migrated transactions can wait in queue to execute on the "big" core).…”

Section: B Transactional Memorymentioning

confidence: 99%

Migration in Hardware Transactional Memory on Asymmetric Multiprocessor

Sustran

Protić

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

Section: B Transactional Memorymentioning

confidence: 99%

Migration in Hardware Transactional Memory on Asymmetric Multiprocessor

Sustran

Protić

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

Seer

Diegues

Romano

Garbatov

2017

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

The ubiquity of multicore processors has led programmers to write parallel and concurrent applications to take advantage of the underlying hardware and speed up their executions. In this context, Transactional Memory (TM) has emerged as a simple and effective synchronization paradigm, via the familiar abstraction of atomic transactions. After many years of intense research, major processor manufacturers (including Intel) have recently released mainstream processors with hardware support for TM (HTM). In this work, we study a relevant issue with great impact on the performance of HTM. Due to the optimistic and inherently limited nature of HTM, transactions may have to be aborted and restarted numerous times, without any progress guarantee. As a result, it is up to the software library that regulates the HTM usage to ensure progress and optimize performance. Transaction scheduling is probably one of the most well-studied and effective techniques to achieve these goals. However, these recent mainstream HTMs have some technical limitations that prevent the adoption of known scheduling techniques: unlike software implementations of TM used in the past, existing HTMs provide limited or no information on which memory regions or contending transactions caused the abort. To address this crucial issue for HTMs, we propose S eer , a software scheduler that addresses precisely this restriction of HTM by leveraging on an online probabilistic inference technique that identifies the most likely conflict relations and establishes a dynamic locking scheme to serialize transactions in a fine-grained manner. The key idea of our solution is to constrain the portions of parallelism that are affecting negatively the whole system. As a result, this not only prevents performance reduction but also in fact unveils further scalability and performance for HTM. Via an extensive evaluation study, we show that S eer improves the performance of the Intel’s HTM by up to 3.6×, and by 65% on average across all concurrency degrees and benchmarks on a large processor with 28 cores.

show abstract

On Scheduling Best-Effort HTM Transactions

Cited by 2 publications

References 12 publications

Migration in Hardware Transactional Memory on Asymmetric Multiprocessor

Migration in Hardware Transactional Memory on Asymmetric Multiprocessor

Seer

Contact Info

Product

Resources

About