Optimal Strategies for Spinning and Blocking

@article{Boguslavsky1994OptimalSF,
  title={Optimal Strategies for Spinning and Blocking},
  author={Leonid B. Boguslavsky and Karim Harzallah and Alexander Y. Kreinin and Kenneth C. Sevcik and Alek Vainshtein},
  journal={J. Parallel Distrib. Comput.},
  year={1994},
  volume={21},
  pages={246-254}
}
In parallel and distributed computing environments, threads (or processes) share access to variables and data structures. To assure consistency during updates, locks are used. When a thread attempts to acquire a lock but nds it busy, it must choose between, spinning, which means repeatedly attempting to acquire the lock in the hope that it will become free, and blocking, which means suspending its execution and relinquishing its processor to some other thread. The choice between spinning and… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Eager . The E ect of Scheduling Disciplineon Spin Overhead in Shared Memory Parallel Processors

  • John Zahorjan, Edward D. Lazowska, L. Derek
  • IEEE Transactions on Parallel andDistributed…
  • 1991

Similar Papers

Loading similar papers…