usenix conference policies
Cheap Mutual Exclusion
Authors:
William Moran, Jr., Swiss Bank Corp Investment Banking; Farnam Jahanian, IBM T.J. Watson Research Center
Abstract:
A new method of enforcing mutual exclusion among concurrent processes on uniprocessors running UNIX is presented in this paper. When a process attempts to obtain a lock, no race condition will occur unless the process is preempted. The central idea is that a process can avoid a race condition if preemption is made visible to the process when it is rescheduled. Two possible implementations of this idea are discussed in depth. The proposed solutions do not require special hardware support or disabling of interrupts during a critical section.
BibTeX
@inproceedings {252397,
author = {William Moran, Jr and Farnam Jahanian},
title = {Cheap Mutual Exclusion},
booktitle = {USENIX Summer 1992 Technical Conference (USENIX Summer 1992 Technical Conference)},
year = {1992},
address = {San Antonio, TX},
url = {https://www.usenix.org/conference/usenix-summer-1992-technical-conference/cheap-mutual-exclusion},
publisher = {USENIX Association},
month = jun
}
author = {William Moran, Jr and Farnam Jahanian},
title = {Cheap Mutual Exclusion},
booktitle = {USENIX Summer 1992 Technical Conference (USENIX Summer 1992 Technical Conference)},
year = {1992},
address = {San Antonio, TX},
url = {https://www.usenix.org/conference/usenix-summer-1992-technical-conference/cheap-mutual-exclusion},
publisher = {USENIX Association},
month = jun
}
connect with us