Support material
Introductory reading
State-of-the-art articles
PARALLEL / LOCK-FREE Data structures
|
OPTIMIZING LOCKS
|
WORK STEALING
|
Other papers
|
UNIVERSAL CONSTRUCTIONS AND SIMILAR
Flat combining and the synchronization-parallelism tradeoff by D Hendler, I Incze, N Shavit, M Tzafrir, 2010, SPAA'10 Using elimination to implement scalable and lock-free FIFO queues by Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit, 2005, SPAA'05 Universal constructions that ensure disjoint-access parallelism and wait-freedom by Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers, 2012, PODC'12 |
CORRECTNESS VS PERFORMANCE
quasi-linearizability: relaxed consistency for improved concurrency by Yehuda Afek, Guy Korland, Eitan Yanovsky, 2010, OPODIS'10 Quantitative relaxation of concurrent data structures by Thomas A. Henzinger, Christoph M. Kirsch, Hannes Payer, Ali Sezgin, Ana Sokolova, 2013, POPL'13 |