An efficient algorithm for cyclic reference counting

Information Processing Letters

Volumn 83, Issue 3, 2002, Pages 145-150

  Lins, Rafael Dueire ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

Cyclic graphs; Garbage collection; Memory management; Reference counting

Indexed keywords

ALGORITHMS; DATA PROCESSING; DATA STORAGE EQUIPMENT; DATA STRUCTURES; GRAPH THEORY;

MEMORY MANAGEMENT; REFERENCE COUNTING;

COUNTING CIRCUITS;

EID: 0037119060     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00328-3     Document Type: Article

References (17)

1. Managing reentrant structures using reference counts
2. Cyclic reference counting for combinator machines
3. A method for overlapping and erasure of lists
4. Reference counting can manage the circular environments of mutual recursion
5. Report on the programming language Haskell
6. A shared memory architecture for parallel cyclic reference counting
7. A multi-processor shared memory architecture for parallel cyclic reference counting
8. Cyclic Reference counting with lazy mark-scan
9. Generational cyclic reference counting
10. Cyclic weighted reference counting
11. On the reference counter method
12. Cyclic reference counting with local mark-scan
13. Miranda: A non-strict functional programming language with polymorphic types