A Pragmatic Implementation of Non-blocking Linked-Lists

By T. Harris. International Symposium on Distributed Computing, 2001

565 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/3701276417cd3d53f16886bb889e3f4a626460d5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Maged M. Michael
2. Arvind Krishnamurthy
3. Ming Liu
4. Luis Ceze

In Computer Networks and Communications

1. Liang Luo
2. Jacob Nelson
3. Maged M. Michael
4. Arvind Krishnamurthy
5. Ming Liu
6. Kishore Atreya
7. Luis Ceze
8. T. Harris

Citations in the corpus

• IncBricks: Toward In-Network Computation with an In-Network Cache (2017, background): “The hash table uses lock-free operations to access and modify its state [26, 37].”
• Hazard pointers: safe memory reclamation for lock-free objects (2004, methodology): “One crucial difference between hazard pointers and these methods [13], [4], [5] is that the former does not use reference counters or timestamps.”