Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ross C. Knippel

dblp:91/6767 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Concurrent programming · 61% Runtime systems and virtual machines · 39%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Concurrent programming › synchronization
locking
0.011999
An Efficient Meta-Lock for Implementing Ubiquitous Synchronization · OOPSLA 1999
Concurrent programming
synchronization
0.011999
An Efficient Meta-Lock for Implementing Ubiquitous Synchronization · OOPSLA 1999
Runtime systems and virtual machines › virtual machine implementation
java virtual machine
0.011999
An Efficient Meta-Lock for Implementing Ubiquitous Synchronization · OOPSLA 1999

Methods — techniques the papers use, named apart from their topics

thread-safe class libraries · 0.0monitors · 0.0
YearPublicationVenuePosition
1999 An Efficient Meta-Lock for Implementing Ubiquitous Synchronization
abstract
Programs written in concurrent object-oriented languages, especially ones that employ thread-safe reusable class libraries, can execute synchronization operations (lock, notify, etc.) at an amazing 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 SPARC™ 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 validated the meta-lock with an implementation of the synchronization operations in a high-performance product-quality Java™ virtual machine and report performance data for several large programs.
Ole Agesen, David Detlefs, Alex Garthwaite, Ross C. Knippel, Y. S. Ramakrishna, Derek White
OOPSLA4