Abstract
Garbage collection provides a platform that improves system adaptability, productivity and robustness. Manual management of heap storage is notoriously error prone, inflexible and most systems still contains memory leaks. Most new programming languages incorporate garbage collection such as Java and C#. Non-deterministic time and memory fragmentation of garbage collection have thwarted its application to real-time systems. One of the garbage collection techniques, called copying collector, has helped to improve the garbage collection efficiency in fast-allocating memory objects and reducing fragmentation by compacting the heap. However, the compaction time is still nondeterministic and typically the time is long. This paper proposed a self-maintained memory module that the heap compaction can be done in constant time (O(1)).
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.
