Improved Tardiness Bounds for Global EDF

Erickson, Jeremy P.; Devi, UmaMaheswari; Baruah, Sanjoy

doi:10.1109/ecrts.2010.25

Cited by 29 publications

(42 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to evaluate the improvement to the bounds we obtain by eliminating implicit precedence constraints, we compared our results to the best available analysis for implicit-deadline sporadic tasks, found in [2]. For the experiments in this paper, we compared the best results of our work to the best bounds attainable using [2].…”

Section: Discussionmentioning

confidence: 99%

“…Our experimental methodology is inspired by the tests in [2]. All experiments were done with processor counts of 4, 8, and 16.…”

Section: Discussionmentioning

confidence: 99%

“…For each value of the varied parameter, we generated 1000 task sets. For each individual task set, we generated tasks until a task was generated that would cause U (τ ) to exceed m. For each task set we computed the mean tardiness bound with respect to [2], δ, and with respect to our work, δ . For each set of 1000 task sets we computedδ (the mean value of δ) andδ (the mean value of δ ).…”

Section: Discussionmentioning

confidence: 99%

“…Multicore processors have been shown to be useful for supporting traditional soft real-time (SRT) workloads when bounded deadline tardiness is acceptable [1][2][3][4]. In this paper we extend these works to a broader class of workloads in which jobs are independent of each other and can be executed in parallel, such as servers handling independent requests.…”

Section: Introductionmentioning

confidence: 96%

“…Each x i value depends upon the other x i values. Therefore, we initially define the vectors using an implicit criterion, and as in [2,3] we define the notion of a compliant vector as one that meets this criterion. Definition 1.…”

Section: Response Time Characterizationmentioning

confidence: 99%

See 4 more Smart Citations

Response Time Bounds for G-EDF without Intra-Task Precedence Constraints

Erickson

Anderson

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Prior work has provided bounds on the deadline tardiness that a set of sporadic real-time tasks may incur when scheduled using the global earliest-deadline-first (G-EDF) scheduling algorithm. Under the sporadic task model, it is necessary that no individual task overutilize a single processor and that the set of all tasks does not overutilize the set of all processors. In this work we generalize the task model by allowing jobs within a single task to run concurrently. In doing so we remove the requirement that no task overutilize a single processor. We also provide tardiness bounds that are better than those available with the standard sporadic task model.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Our experimental methodology is inspired by the tests in [2]. All experiments were done with processor counts of 4, 8, and 16.…”

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

Section: Response Time Characterizationmentioning

confidence: 99%

See 3 more Smart Citations

Response Time Bounds for G-EDF without Intra-Task Precedence Constraints

Erickson

Anderson

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Tardiness Bounds for Global EDF with Deadlines Different from Periods

Erickson

Guan

Baruah

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an attractive choice for scheduling soft-real-time systems on multiprocessors. Previous work has demonstrated that the maximum tardiness is bounded, and has derived formulas for computing tardiness bounds, in EDF-scheduled real-time systems that can be modeled as collections of recurrent tasks modeled using the well-known implicit-deadline (Liu and Layland) task model. This research extends the applicability of previous techniques to systems that are modeled using the more general arbitrary sporadic task model. It also improves on prior work even for implicit-deadline systems. An algorithm is derived here that computes tardiness bounds in polynomial time. Previously, these bounds could only have been approximated in sub-exponential time.

show abstract

Globally scheduled real-time multiprocessor systems with GPUs

Elliott

Anderson

2011

Real-Time Syst

View full text Add to dashboard Cite

Graphics processing units, GPUs, are powerful processors that can offer significant performance advantages over traditional CPUs. The last decade has seen rapid advancement in GPU computational power and generality. Recent technologies make it possible to use GPUs as co-processors to the CPU. The performance advantages of GPUs can be great, often outperforming traditional CPUs by orders of magnitude. While the motivations for developing systems with GPUs are clear, little research in the real-time systems field has been done to integrate GPUs into real-time multiprocessor systems. We present two real-time analysis methods, addressing realworld platform constraints, for such an integration into a soft real-time multiprocessor system and show that a GPU can be exploited to achieve greater levels of total system performance.

show abstract

Improved Tardiness Bounds for Global EDF

Cited by 29 publications

References 13 publications

Response Time Bounds for G-EDF without Intra-Task Precedence Constraints

Response Time Bounds for G-EDF without Intra-Task Precedence Constraints

Tardiness Bounds for Global EDF with Deadlines Different from Periods

Globally scheduled real-time multiprocessor systems with GPUs

Contact Info

Product

Resources

About