DMCA
Pre-Runtime Scheduling for Embedded Hard Real-Time Systems Using Time Petri Nets (2004)
BibTeX
@MISC{Barreto04pre-runtimescheduling,
author = {Raimundo Barreto and Paulo Maciel and Meuse Oliveira Júnior},
title = {Pre-Runtime Scheduling for Embedded Hard Real-Time Systems Using Time Petri Nets},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Finding a feasible schedule is not trivial, because this problem is NP-Hard in its general form. There are two general approaches for scheduling tasks in real-time systems: runtime (or on-line) and pre-runtime (or off-line) scheduling. For many cases, runtime methods do not find a feasible schedule even if such a schedule exists. Such situations often occurs when the design model imposes intertask relations, such as precedence and exclusion relations. The method proposed in this work finds a pre-runtime scheduling, when one exists, using state space exploration. The main problem with such method is the space size, which can grow exponentially. This paper shows how to minimize this problem using the proposed modeling methodology. Furthermore, the algorithm is a depth-first search method on a labeled transition system derived from the time Petri net model.
Keyphrases
pre-runtime scheduling feasible schedule many case space size general form modeling methodology intertask relation state space exploration transition system real-time system main problem design model depth-first search method runtime method exclusion relation general approach time petri net model
