An efficient multi-processor architecture for parallel cyclic reference counting

DOI10.1007/3-540-36569-9_44MaRDI QIDQ4414821zbMATH OpenFDO

Authors Rafael Dueire Lins

Publication date 27 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2565/25650650.htm

zbMATH Keywords

cyclic graphsgarbage collectionMemory managementreference counting

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• An efficient approach to cyclic reference counting based on a coarse-grained search
• New Algorithms and Applications of Cyclic Reference Counting
• Fast runtime block cyclic data redistribution on multiprocessors
• Concurrent cycle collection in reference counted systems
• Architecture-independent loop parallelisation
• Efficient address generation in a parallel processor

Cited in

(2)

• An efficient approach to cyclic reference counting based on a coarse-grained search
• Efficient address generation in a parallel processor

This page was built for publication: An efficient multi-processor architecture for parallel cyclic reference counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414821)