Vienna University of Economics and Business
Automatic memory management or garbage collection greatly simplifies the development of large systems. However, garbage collection is usually not used in real-time systems due to the unpredictable temporal behavior of current implementations of a garbage collector. In this paper, the authors propose a concurrent collector that is scheduled periodically in the same way as ordinary application threads. They provide an upper bound for the collector period so that the application threads never run out of memory.