Abstract
Garbage collection has not been widely used in embedded real-time applications since traditional real-time garbage collection algorithm can hardly bound its worst-case responsiveness. To overcome this limitation, we have proposed a scheduling-integrated real-time garbage collection algorithm based on the single aperiodic server in our previous work. This paper introduces a new scheduling-aware real-time garbage collection which employs two aperiodic servers for garbage collection work. Our study aims at achieving similar performance compared with the single server approach whilst relaxing the limitation of the single server approach. In our scheme, garbage collection requests are scheduled using the preset CPU bandwidth of aperiodic server such as the sporadic server and the deferrable server. In the dual server scheme, most garbage collection work is serviced by the secondary server at low priority level. The effectiveness of our approach is verified by analytic results and extensive simulation based on the trace-driven data. Performance analysis demonstrates that the dual server scheme shows similar performance compared with the single server approach while it allows flexible system design.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kim, T., Chang, N., Shin, H.: Joint scheduling of garbage collector and hard real-time tasks for embedded applications. Journal of Systems and Software 58, 245–258 (2001)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20, 46–61 (1973)
Kim, T., Chang, N., Kim, N., Shin, H.: Scheduling garbage collector for embedded real-time systems. In: Proceedings of the ACM SIGPLAN 1999 Workshop on Languages, Compilers and Tools for Embedded Systems, pp. 55–64 (1999)
Kim, T., Chang, N., Shin, H.: Bounding worst case garbage collection time for embedded real-time systems. In: Proceedings of The 6th IEEE Real-Time Technology and Applications Symposium, pp. 46–55 (2000)
Bernat, G.: Specification and Analysis of Weakly Hard Real-Time Systems. Ph.D. Thesis, Universitat de les Illes Balears, Spain (1998)
Gerber, R., Hong, S., Saksena, M.: Guaranteeing end-to-end timing constraints by calibrating intermediate processes. In: Proceedings of Real-Time Systems Symposium, pp. 192–203 (1994)
Bernat, G., Burns, A.: New results on fixed priority aperiodic servers. In: Proceedings of Real-Time Systems Symposium, pp. 68–78 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, T., Shin, H. (2004). Scheduling-Aware Real-Time Garbage Collection Using Dual Aperiodic Servers. In: Chen, J., Hong, S. (eds) Real-Time and Embedded Computing Systems and Applications. RTCSA 2003. Lecture Notes in Computer Science, vol 2968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24686-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-24686-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21974-3
Online ISBN: 978-3-540-24686-2
eBook Packages: Springer Book Archive