The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1990 vol.1)
pp: 6-16
ABSTRACT
<p>The author examines the questions of whether there are efficient algorithms for software spin-waiting given hardware support for atomic instructions, or whether more complex kinds of hardware support are needed for performance. He considers the performance of a number of software spin-waiting algorithms. Arbitration for control of a lock is in many ways similar to arbitration for control of a network connecting a distributed system. He applies several of the static and dynamic arbitration methods originally developed for networks to spin locks. A novel method is proposed for explicitly queueing spinning processors in software by assigning each a unique number when it arrives at the lock. Control of the lock can then be passed to the next processor in line with minimal effecton other processors.</p>
INDEX TERMS
Index Termsshared data structures; software queueing; CSMA network protocols; Ethernet backoff;multistage interconnection network; shared bus multiprocessors; Symmetry Model B; spinlock alternatives; shared-money multiprocessors; atomic instructions; softwarespin-waiting algorithms; distributed system; dynamic arbitration; delays; parallelprocessing; performance evaluation; storage management
CITATION
T.E. Anderson, "The Performance of Spin Lock Alternatives for Shared-Money Multiprocessors", IEEE Transactions on Parallel & Distributed Systems, vol.1, no. 1, pp. 6-16, January 1990, doi:10.1109/71.80120
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool