Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Spinlock

In software engineering, a spinlock is a lock which causes a thread trying to acquire it to simply wait in a loop ("spin") while repeatedly checking… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Bounding worst-case blocking delays due to lock contention is a fundamental problem in the analysis of multiprocessor real-time… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
2013
2013
Partitioned fixed-priority scheduling is widely used in embedded multiprocessor real-time systems due to its simplicity and low… Expand
  • figure 1
  • figure 2
  • figure 3
2012
2012
Reliability of low-level operating-system (OS) code is an indispensable requirement. This includes functional properties from the… Expand
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2012
Highly Cited
2012
Several operating systems rely on non-scalable spin locks for serialization. For example, the Linux kernel uses ticket spin locks… Expand
  • figure 2
  • figure 3
  • figure 7
  • figure 8
  • figure 9
2011
2011
The increasing popularity of multi-core architectures is pushing researchers and developers to consider multi-cores for executing… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 8
  • figure 10
Highly Cited
2005
Highly Cited
2005
The proliferation of multiprocessor servers and multithreaded applications has increased the demand for high-performance… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2001
Highly Cited
2001
Queue-based spin locks allow programs with busy-wait synchronization to scale to very large multiprocessors, without fear of… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
1994
1994
Both predictable interprocessor synchronization and fast interrupt response are required for real-time systems constructed using… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Highly Cited
1993
Highly Cited
1993
We present practical new algorithms for FIFO or priority-ordered spin locks on shared-memory multiprocessors with an atomic swap… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
1990
Highly Cited
1990
  • T. Anderson
  • IEEE Trans. Parallel Distributed Syst.
  • 1990
  • Corpus ID: 3923335
The author examines the questions of whether there are efficient algorithms for software spin-waiting given hardware support for… Expand
  • figure 2
  • table III
  • table V
  • figure 5