Schemes for avoiding starvation in transactional memory systems
Artikel i vetenskaplig tidskrift, 2009

Transactional memory systems trade ease of programming with run-time performance losses in handling transactions. This paper focuses on starvation effects that show up in systems where unordered transactions are committed on a demand-driven basis. Such simple commit arbitration policies are prone to starvation. The design issues for commit arbitration policies are analyzed and novel policies that reduce the amount of wasted computation due to roll-back and, most important, that avoid starvation are proposed. We analyze in detail how to incorporate them in the transactional coherence and consistency protocol as well as a scalable version of it. The proposed schemes are shown to have no impact on the common-case performance and add quite modest complexity to the baseline protocol. Copyright (C) 2008 John Wiley & Sons, Ltd.

multiprocessors

starvation

transactional memory

Författare

Mridha Mohammad Waliullah

Chalmers, Data- och informationsteknik, Datorteknik

Per Stenström

Chalmers, Data- och informationsteknik, Datorteknik

Concurrency Computation Practice and Experience

1532-0626 (ISSN) 1532-0634 (eISSN)

Vol. 21 7 859-873

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1002/cpe.1363