The Community for Technology Leaders
2013 IEEE 34th Real-Time Systems Symposium (2009)
Washington D.C., USA
Dec. 1, 2009 to Dec. 4, 2009
ISSN: 1052-8725
ISBN: 978-0-7695-3875-4
pp: 81-92
ABSTRACT
Managed languages such as Java and C# are increasingly being considered for hard real-time applications because of their productivity and software engineering advantages. Automatic memory management, or garbage collection, is a key enabler for robust, reusable libraries, yet remains a challenge for analysis and implementation of real-time execution environments. This paper comprehensively compares the two leading approaches to hard real-time garbage collection. While there are many design decisions involved in selecting a real-time garbage collection algorithm, for time-based garbage collectors researchers and practitioners remain undecided as to whether to choose periodic scheduling or slack-based scheduling. A significant impediment to valid experimental comparison is that the commercial implementations use completely different proprietary infrastructures. Here, we present Minuteman, a framework for experimenting with real-time collection algorithms in the context of a high-performance execution environment for real-time Java. We provide the first comparison of the two approaches, both experimentally using realistic workloads, and analytically in terms of schedulability.
INDEX TERMS
real-time garbage collection, schedulability
CITATION
Antony L. Hosking, Tomas Kalibera, Filip Pizlo, Jan Vitek, "Scheduling Hard Real-Time Garbage Collection", 2013 IEEE 34th Real-Time Systems Symposium, vol. 00, no. , pp. 81-92, 2009, doi:10.1109/RTSS.2009.40
98 ms
(Ver 3.3 (11022016))