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

David Plainfossé

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

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

Systems, architecture and hardware · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed object systems
distributed garbage collection
0.011992
Robust, Distributed References and Acyclic Garbage Collection · PODC 1992
Distributed systems › middleware
location-transparent naming
0.011992
Robust, Distributed References and Acyclic Garbage Collection · PODC 1992
Operating systems › resource management
memory management
0.011992
Robust, Distributed References and Acyclic Garbage Collection · PODC 1992

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

presentation-layer protocol · 0.0
YearPublicationVenuePosition
1992 Robust, Distributed References and Acyclic Garbage Collection
abstract
We propose efficient, programming language-independent, location-transparent references as a substitute for pointers in distributed applications.These references provide the semantics of normal pointers for both local and distributed, transient and persistent objects.They may be passed in messages between and within nodes using a low-overhead presentation-layer protocol.of thousands of nodes connected using both local and wide-area networks.
Marc Shapiro 0001, Peter Dickman, David Plainfossé
PODC3