Unité de recherche INRIA Rocquencourt
Domaine de Voluceau - Rocquencourt - B.P. 105 - 78153 LE CHESNAY Cedex (France)
Téléphone : +33 01 39 63 55 11 - Télécopie : +33 01 39 63 53 30
Unité de recherche INRIA Rocquencourt
Domaine de Voluceau - Rocquencourt - BP 105 - 78153 LE CHESNAY Cedex (France)
Téléphone : (33) 01 39 63 55 11 - Télécopie : (33) 01 39 63 53 30
Preemptive and Non-Preemptive Real-Time
Uniprocessor Scheduling
Laurent George, Nicolas Rivierre, Marco Spuri
{Laurent.George, Nicolas.Rivierre, Marco.Spuri}@inria.fr
Thème 1 - Réseaux et systèmes
Projet Reflecs
Rapport de recherche n˚2966 - September 1996
51 pages
Abstract:
Scheduling theory, as it applies to hard-real-time environment, has been widely
studied in the last twenty years and it might be unclear to make it out within the plethora of
results available. Our goal is first to collect in a single paper the results known for uniproces-
sor, non-idling, preemptive/non-preemptive, fixed/dynamic priority driven contexts, consid-
ering general task sets as a central figure for the description of possible processor loads.
Second to establish new results when needed. In particular, optimality, feasibility conditions
and worst-case response times are examined largely by utilizing the concepts of workload,
processor demand and busy period. Some classic extensions such as jitter, resource sharing
are also considered.
Although this work is not oriented toward a formal comparison of these results, it appears
that preemptive and non-preemptive scheduling are closely related and that the analysis of
fixed versus dynamic scheduling might be unified according to the concept of higher priority
busy period. In particular, we introduce the notion of deadline-d busy period for EDF sched-
ules, that we conjecture to be an interesting parallel of the level-i busy period, a concept
already used in the analysis of fixed priority driven scheduling.
Key-words: dynamic priorities, EDF, feasibility, fixed priorities, non-idling, non-preemp-
tive, optimality, preemptive, real-time, worst-case response times, scheduling.
4星 · 超过85%的资源 需积分: 9 198 浏览量
2009-11-05
22:12:56
上传
评论 1
收藏 278KB PDF 举报 
billhaha2012-12-29仔细研究，取其精华！
