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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Marcel Schelvis

dblp:76/4189 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1989
0009-0000-0275-2220ORCID · reported

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

Software engineering, systems software and programming languages · 2 · 2 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
Runtime systems and virtual machines · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines › garbage collection
cyclic garbage collection		 0.011989
Incremental Distribution of Timestamp Packets: A New Approach to Distributed Garbage Collection · OOPSLA 1989
Runtime systems and virtual machines › garbage collection
distributed garbage collection		 0.011989
Incremental Distribution of Timestamp Packets: A New Approach to Distributed Garbage Collection · OOPSLA 1989
Runtime systems and virtual machines
garbage collection		 0.011989
Incremental Distribution of Timestamp Packets: A New Approach to Distributed Garbage Collection · OOPSLA 1989
Distributed systems
distributed algorithms		 0.011989
Incremental Distribution of Timestamp Packets: A New Approach to Distributed Garbage Collection · OOPSLA 1989
Distributed systems › distributed object systems
distributed garbage collection		 0.011989
Incremental Distribution of Timestamp Packets: A New Approach to Distributed Garbage Collection · OOPSLA 1989

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

timestamp packets · 0.0incremental collection · 0.0
YearPublicationVenuePosition
1989 Incremental Distribution of Timestamp Packets: A New Approach to Distributed Garbage Collection
abstract
A new algorithm for distributed garbage collection is presented. This algorithm collects distributed garbage incrementally and concurrently with user activity. It is the first incremental algorithm that is capable of collecting cyclic distributed garbage. Computational and network communication overhead are acceptable. Hosts may be temporarily inaccessible and synchronization between hosts is not necessary. The algorithm is based on asynchronous distribution of timestamp packets each containing a list of last-access times of some relevant remotely referenced objects. Finally, the correctness and time complexity of the algorithm are discussed.
Marcel Schelvis
 OOPSLA1
1988 The Implementation of a Distributed Smalltalk
Marcel Schelvis, Eddy Bledoeg
 ECOOP1