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.

Douglas Washabaugh

dblp:70/3333 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
2 papers
Runtime systems and virtual machines · 79% Concurrent programming · 21%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines
garbage collection
0.021995
Concurrent and Distributed Garbage Collection of Active Objects · IEEE Trans. Parallel Distributed Syst. 1995
Incremental Garbage Collection of Concurrent Objects for Real-Time Applications · RTSS 1990
Runtime systems and virtual machines › garbage collection
distributed garbage collection
0.011995
Concurrent and Distributed Garbage Collection of Active Objects · IEEE Trans. Parallel Distributed Syst. 1995
Distributed systems › distributed object systems
distributed garbage collection
0.011995
Concurrent and Distributed Garbage Collection of Active Objects · IEEE Trans. Parallel Distributed Syst. 1995
Concurrent programming › concurrent data structures
concurrent objects
0.011990
Incremental Garbage Collection of Concurrent Objects for Real-Time Applications · RTSS 1990
Runtime systems and virtual machines › garbage collection
real-time garbage collection
0.011990
Incremental Garbage Collection of Concurrent Objects for Real-Time Applications · RTSS 1990
Concurrent programming › concurrency models
active objects
0.011995
Concurrent and Distributed Garbage Collection of Active Objects · IEEE Trans. Parallel Distributed Syst. 1995

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

termination detection · 0.0snapshot algorithm · 0.0memory overhead analysis · 0.0latency analysis · 0.0
YearPublicationVenuePosition
1995 Concurrent and Distributed Garbage Collection of Active Objects
abstract
This paper shows how to perform concurrent and distributed automatic garbage collection of objects possessing their own thread of control. The relevance of garbage collection and active objects to distributed applications is briefly discussed and the specific model of active objects used in the paper is explained. The collector is comprised of independent local collectors, one per node, and a distributed global collector. The mutator (application), the local collectors and the global collector run concurrently. An important part of this paper is the detailed presentation of the algorithms necessary to achieve correct concurrent operation among the collectors and between the collectors and the mutator. The collector builds on previous algorithms for taking snapshots in distributed systems and for detecting termination.>
Dennis G. Kafura, Manibrata Mukherji, Douglas Washabaugh
IEEE Trans. Parallel Distributed Syst.3
1991 Distributed garbage collection of active objects
abstract
Distributed automatic garbage collection of objects possessing their own thread of control is discussed. The relevance of garbage collection and concurrent objects to distributed applications is briefly discussed, and the specific model of concurrent objects used is explained. The collector comprises a collection of independent local collectors, one per node, loosely coupled to a distributed global collector. The mutator (application), the local collectors, and the global collector run concurrently. The synchronization necessary to achieve correct and efficient concurrent operation between the collectors is presented. One interesting aspect of the distributed collector is the termination algorithm.>
Douglas Washabaugh, Dennis G. Kafura
ICDCS1
1990 Incremental Garbage Collection of Concurrent Objects for Real-Time Applications
abstract
The authors show how to perform real-time automatic garbage collection of objects possessing their own thread of control. Beyond its interest as a novel real-time problem, the relevance of automatic management and concurrent objects to real-time applications is briefly discussed. The specific model of concurrent objects used in the paper is explained. A definition of real-time garbage collection is given and an algorithm satisfying this definition is described. An analysis of the relationship between latency, memory overhead and system size shows that this approach is immediately feasible for low-performance real-time systems or multiprocessor real-time systems with a dedicated processor for garbage collection. Future improvements in the collector's performance are outlined.>
Douglas Washabaugh, Dennis G. Kafura
RTSS1