by David Mosberger, Peter Druschel, Larry L. Peterson
http://www.cs.rice.edu/~druschel/TR94-07.ps.gz
Add To MetaCart
Abstract:
This paper presents a technique to solve the mutual exclusion problem for uniprocessors purely in software. The idea is to execute atomic sequences without any hardware protection and, in the rare case that the atomic sequence is interrupted, to rollforward to the end of the sequence. The main contribution of this paper is to discuss the OS-related issues of this technique and to demonstrate its practicality, both in terms of flexibility and performance. It proposes a purely software-based technique that achieves mutual exclusion without any memory-accesses. Experiments show that this technique has the potential to outperform equivalent hardware mechanisms.
Citations
|
3148
|
Computer architecture : a quantitative approach, 3rd ed
– Hennessy, Patterson, et al.
- 2003
|
|
409
|
Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism
– Anderson, Bershad, et al.
- 1992
|
|
261
|
A methodology for implementing highly concurrent data objects
– Herlihy
- 1993
|
|
97
|
Alpha Architecture Reference Manual
– Sites
- 1992
|
|
80
|
Synthesis: An efficient implementation of fundamental operating system services
– Massalin
- 1992
|
|
62
|
Fast mutual exclusion for uniprocessors
– Bershad, Redell, et al.
- 1992
|
|
60
|
Practical considerations for non-blocking concurrent objects
– Bershad
- 1993
|
|
31
|
Concurrency features for the Trellis/Owl language
– Moss, Kohler
- 1987
|
|
31
|
Fast Interrupt Priority Management for Operating System Kernels
– Stodolsky, Bershad, et al.
- 1993
|
|
15
|
Memory in the fast lane
– Prince
- 1994
|
|
5
|
1.1 Architecture and Instruction Set Reference Manual
– PA-RISC
- 1992
|
|
3
|
VMS for Alpha Platforms---Internals and Data Structures
– Goldenberg, Saravanan
- 1992
|