AbstractBoth predictable interprocessor synchronization and fast interrupt response are required for real‐time systems constructed using asymmetric shared‐memory multiprocessors. This paper points out that conventional spin lock algorithms cannot satisfy both requirements at the same time and describes two spin lock algorithms that have been proposed to solve this problem. These algorithms, extensions of queuing spin locks modified to be preemptable for servicing interrupts, can give upper bounds on the times to acquire and release an interprocessor lock while achieving a fast response to interrupt requests. The performance measurement of the algorithms demonstrates that the algorithms have required properties. To apply the algorithms to real‐time kernels, we also propose an extended algorithm, which is a combination of the two algorithms.