Skip to main content
Department of Information Technology

Support material

State-of-the-art articles

PARALLEL / LOCK-FREE Data structures
  • NUMA-Aware Reader-Writer Locks by Irina Calciu (Brown University), David Dice (Oracle Labs), Yossi Lev (Oracle Labs), Victor Luchangco (Oracle Labs), Virendra Marathe (Oracle Labs), Nir Shavit (MIT and Tel-Aviv University)
  • Distributed Merge Trees by Dmitriy Morozov (Lawrence Berkeley National Laboratory), Gunther Weber (Lawrence Berkeley National Laboratory
  • Related Materials:
  • The Art of Multiprocessor Programming , Maurice Herlihy and Nir Shavit
  • 7.4 Exponential Backoff
  • 11.3 Elimination
  • 11.4 The Elimination Backoff Stack
  • 12.4 Quiescently Consistent Pools and Counters
  • 12.5 Counting Networks
  • 12.6 Diffracting Trees
  • SNZI: scalable NonZero indicators by Faith Ellen, Yossi Lev, Victor Luchangco and Mark Moir (University of Toronto, Brown University and Sun Microsystems Laboratories)
  • Practical Lock/Unlock Pairing for Concurrent Programs by Hyoun Kyu Cho (University of Michigan), Yin Wang (Hewlett-Packard Labs), Hongwei Liao (University of Michigan), Terence Kelly (Hewlett-Packard Labs), and Stephane Lafortune and Scott Mahlke (University of Michigan)

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


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

Updated  2013-05-23 14:25:37 by Magnus Grandin.