Scheduling of Embedded System Using a Petri Net
이태용 · 2004
Embedded systems specification usually has both data computation and control structures. Control structure can be two types. One is data dependent control and the other is real time control. The first one can be easily solved because it is involved with only one task and its behavior is very obvious. The problem is the second case. We must use some sophisticated techniques to resolve concurrent behavior of tasks. To solve the second problem, these tasks require to be scheduled on a shared resource such as processor and memory. This scheduling is mainly based on the system specification. To simulate dynamic behaviors of system, it is very difficult to predict these behaviors because these behaviors have to be determined at compile time and decisions have to be made at run time. In other words, scheduling must be efficiently made while pleasing real time constraints and using the processor and memory resources as efficiently as possible. Therefore, Quasi-static scheduling algorithm is used to solve these problems.