Abstract: We analyze the integration of automatic memory management in a
real-time context. We focus on integrating a copying garbage collector with
hard real-time static-priority periodic tasks. This integration is done by
considering the copying collector as an aperiodic task served by a polling
server. We analyze the schedulability of this system for any polling server
parameters. This analysis includes a bound on the memory size that guarantees
sufficient memory for the periodic tasks.
Keywords: Real-time scheduling, garbage collection, polling server