An Efficient Meta-lock for Implementing Ubiquitous Synchronization (1999)
Cached
Download Links
- [cs.unomaha.edu]
- [wwwwswest.sun.com]
- [www.sunlabs.com]
- [wwwwswest.sun.com]
- [research.sun.com]
- [research.sun.com]
- [www.sunlabs.com]
- [www.sun.com]
- [www.sunlabs.com]
- DBLP
Other Repositories/Bibliography
| Citations: | 60 - 1 self |
BibTeX
@INPROCEEDINGS{Agesen99anefficient,
author = {Ole Agesen and David Detlefs and Alex Garthwaite and Y. S. Ramakrishna and Derek White},
title = {An Efficient Meta-lock for Implementing Ubiquitous Synchronization},
booktitle = {},
year = {1999},
pages = {207--222}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Programs written in concurrent object-oriented languages, espe-cially ones that employ thread-safe reusable class libraries, can execute synchronization operations (lock, notify, etc.) at an amaz-ing rate. Unless implemented with utmost care, synchronization can become a performance bottleneck. Furthermore, in languages where every object may have its own monitor, per-object space overhead must be minimized. To address these concerns, we have developed a meta-lock to mediate access to synchronization data. The meta-lock is fast (lock + unlock executes in 11 SPARCTM architecture instructions), compact (uses only two bits of space), robust under contention (no busy-waiting), and flexible (supports a variety of higher-level synchronization operations). We have vali-dated the meta-lock with an implementation of the synchronization operations in a high-performance product-quality JavaTM virtual machine and report performance data for several large programs.
