Automating Non-Blocking Synchronization In Concurrent Data Abstractions

Zhang, Jiange; Yi, Qing; Dechev, Damian

doi:10.1109/ase.2019.00074

Cited by 1 publication

(1 citation statement)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper is an extended version of our previous work 6 on using source‐to‐source compiler technology to automatically convert sequential C++ data abstractions to lock‐free concurrent implementations, to relieve developers from the error‐prone task of manually crafting and testing the cumbersome low‐level synchronization details, for example, those illustrated in Figures 4–6. Such carefully crafted lock‐free synchronous implementation details have been published for a variety of data structures, for example, queues, 7,8 sets, 9‐11 lists, 9,10 maps, 9,11 and trees, 12‐15 by following a large collection of systematic construction methods 7‐15 .…”

Section: Introductionmentioning

confidence: 99%

Compiler‐driven approach for automating nonblocking synchronization in concurrent data abstractions

Zhang,

Yi,

Peterson

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThis paper presents an extended version of our previous work on using compiler technology to automatically convert sequential C++ data abstractions, for example, queues, stacks, maps, and trees, to concurrent lock‐free implementations. A key difference between our work and existing research in software transactional memory (STM) is that our compiler‐based approach automatically selects the best state‐of‐the‐practice nonblocking synchronization method for the underlying sequential implementation of the data structure. The extended material includes a broader collection of the state‐of‐the‐practice lock‐free synchronization techniques, additional formal correctness proofs of the overall integration of the different synchronizations in our system, and a more comprehensive experimental study of the integrated techniques. We evaluate our compiler‐generated nonblocking data structures both by using a collection of micro‐benchmarks, including the Synchrobench suite, and by using a multi‐threaded application Dedup from PARSEC. Our automatically synchronized code attains performance competitive to that of concurrent data structures manually‐written by experts and much better performance than heavier‐weight support by STM.

show abstract