Everything about Treiber stack

🧭 Start here: a 6-step reading path

1. Read the overview: Treiber stackA 5-minute orientation
2. Go sideways: Hazard pointerA closely related topic
3. Go sideways: ABA problemA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Hazard pointer Hazard pointers, in a multithreaded computing environment, are one approach to solving the problems posed by dynamic memory management of the nodes in…
• ABA problem In multithreaded computing, the ABA problem occurs during synchronization, when a location is read twice, has the same value for both reads, and the read…
• Compare-and-swap In computer science, compare-and-swap (CAS) is an atomic instruction used in multithreading to achieve synchronization. It compares the contents of a memory…
• Linearizability In concurrent programming, an operation (or set of operations) is linearizable if it consists of an ordered list of invocation and response events, that…
• Persistent memory In computer science, persistent memory is any method or apparatus for efficiently storing data structures such that they can continue to be accessed using…
• Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…
• Stack (abstract data type) In computer science, a stack is an abstract data type that serves as a collection of elements with two main operations: Push, which adds an element to…
• Lamport's bakery algorithm Lamport's bakery algorithm is a computer algorithm devised by computer scientist Leslie Lamport, as part of his long study of the formal correctness of…