Reducing wasteful recurrence of aborts and stalls in hardware transactional memory

Hashimoto, Koshiro; Eto, Masamichi; Horiba, Shoichiro; Tsumura, Tomoaki; Matsuo, Hiroshi

doi:10.1109/hpcsim.2013.6641443

Search citation statements

Order By: Relevance

Paper Sections

Select...

A Problem Of the Traditional Backoff Algorithm1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Other1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have proposed a transaction scheduling for relieving specific conflict patterns [7]. This transaction scheduling can prevent the performance deterioration caused by the specific conflict patterns.…”

Section: A Problem Of the Traditional Backoff Algorithmmentioning

confidence: 99%

Priority-Based Conflict Resolution for Hardware Transactional Memory

Yamada

Hashimoto

Tsumura

2014

2014 Second International Symposium on Computing and Networking

Self Cite

View full text Add to dashboard Cite

Lock-based thread synchronization techniques have been commonly used in parallel programming on multi-core processors. However, lock can cause deadlocks and poor scalabilites, and Transactional Memory (TM) has been proposed and studied for lock-free synchronization. On TMs, transactions are executed speculatively as long as there is no conflict on shared variables. On HTMs, which are the hardware implementations of TM, if a speculative execution of a transaction fails, the re-execution of the transaction should wait a period prescribed by a backoff algorithm to avoid further conflicts. However, the performance of HTM may be decreased drastically by wastefully long backoff periods. To address this problem, in this paper, we propose a new algorithm to set a value called Priority on each transaction, and the transaction which should be aborted is selected according to Priority instead of the initiated time of transactions. The result of the experiment shows that the execution time of HTM is reduced 59.9% in maximum, and 11.2% in average with 16 threads.

show abstract

Section: A Problem Of the Traditional Backoff Algorithmmentioning

confidence: 99%