Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

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

Summary: Response Time Bounds for G-EDF Without
Intra-Task Precedence Constraints
Jeremy P. Erickson and James H. Anderson
University of North Carolina at Chapel Hill
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.
1 Introduction
Multicore processors have been shown to be useful for supporting traditional
soft real-time (SRT) workloads when bounded deadline tardiness is acceptable
[14]. 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. For both types of SRT workloads,
temporal correctness requires that tardiness bounds exist, i.e., for each task,


Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill


Collections: Computer Technologies and Information Sciences