Resource reclaiming in hard real-time systems with static and dynamic workloads

Krings, Axel; Azadmanesh, M. H.

doi:10.1109/hicss.1997.667412

Cited by 4 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, the task system consists of non-coupled real tasks and phantom tasks. Stable solutions for such task model have been presented in [11,12,13,14,15]. The main concept will be repeated here, as it builds the basis for avoidance of infeasibility, as described in Section 4.…”

Section: Basic Run-time Stabilizationmentioning

confidence: 99%

“…Any scan window algorithm, e.g. those presented in [13,14,15], can now be applied to this modified task system. However, this approach is very inefficient because the actual task durations of many real-time applications are much smaller than their maximum, standard durations, e.g.…”

Section: Jfl Trivial Solutionmentioning

confidence: 99%

“…Let /,,</ -1 be the number of idle processors reserved at the time of the scan, leaving one processor to start the ready task being searched for. Then it can be shown [13,15] that the safe scan window is S = Ago U Ad U ... U Ae/,,. If Ag/,.…”

Section: Dispatching Philosophymentioning

confidence: 99%

“…Special tasks called phantom tasks have been used to model events external to a processor, such as delayed task release, non-transparent overhead or task synchronizaDownloaded by [University of Saskatchewan Library] at 01:23 11 June 2016 [10,13,15]. These tasks are fully incorporated into the precedence graph.…”

Section: -1 Task Modelmentioning

confidence: 99%

“…Examples of regular algorithms are those found in [13,14,15], Scheduling workloads containing coupled tasks involves the following steps:…”

Section: General Solutionmentioning

confidence: 99%

See 4 more Smart Citations

Avoiding Run-Time Infeasibility In Systems Containing Coupled Tasks

Krings¹,

Azadmanesh²

1999

INFOR: Information Systems and Operational Research

Self Cite

View full text Add to dashboard Cite

This paper investigates the problem of guaranteeing stability and run-time feasibility in real-time systems containing coupled tasks, in the context of non-preemptive priority scheduling. Instability is the result of so-called multiprocessor timing anomalies, where deadlines can be missed due to the reduction in task durations. Such reductions can also result in ruu-time infeasibility of coupled task pairs due to the inherent intertask timing constraints. A scheduling environment, feasibility conditions and a general algorithm are presented that avoid both phenomena at run-time. RESUMECet article examine le probleme qui consiste a garantir la stabilite et faisabilite pendant execution dans des systemes fonctionnant en temps reel, contenant des taches accouplees, dans le contexte d'un ordonnancement a priorite uon-preemptif. L'instabilite est le resultat d'anomalies temporelles du multiprocesseur, ou les dates limites ne sont pas respectees a cause de la reduction de la duree des taches. De telles reductions peuvent egalemeut avoir pour consequence la non-faisabilite de paires de taches accouplees, ceci etajit du aux contraintes de temps inherentes entre deux taches.' L'environnement de l'ordonnancement, les conditions de faisabilite et un algorithme general qui evitent ces deux phenomenes sont presentes ci-dessous.

show abstract

Section: Basic Run-time Stabilizationmentioning

confidence: 99%

Section: Jfl Trivial Solutionmentioning

confidence: 99%

Section: Dispatching Philosophymentioning

confidence: 99%

Section: -1 Task Modelmentioning

confidence: 99%

“…Examples of regular algorithms are those found in [13,14,15], Scheduling workloads containing coupled tasks involves the following steps:…”

Section: General Solutionmentioning

confidence: 99%