Simple generational garbage collection and fast allocation
Software—Practice & Experience
Scheduling garbage collector for embedded real-time systems
Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
List processing in real time on a serial computer
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
A real-time garbage collector with low overhead and consistent utilization
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Uniprocessor Garbage Collection Techniques
IWMM '92 Proceedings of the International Workshop on Memory Management
Time-triggered garbage collection: robust and adaptive real-time GC scheduling for embedded systems
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Bounding Worst Case Garbage Collection Time for Embedded Real-Time Systems
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
| Hi-index | 0.00 |
As complex embedded real-time systems are widely used, automatic memory management, or garbage collection, is a technique that significantly reduces the complex problem of correct memory management. In recent years, people often use time-based real-time GC to meet the deadline of real-time tasks. Some algorithms are proposed to reduce memory requirement based on time-based approaches. However, they mainly focus on scheduling strategy and GC algorithms such as copying algorithm and mark-sweep algorithm et al. This paper treats GC as a dynamical process and gives the analysis of amount of live objects. We propose that GC should process memory space of each task one by one based on the variance of amount of live objects. The proposed approach can minimize GC work and further reduce memory requirement.