%0 Conference Proceedings
%T Check-Wait-Pounce: Increasing Transactional Data Structure Throughput by Delaying Transactions
%+ University of Central Florida [Orlando] (UCF)
%A Lebanoff, Lance
%A Peterson, Christina
%A Dechev, Damian
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS)
%C Kongens Lyngby, Denmark
%Y José Pereira
%Y Laura Ricci
%I Springer International Publishing
%3 Distributed Applications and Interoperable Systems
%V LNCS-11534
%P 19-35
%8 2019-06-17
%D 2019
%R 10.1007/978-3-030-22496-7_2
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Transactional data structures allow data structures to support transactional execution, in which a sequence of operations appears to execute atomically. We consider a paradigm in which a transaction commits its changes to the data structure only if all of its operations succeed; if one operation fails, then the transaction aborts. In this work, we introduce an optimization technique called Check-Wait-Pounce that increases performance by avoiding aborts that occur due to failed operations. Check-Wait-Pounce improves upon existing methodologies by delaying the execution of transactions until they are expected to succeed, using a thread-unsafe representation of the data structure as a heuristic. Our evaluation reveals that Check-Wait-Pounce reduces the number of aborts by an average of 49.0%. Because of this reduction in aborts, the tested transactional linked lists achieve average gains in throughput of 2.5x, while some achieve gains as high as 4x.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-02319577/document
%2 https://inria.hal.science/hal-02319577/file/485766_1_En_2_Chapter.pdf
%L hal-02319577
%U https://inria.hal.science/hal-02319577
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-DAIS
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-11534