Real-time scheduling of tasks that contain the external blocking intervals

Kim, In-Guk; Choi, Kyunghee; Park, Seung-Kyu; Kim, Dong-Yoon; Hong, Man-Pyo

doi:10.1109/rtcsa.1995.528751

Cited by 6 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Contrarily, a job of a self-suspending task may release the processor before being completed, for instance when waiting to get access to a shared resource or offloading computation to an external device, and continue its execution later on. In this setting, the classical critical instant theorem does not hold and related early results [1], [22] have been disproved, cf., [9]. Recently, a large number of additional results have also been reported to be flawed in [9], [14], [15], [31], showing that analyses for self-suspending task systems is non-trivial.…”

Section: Introductionmentioning

confidence: 96%

“…Previous work for self-suspending task sets considered either Task-Level Fixed-Priority (TFP) scheduling or Earliest-Deadline-First (EDF) scheduling. For preemptive TFP (i.e., if one task has higher priority than another, all its jobs have higher priority as well), the work by Chen [8] (and its recent extension by Günzel et al [17] to arbitrary-deadline and arrival curves) dominate the other schedulability tests derived in the literature [1], [20], [22], [29]. For task-level dynamic-priority scheduling algorithms (where the priority of the jobs of one task may differ over time) only EDF (where the priority of a job is specified by its absolute deadline) has been studied.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

EDF-Like Scheduling for Self-Suspending Real-Time Tasks

Günzel

Brüggen

Chen

et al. 2022

2022 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

In real-time systems, schedulability analyses provide the required timing guarantees. However, current suspensionaware analyses are limited to Task-Level Fixed-Priority (TFP) scheduling or Earliest-Deadline-First (EDF) scheduling of constrained-deadline self-suspending task systems. In this work, we provide a unifying schedulability analysis for uniprocessor Global EDF-Like (GEL) schedulers of arbitrary-deadline task sets. While analyses for EDF-Like schedulers are rare, many widely used scheduling algorithms can be considered as EDF-Like, for example, EDF, First-In-First-Out (FIFO), Earliest-Quasi-Deadline-First (EQDF), and Suspension-Aware EDF (SAEDF). Therefore, the provided analysis is applicable to those algorithms. It can be applied to TFP scheduling as well. Our analysis is the first suspension-aware schedulability analysis for arbitrary-deadline sporadic real-time task systems under Job-Level Fixed-Priority (JFP) scheduling, such as EDF, and the first unifying suspension-aware schedulability analysis framework that covers a wide range of scheduling algorithms. Through numerical simulations, we show that our analysis improves the state of the art for constrained-deadline EDF scenarios.

show abstract

Section: Introductionmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

EDF-Like Scheduling for Self-Suspending Real-Time Tasks

Günzel

Brüggen

Chen

et al. 2022

2022 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

show abstract

Using real-time system design methods to integrate SMPS control software with application software

Juneja

Dean

Bhattacharya

2015

2015 IEEE Energy Conversion Congress and Exposition (ECCE)

View full text Add to dashboard Cite

A New Calculation Method of Interference Time under Limited Parallel Model

Gao

Xia

Dai

2011

2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

Reconfigurable computing makes use of the reconfiguration capability of modern FPGAs (FieldProgrammable Gate Arrays), and can reform the computing functions of systems at runtime. In fact, the tasks in reconfigurable systems are hybrid tasks which consist of software tasks and hardware tasks, and the task model of hybrid tasks is the limited parallel model. Aiming at the interference time analysis of tasks under the limited parallel model, this paper presents a new calculation method called ion algorithm (IA). Although our current research is not involved in response time of tasks because the critical scheduling instant is unknown, this paper provides a fast and comprehensible method for calculating interference time among hybrid tasks, which is more general and can be applied to the research on response time of hybrid tasks. Evaluation results show that this method has acceptable time and space complexity and the limited parallel model is more complex than conventional ones.

show abstract

Real-time scheduling of tasks that contain the external blocking intervals

Cited by 6 publications

References 3 publications

EDF-Like Scheduling for Self-Suspending Real-Time Tasks

EDF-Like Scheduling for Self-Suspending Real-Time Tasks

Using real-time system design methods to integrate SMPS control software with application software

A New Calculation Method of Interference Time under Limited Parallel Model

Contact Info

Product

Resources

About