Reconfigurable Garbage Collection of Data Structures in a Speculative Real-Time System
Garbage collection can be carried out on-demand in a non-real-time system. However, a real-time system can afford this overhead only during intervals of `idle' time. We motivate the usefulness of reconfiguring the available memory for data structures, and the intervals of garbage collection of these data structures, in a parallel real-time system performing speculative execution. After briefly mentioning the data structures, we describe a scheme for reconfiguring garbage collection. The parameters of such reconfiguration are based on the available platform, and the amount of idle time available in the real-time system. Specific parameters are provided for one architecture -- the KSR2 parallel processor. Experimental performance evaluation of the scheme is currently under investigation.