Parallel implementations of Brunotte's algorithm
From MaRDI portal
Publication:635350
DOI10.1016/j.jpdc.2010.12.010zbMath1219.68167OpenAlexW2000949031MaRDI QIDQ635350
Publication date: 19 August 2011
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.12.010
Analysis of algorithms (68W40) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Uses Software
Cites Work
- Performance of memory reclamation for lockless synchronization
- Number expansions in lattices
- Lock-free dynamic hash tables with open addressing
- Toward exploitation of cell multi‐processor array in time‐consuming applications by using CNN model
- Time, clocks, and the ordering of events in a distributed system
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
- Split-ordered lists
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parallel implementations of Brunotte's algorithm