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

William B. Easton

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

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

Software engineering, systems software and programming languages · 1 · 1 first-author

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 · 100%

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

TopicWeightPapersLastEvidence papers
Concurrent programming › non-blocking algorithms
lock-freedom
0.011971
Process Synchronization without Long-Term Interlock · SOSP 1971
Concurrent programming › synchronization
process synchronization
0.011971
Process Synchronization without Long-Term Interlock · SOSP 1971

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

version numbers · 0.0
YearPublicationVenuePosition
1971 Process Synchronization without Long-Term Interlock
abstract
A technique is presented for replacing long-term interlocking of shared data by the possible repetition of unprivileged code in case a version number (associated with the shared data) has been changed by another process. Four principles of operating system architecture (which have desirable effects on the intrinsic reliability of a system) are presented; implementation of a system adhering to these principles requires that long-term lockout be avoided.
William B. Easton
SOSP1