Abstract
One of the major problems of list processing programs is that of garbage collection. This paper presents a new practical parallel garbage collection algorithm and its improvements, and proposes a special processor for parallel garbage collection.For the parallel garbage collection system, an urgent requirement is to reduce the the garbage collector cycle time that is defined as the total execution time for the marking and reclaiming phase. The effect of improvements discussed here reduces the garbage collector cycle time to one half of that for the original algorithm.The performance of the processor tailored for parallel garbage collection is six times faster than that of an ordinary processor, while it requires a little bit larger amount of hardware than a typical channel controller. This processor satisfies the effectiveness condition for parallelism, even if the list process node consumption rate is high, e.g. when a compiled program is executed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
