Transaction Scheduling Using Dynamic Conflict Avoidance

Autor(es)

Nicacio, Daniel ^[1] ; Baldassin, Alexandro ^[2] ; Araujo, Guido ^[1]

Afiliação do(s) autor(es)

^[1] Univ Estadual Campinas, Inst Comp, Campinas, SP - Brazil

^[2] Univ Estadual Paulista, Rio Claro, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING; v. 41, n. 1, p. 89-110, FEB 2013.
• Citações Web of Science: 5

Resumo

Software transaction memory (STM) systems have been used as an approach to improve performance, by allowing the concurrent execution of atomic blocks. However, under high-contention workloads, STM-based systems can considerably degrade performance, as transaction conflict rate increases. Contention management policies have been used as a way to select which transaction to abort when a conflict occurs. In general, contention managers are not capable of avoiding conflicts, as they can only select which transaction to abort and the moment it should restart. Since contention managers act only after a conflict is detected, it becomes harder to effectively increase transaction throughput. More proactive approaches have emerged, aiming at predicting when a transaction is likely to abort, postponing its execution. Nevertheless, most of the proposed proactive techniques are limited, as they do not replace the doomed transaction by another or, when they do, they rely on the operating system for that, having little or no control on which transaction to run. This article proposes LUTS, a lightweight user-level transaction scheduler. Unlike other techniques, LUTS provides the means for selecting another transaction to run in parallel, thus improving system throughput. We discuss LUTS design and propose a dynamic conflict-avoidance heuristic built around its scheduling capabilities. Experimental results, conducted with the STAMP and STMBench7 benchmark suites, running on TinySTM and SwissTM, show how our conflict-avoidance heuristic can effectively improve STM performance on high contention applications. (AU)

• Processo FAPESP: 11/19373-6 - Entendendo e explorando a correlação energia/desempenho em algoritmos concorrentes
• Beneficiário: Alexandro José Baldassin
• Modalidade de apoio: Auxílio à Pesquisa - Jovens Pesquisadores