Real-time scalability of nested spin locks

Authors:
H. Takada;K. Sakamura
Affiliations:
-;-
Venue:
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
Year:
1995

Citing 2
Cited 1

Algorithms for scalable synchronization on shared-memory multiprocessors

ACM Transactions on Computer Systems (TOCS)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers

A Prioritized Multiprocessor Spin Lock

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

When a real-time system is realized on a shared-memory multiprocessor, the worst-case performance of interprocessor synchronizations is one of the most important issues. In this paper, scalability of the maximum execution times of critical sections guarded by nested spin locks is discussed. With the simplest method, the maximum execution times become O(n/sup m/), where n is the number of contending processors and m is the maximum nesting level of locks. In this paper, we propose an algorithm with which this order can be reduced to O(n/spl middot/e/sup m/) and demonstrate its effectiveness when m=2 through performance measurements.