Cyclic Weighted Reference Counting without Delay

Cyclic Weighted Reference Counting without Delay (1992)

Cached

Download Links

[www.cs.ukc.ac.uk]

Other Repositories/Bibliography

DBLP

by Richard E. Jones , Rafael D. Lins

Venue:	of Lecture Notes in Computer Science
Citations:	17 - 4 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Cyclic Weighted Reference Counting without Delay	user correction - Legacy Corrections
AUTHOR NAME	Richard E. Jones	SVM HeaderParse 0.1
AUTHOR AFFIL	Computing Laboratory; University of Kent at Canterbury	SVM HeaderParse 0.2
AUTHOR ADDR	Canterbury, England	SVM HeaderParse 0.1
AUTHOR NAME	Rafael D. Lins	SVM HeaderParse 0.1
AUTHOR AFFIL	Computing Laboratory; University of Kent at Canterbury	SVM HeaderParse 0.2
AUTHOR ADDR	Canterbury, England	SVM HeaderParse 0.1
ABSTRACT	Weighted Reference Counting is a low communication distributed storage reclamation scheme for loosely-couple multiprocessors. The algorithm we present herein extends weighted reference counting to allow the collection of cyclic data structures. To do so, the algorithm identifies candidate objects that may be part of cycles and performs a tricolour mark-scan on their subgraph in a lazy manner to discover whether the subgraph is still in use. The algorithm is concurrent in the sense that multiple useful computation processes and garbage collection processes can be performed simultaneously. Keywords: Memory management, Distributed memory, Reference counting, Garbage collection. Introduction Computation on distributed systems involving several processors is already a reality. In a distributed multiprocessor system each processor is responsible for allocating and reclaiming structures residing in its local memory; interprocessor communication is far less efficient than local memory access...	user correction - Legacy Corrections
YEAR	1992	user correction - Legacy Corrections
VENUE	of Lecture Notes in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	712--715	INFERENCE
VOLUME	694	INFERENCE
CITATIONS	35 found	ParsCit 1.0