Managing Resource Limitation of Best-Effort HTM

Mohamedin, Mohamed; Palmieri, Roberto; Hassan, Ahmed; Ravindran, Binoy

doi:10.1109/tpds.2017.2668415

Cited by 4 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One characteristic of Intel's TSX implementations is the fact that hardware transactions are aborted when interrupts occur. While this is often regarded as a limitation [47,61], we use the abort-on-interrupt characteristic of TSX to our advantage, as it enables us to maintain the practically wait-free behavior of CSDS algorithms even in the case of frequent context switches, I/O, or other interrupts: even if a thread is within a critical section when the interrupt occurs, the hardware transaction is aborted and locks are not held when threads are not scheduled. This technique does not change the blocking nature of the algorithms: since Intel TSX is best-effort only, we need to provide a fall-back path which uses the actual locks for the situation when a speculative execution of a critical section is repeatedly aborted.…”

Section: Unresponsive Threadsmentioning

confidence: 99%

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

David

Guerraoui

2016

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We argue that there is virtually no practical situation in which one should seek a "theoretically wait-free" algorithm at the expense of a state-of-the-art blocking algorithm in the case of search data structures: blocking algorithms are simple, fast, and can be made "practically wait-free".We draw this conclusion based on the most exhaustive study of blocking search data structures to date. We consider (a) different search data structures of different sizes, (b) numerous uniform and non-uniform workloads, representative of a wide range of practical scenarios, with different percentages of update operations, (c) with and without delayed threads, (d) on different hardware technologies, including processors providing HTM instructions.We explain our claim that blocking search data structures are practically wait-free through an analogy with the birthday paradox, revealing that, in state-of-the-art algorithms implementing such data structures, the probability of conflicts is extremely small. When conflicts occur as a result of context switches and interrupts, we show that HTM-based locks enable blocking algorithms to cope with them.

show abstract

Section: Unresponsive Threadsmentioning

confidence: 99%

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

David

Guerraoui

2016

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

Concurrent Irrevocability in Best-Effort Hardware Transactional Memory

Titos-Gil

Fernández-Pascual

Ros

et al. 2020

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

DAdHTM: Low overhead dynamically adaptive hardware transactional memory for large graphs a scalability study

Qayum

Badawy

Cook

2017

2017 IEEE SmartWorld, Ubiquitous Intelligence &Amp; Computing, Advanced &Amp; Trusted Computed, Scalable Computing &Amp; Commun

View full text Add to dashboard Cite

Big data is a buzzword used to describe massive volumes of data that provides opportunities of exploring new insights through data analytics. However, big data is mostly structured but can be semi-structured or unstructured. It is normally so large that it is not only difficult but also slow to process using traditional computing systems. One of the solutions is to format the data as graph data structures and process them on shared memory architecture to use fast and novel policies such as transactional memory. In most graph applications in big data type problems such as bioinformatics, social networks, and cybersecurity, graphs are sparse in nature. Due to this sparsity, we have the opportunity to use Transactional Memory (TM) as the synchronization policy for critical sections to speedup applications. At low conflict probability TM performs better than most synchronization policies due to its inherent non-blocking characteristics. TM can be implemented in Software, Hardware or a combination of both. However, hardware TM implementations are fast but limited by scarce hardware resources while software implementations have high overheads which can degrade performance. In this paper, we develop a low overhead, yet simple, dynamically adaptive (i.e. at runtime) hybrid (i.e. combines hardware and software) TM (DyAdHyTM) scheme that combines the best features of both Hardware TM (HTM) and Software TM (STM) while adapting to application's requirements. It performs better than coarsegrain lock by up to 8.12x, a low overhead STM by up to 2.68x, a couple of implementations of HTMs (by up to 2.59x), and other HyTMs (by up to 1.55x) for SSCA-2 graph benchmark running on a multicore machine with a large shared memory.

show abstract

Managing Resource Limitation of Best-Effort HTM

Cited by 4 publications

References 25 publications

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Concurrent Irrevocability in Best-Effort Hardware Transactional Memory

DAdHTM: Low overhead dynamically adaptive hardware transactional memory for large graphs a scalability study

Contact Info

Product

Resources

About