Algorithms for on-the-fly garbage collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Design for a multiprocessing heap with on-board reference counting
Proc. of a conference on Functional programming languages and computer architecture
Cyclic reference counting with local mark-scan
Information Processing Letters
Cyclic reference counting with lazy mark-scan
Information Processing Letters
Generational cyclic reference counting
Information Processing Letters
Garbage collection: algorithms for automatic dynamic memory management
Garbage collection: algorithms for automatic dynamic memory management
On bounding time and space for multiprocessor garbage collection
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Managing Reentrant Structures Using Reference Counts
ACM Transactions on Programming Languages and Systems (TOPLAS)
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
An exercise in proving parallel programs correct
Communications of the ACM
Multiprocessing compactifying garbage collection
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Letters to the editor: on the reference counter method
Communications of the ACM
Java without the coffee breaks: a nonintrusive multiprocessor garbage collector
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
An efficient algorithm for cyclic reference counting
Information Processing Letters
Concurrent Cycle Collection in Reference Counted Systems
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Supporting ada memory management in the iAPX-432
ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
An efficient parallel garbage collection system and ITS correctness proof
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Finer Garbage Collection in Lindacap
International Journal of Information Technology and Web Engineering
| Hi-index | 0.00 |
Multi-processor architectures are part of the technological reality of today. On the other hand, the software engineering community reached the consensus that memory management has to be performed automatically, without the interference of the programmer of applications. Reference counting is the memory management technique of most widespread use today. This paper presents a new architecture for parallel cyclic reference counting.