By Topic

Bounding worst case garbage collection time for embedded real-time systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Taehyoun Kim ; Sch. of Comput. Sci., Seoul Nat. Univ., South Korea ; Naehyuck Chang ; Heonshik Shin

Execution of programs with various data structures often requires dynamic memory management based on garbage collection for better productivity, robustness and program integrity. In spite of its benefits, garbage collection has not been widely used in embedded real-time systems partly because it often causes unpredictable pause delay. Guaranteeing real-time operations with garbage collection aims to bound and estimate the worst case computation time of a garbage collector as well as application tasks. We introduce a new technique for bounding and estimating the worst case garbage collection time in light of task scheduling. Since the worst case live memory is the dominant factor to determine the worst case garbage collection time, we quantify the worst case live memory using the states of periodic tasks. We also present a predictable real-time copying collection algorithm in order to assess the effectiveness of the proposed approach. Performance evaluation shows that the proposed approach provides a safe and effective bound on the garbage collection time, thus reducing the upper bound of live memory size by up to 35% compared with the trivial bound. It also demonstrates that our algorithm can accomplish 7~14% reduction in the memory requirement

Published in:

Real-Time Technology and Applications Symposium, 2000. RTAS 2000. Proceedings. Sixth IEEE

Date of Conference: