DMCA
Experience with Processes and Monitors in Mesa (1980)
Cached
Download Links
- [www-cse.ucsd.edu]
- [www.cs.ucsd.edu]
- [www.bennetyee.org]
- [cseweb.ucsd.edu]
- [www.bennetyee.org]
- [www.cs.berkeley.edu]
- [www-db.stanford.edu]
- [www.cs.princeton.edu]
- [cs.unomaha.edu]
- [www.cs.pdx.edu]
- [www.cs.berkeley.edu]
- [research.microsoft.com]
- [www.research.microsoft.com]
- [www.stanford.edu]
- [www.eecs.berkeley.edu]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.cs.berkeley.edu]
- [cs.ucsb.edu]
- [www.cs.columbia.edu]
- [research.microsoft.com]
- [www.eecs.berkeley.edu]
- [web.cecs.pdx.edu]
- [bnrg.cs.berkeley.edu]
- [john.regehr.org]
- [www.cs.berkeley.edu]
- [www.cs.berkeley.edu]
- [research.microsoft.com]
| Citations: | 171 - 3 self |
BibTeX
@MISC{Lampson80experiencewith,
author = {Butler W. Lampson and David D. Redell},
title = {Experience with Processes and Monitors in Mesa },
year = {1980}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The use of monitors for describing concurrency has been much discussed in the literature. When monitors are used in real systems of any size, however, a number of problems arise which have not been adequately dealt with: the semantics of nested monitor calls; the various ways of defining the meaning of WAIT; priority scheduling; handling of timeouts, aborts and other exceptional conditions; interactions with process creation and destruction; monitoring large numbers of small objects. These problems are addressed by the facilities described here for concurrent programming in Mesa. Experience with several substantial applications gives us some confidence in the validity of our solutions.
