Fractional Weighted Reference Counting

Authors:
Erik Klintskog;Anna Neiderud;Per Brand;Seif Haridi
Affiliations:
-;-;-;-
Venue:
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Year:
2001

Citing 5
Cited 0

An efficient garbage collection scheme for parallel computer architectures

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Generational reference counting: a reduced-communication distributed storage reclamation scheme

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Indirect reference counting: a distributed garbage collection algorithm

PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
Introduction to distributed algorithms

Introduction to distributed algorithms
A Survey of Distributed Garbage Collection Techniques

IWMM '95 Proceedings of the International Workshop on Memory Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a scheme for distributed garbage collection that is an extension of Weighted Reference Counting. This scheme represents weights as fractions. It solves the problem of limited weight, preserves the property of third-party independence, and does not induce extra messages for reference merging.