Non-blocking timeout in scalable queue-based spin locks

@inproceedings{Scott2002NonblockingTI,
  title={Non-blocking timeout in scalable queue-based spin locks},
  author={Michael L. Scott},
  booktitle={PODC},
  year={2002}
}
Queue-based spin locks allow programs with busy-wait synchronization to scale to very large multiprocessors, without fear of starvation or performance-destroying contention. Timeout-capable spin locks allow a thread to abandon its attempt to acquire a lock; they are used widely in real-time systems to avoid overshooting a deadline, and in database systems to recover from transaction deadlock and to tolerate preemption of the thread that holds a lock.In previous work we showed how to incorporate… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Building FIFO and Priority-Queueing Spin Locks from Atomic Swap

  • T. S. Craig
  • TR 93- 02-02, Department of Computer Science…
  • 1993
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…