Non-Blocking Data Structures is a parallel data structure that ensures progress for at least one thread in a finite number of steps without requiring mutual exclusion, thereby differentiating it from blocking structures that rely on locks and may suffer from thread suspension due to contention or failure.
45
Publications
3.5K
Citations
84
Authors
47
Institutions
Publications per year
2017–2026
4
Variants
Nonblocking Data Structures
Parents
Publications
45
Software transactional memory for dynamic-sized data structures
Maurice Herlihy, Victor Luchangco, Mark Moir et al. · 2003 · 999 citations
Transactional lock-free execution of lock-based programs
Ravi Rajwar, James Goodman · 2002 · 316 citations
Concurrent programming without locks
Keir Fraser, Tim Harris · ACM Transactions on Computer Systems · 2007 · 260 citations
1–5 of 45
Authors
84
- MM
5
h-index
- MH
5
h-index
- NS
4
h-index
- VL
4
h-index
- RR
4
h-index
1–5 of 84
Institutions
47
University of Toronto
Toronto, Canada
5 h-index
9 publications
397 citations
York University
Toronto, Canada
4 h-index
4 publications
210 citations
University of Cambridge
Cambridge, United Kingdom
4 h-index
6 publications
472 citations
Brown University
Providence, United States
4 h-index
4 publications
1.6K citations
University of Wisconsin–Madison
Madison, United States
4 h-index
8 publications
778 citations
University of Rochester
Rochester, United States
3 h-index
4 publications
1K citations
Oracle (United States)
Austin, United States
3 h-index
3 publications
107 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
3 h-index
5 publications
446 citations
1–8 of 47
Venues
- ACM SIGPLAN Notices
3 publications · 58 citations
3
h-index
- ACM Transactions on Computer Systems
TOCS · 2 publications · 385 citations
2
h-index
- Software Practice and Experience
1 publications · 11 citations
1
h-index
- Journal of Geometry
JG · 1 publications · 30 citations
1
h-index
- COMBINATORICA
1 publications · 34 citations
1
h-index
1–5