Name
Abstract | ||
|---|---|---|
This paper investigates using compiler technology to automatically convert sequential C++ data abstractions, e.g., queues, stacks, maps, and trees, to concurrent lock-free implementations. By automatically tailoring a number of state-of-the-practice synchronization methods to the underlying sequential implementations of different data structures, our automatically synchronized code can attain performance competitive to that of concurrent data structures manually-written by experts and much better performance than heavier-weight support by software transactional memory (STM).
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ASE.2019.00074 | ASE |
Keywords | Field | DocType |
Concurrency,Parallel Programming,Automation Compilers,Data Structures | Software transactional memory,Data structure,Synchronization,Programming language,Computer science,Concurrency,Queue,Compiler,Theoretical computer science,Implementation,Concurrent data structure | Conference |
ISSN | ISBN | Citations |
1938-4300 | 978-1-7281-2508-4 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiange Zhang | 1 | 1 | 1.03 |
| Qing Yi | 2 | 190 | 11.89 |
| Damian Dechev | 3 | 81 | 22.87 |