The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments

Strosnider, J.K.; Lehoczky, John P.; Sha, Lui

doi:10.1109/12.368008

Cited by 320 publications

(166 citation statements)

References 10 publications

Supporting

Mentioning

161

Contrasting

Unclassified

Order By: Relevance

“…The traditional definition of the polling server is modified, so that an aperiodic task does not have to be ready at polling time to be serviced -it can get the (rest) of the server capacity even when it is ready after the polling time, but before the server runs out of capacity. The modified version of the polling server also differs from the deferrable server [Strosnider et al 1995], because the server capacity is reduced while the server is waiting for an aperiodic task to be ready. This work focuses mainly on estimation of worst-case response times for an aperiodic task being run using a polling server, which is of general use for real-time systems.…”

Section: Relative Costs Of Gc Cycle Phasesmentioning

confidence: 99%

Scheduling real-time garbage collection on uniprocessors

Kalibera

Pizlo

Hosking

et al. 2011

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

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 leading approaches to hard real-time garbage collection. There are many design decisions involved in selecting a real-time garbage collection algorithm. For time-based garbage collectors on uni-processors one must choose whether to use periodic, slack-based or hybrid scheduling. A significant impediment to valid experimental comparison of such choices is that commercial implementations use completely different proprietary infrastructures. 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 approaches, both experimentally using realistic workloads, and analytically in terms of schedulability.

show abstract

Section: Relative Costs Of Gc Cycle Phasesmentioning

confidence: 99%

Scheduling real-time garbage collection on uniprocessors

Kalibera

Pizlo

Hosking

et al. 2011

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…Lehoczky et al investigated bandwidth-preserving server mechanisms (Deferrable Server [15] and Priority Exchange [8]) to enhance aperi- odic responsiveness. Sprunt et al described a better server mechanism, called Sporadic Server (SS) [13].…”

Section: Related Workmentioning

confidence: 99%

Practical Schedulability Analysis for Generalized Sporadic Tasks in Distributed Real-Time Systems

Krecker¹,

Gill

et al. 2008

2008 Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

show abstract

“…The proposal here allocates all application-defined schedulers a CPU budget and replenishment period using the RTSJ processing group parameters mechanism. This means that the threads within a scheduling band can be treated as if they are being served by a deferrable server [15]. Hence, if the priority scheduler is supporting true feasibility analysis, then this is not undermined by the proposed approach.…”

Section: Impact On Feasibility Analysismentioning

confidence: 99%