• Computer Science
  • Published 1995

Correction of a Memory Management Method for Lock-Free Data Structures

@inproceedings{Michael1995CorrectionOA,
  title={Correction of a Memory Management Method for Lock-Free Data Structures},
  author={Maged M. Michael and Michael Leon Scott},
  year={1995}
}
Memory reuse in link-based lock-free data structures requires special care. Many lock-free algorithms require deleted nodes not to be reused until no active pointers point to them. Also, most lock-free algorithms use the compare_and_swap atomic primitive, which can suffer from the ``ABA problem'''' associated with memory reuse. Valois ~\cite{Valois-thesis-1995} proposed a memory management method for link-based data structures that addresses these problems. The method associates a reference… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 78 CITATIONS

Performance of memory reclamation for lockless synchronization

VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Concurrent Reference Counting and Resource Management in Wait-free Constant Time

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Decoupling lock-free data structures from memory reclamation for static analysis

VIEW 1 EXCERPT
CITES METHODS
HIGHLY INFLUENCED

Automatic memory reclamation for lock-free data structures

VIEW 23 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Lock-Free Dynamically Resizable Arrays

VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Concurrent Data Structures

VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Universal wait-free memory reclamation

VIEW 2 EXCERPTS
CITES BACKGROUND

FILTER CITATIONS BY YEAR

1996
2020

CITATION STATISTICS

  • 9 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Lock-free data structures

VIEW 2 EXCERPTS

Lock-free linked lists using compare-and-swap

VIEW 1 EXCERPT

Implementing Lock-Free Queues

VIEW 1 EXCERPT