Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor

Park, Minkyu; Kim, Heeheon; Cho, Seong-Je; Cho, Yookun

doi:10.1093/ietisy/e88-d.3.658

Cited by 25 publications

(29 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The Earliest Deadline first until Zero Laxity (EDZL) algorithm was introduced by Lee (1994), who showed that EDZL dominates global EDF scheduling, and is sub-optimal for two processors (see also (Cho et al, 2002;Park et al, 2005). Here, sub-optimal is used to mean that EDZL can "schedule any feasible set of ready tasks".…”

Section: Related Workmentioning

confidence: 99%

“…Hence FPZL dominates global FP scheduling, in the sense that all priority ordered tasksets that are schedulable according to global FP scheduling are also schedulable according to FPZL. FPZL is closely related to EDZL (Lee, 1994;Cho et al, 2002;Park et al, 2005;Baker and Cirinei, 2006;Piao et al, 2006;Cirinei and Baker, 2007;Chao et al, 2008) which applies the same priority promotion rule to global EDF scheduling.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

FPSL, FPCL and FPZL schedulability analysis

Davis

Kato

2012

Real-Time Syst

View full text Add to dashboard Cite

This paper presents the Fixed Priority until Static Laxity (FPSL), Fixed Priority until Critical Laxity (FPCL) and Extended versionThis paper builds on the paper "FPZL Schedulability Analysis" by Davis and Burns (2011b) published in the proceedings of RTAS 2011. This paper extends Davis and Burns (2011b) analysis to cover the FPSL and FPCL scheduling algorithms as well as FPZL. The analysis given in this paper is a superset of that provided for FPZL and reduces to it if the laxity threshold of each task is set to zero. In this paper, the experimental evaluation has been extended to include schedulability tests for FPSL (which also apply to FPCL) and simulation of FPCL as well as FPZL. We also report on a prototype implementation of FPCL and FPZL in a Linux kernel, running on an Intel Core 2 Quad processor (Q9650).

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

FPSL, FPCL and FPZL schedulability analysis

Davis

Kato

2012

Real-Time Syst

View full text Add to dashboard Cite

show abstract

“…The Earliest Deadline first until Zero Laxity (EDZL) algorithm was introduced in 1994 by Lee [22], who showed that EDZL dominates global EDF scheduling, and is suboptimal for two processors (see also Cho et al [14], Park et al [27]). Here, sub-optimal is used to mean that EDZL can "schedule any feasible set of ready tasks".…”

Section: A Related Workmentioning

confidence: 99%

“…Hence FPZL dominates global FP scheduling, in the sense that all priority ordered tasksets that are schedulable according to global FP scheduling are also schedulable according to FPZL. FPZL is closely related to EDZL [22], [12], [4], [11], [26], [27], and [14] which applies the same zero-laxity rule to global EDF scheduling.…”

Section: Introductionmentioning

confidence: 99%

FPZL Schedulability Analysis

Davis

Burns

2011

2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium

View full text Add to dashboard Cite

Abstract-This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive scheduling; however, whenever a task reaches a state of zero laxity it is given the highest priority. FPZL is a minimally dynamic algorithm, in that the priority of a job can change at most once during its execution, bounding the number of pre-emptions. Polynomial time and pseudopolynomial time sufficient schedulability tests are derived for FPZL. These tests are then improved by computing upper bounds on the amount of execution that each task can perform in the zero laxity state. An empirical evaluation shows that FPZL is highly effective, with a significantly larger number of tasksets deemed schedulable by the tests derived in this paper, than by state-of-the-art schedulability tests for Earliest Deadline until Zero Laxity (EDZL) scheduling.

show abstract

“…At any point in time, EDZL gives highest priority to jobs which cannot be delayed further, i.e, have zero laxity, and other jobs are scheduled in EDF order. This algorithm dominates EDF in the sense that any instance that is schedulable by EDF, is also schedulable by EDZL, whereas the opposite is not true [1,7]. However, it remained open if EDZL is optimal for speed less than 2−1/m, the speed necessary for EDF.…”

Section: Introductionmentioning

confidence: 99%

Meeting Deadlines: How Much Speed Suffices?

Anand

Gang

Megow

2011

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. We consider the online problem of scheduling real-time jobs with hard deadlines on m parallel machines. Each job has a processing time and a deadline, and the objective is to schedule jobs so that they complete before their deadline. It is known that even when the instance is feasible it may not be possible to meet all deadlines when jobs arrive online over time. We therefore consider the setting when the algorithm has available machines with speed s > 1. We present a new online algorithm that finds a feasible schedule on machines of speed e/(e − 1) ≈ 1.58 for any instance that is feasible on unit speed machines. This improves on the previously best known result which requires a speed of 2 − 2/(m + 1). Our algorithm only uses the relative order of job deadlines and is oblivious of the actual deadline values. It was shown earlier that the minimum speed required for such algorithms is e/(e − 1), and thus, our analysis is tight. We also show that our new algorithm outperforms two other well-known algorithms by giving the first lower bounds on their minimum speed requirement.

show abstract

Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor

Cited by 25 publications

References 0 publications

FPSL, FPCL and FPZL schedulability analysis

FPSL, FPCL and FPZL schedulability analysis

FPZL Schedulability Analysis

Meeting Deadlines: How Much Speed Suffices?

Contact Info

Product

Resources

About