Efficient cyclic weighted reference counting
Resumo
Weighted reference counting is a very simple and efficient memory management system for multiprocessor architectures. This paper extends the weighted reference counting algorithm to work efficiently with cyclic data structures.
Palavras-chave:
Memory management, Java, Computer architecture, Data structures, Virtual machining, Computer science, Programming profession, Computer errors, Environmental management, Computer languages
Publicado
28/10/2002
Como Citar
LINS, R. D..
Efficient cyclic weighted reference counting. In: INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD), 14. , 2002, Vitória/ES.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2002
.
p. 61-67.
