Comparative analysis of aperiodic server approaches for real-time garbage collection

Authors:
Eunjeong Park;Taehyoun Kim;Heonshik Shin
Affiliations:
School of Electrical Engineering and Computer Science, and Institute of Computer Technology, Seoul National University, Seoul 151-742, Korea (Corresponding author. E-mail: ejpark@cslab.snu.ac.kr);GCT Research, Inc., Seoul 150-712, Korea;School of Electrical Engineering and Computer Science, and Institute of Computer Technology, Seoul National University, Seoul 151-742, Korea
Venue:
Journal of Embedded Computing - Real-Time and Embedded Computing Systems
Year:
2005

Citing 8
Cited 1

Aperiodic servers in a deadline scheduling environment

Real-Time Systems
Scheduling garbage collector for embedded real-time systems

Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Multiple Servers and Capacity Sharing for Implementing Flexible Scheduling

Real-Time Systems - Flexible Scheduling on Real-Time Systems
Applying priorities to memory allocation

Proceedings of the 3rd international symposium on Memory management
Joint scheduling of garbage collector and hard real-time tasks for embedded applications

Journal of Systems and Software
Bounding Worst Case Garbage Collection Time for Embedded Real-Time Systems

RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
New Results on Fixed Priority Aperiodic Servers

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium

Joint garbage collection and hard real-time scheduling

Journal of Embedded Computing - Best Papers of RTS' 2005

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the characteristics of the deferrable and sporadic server approaches to real-time garbage collection implemented with single or dual servers. Comparative analysis addresses two problems: the scheduling of a garbage collector with hard real-time mutator tasks, and the worst-case memory requirement. Our analysis shows that it may be impractical to depend on the single-server approach to prepare a flexible, yet feasible schedule for embedded real-time systems. In contrast, dual servers enhance the scheduling flexibility, although it suffers additional overhead of the secondary server and memory space. According to the simulation study, the single-server approach prefers the sporadic server to the deferrable server, since the former has larger capacity than the latter. On the other hand, with dual servers have chosen the deferrable server is the more efficient solution.