Real-time scalability of nested spin locks

H. Takada; K. Sakamura

doi:10.1109/RTCSA.1995.528766

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by H. Takada Articles by K. Sakamura

Second International Workshop on Real-Time Computing Systems and Applications (RTCSA'95)

Real-time scalability of nested spin locks

Tokyo, Japan

October 25-October 27

ISBN: 0-8186-7106-8

	ASCII Text	x
	H. Takada, K. Sakamura, "Real-time scalability of nested spin locks," 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp. 160, Second International Workshop on Real-Time Computing Systems and Applications (RTCSA'95), 1995.

	BibTex	x
	@article{ 10.1109/RTCSA.1995.528766, author = {H. Takada and K. Sakamura}, title = {Real-time scalability of nested spin locks}, journal ={2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications}, volume = {0}, year = {1995}, isbn = {0-8186-7106-8}, pages = {160}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1995.528766}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications TI - Real-time scalability of nested spin locks SN - 0-8186-7106-8 SP EP A1 - H. Takada, A1 - K. Sakamura, PY - 1995 KW - synchronisation; real-time systems; shared memory systems; performance evaluation; real-time scalability; nested spin locks; real-time system; shared-memory multiprocessor; worst-case performance; interprocessor synchronizations; maximum execution times; maximum nesting level; performance measurements VL - 0 JA - 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications ER -

H. Takada, Dept. of Inf. Sci., Tokyo Univ., Japan

K. Sakamura, Dept. of Inf. Sci., Tokyo Univ., Japan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.1995.528766

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.

Index Terms:

synchronisation; real-time systems; shared memory systems; performance evaluation; real-time scalability; nested spin locks; real-time system; shared-memory multiprocessor; worst-case performance; interprocessor synchronizations; maximum execution times; maximum nesting level; performance measurements

Citation:

H. Takada, K. Sakamura, "Real-time scalability of nested spin locks," rtcsa, pp.160, Second International Workshop on Real-Time Computing Systems and Applications (RTCSA'95), 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.