Loading...
| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 843.4 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
We consider a system of n synchronous tasks {t1, t2, ……tn} to be scheduled on one processor according to a preemptive fixed-priority task-level scheduling policy. Without loss of generality, we consider that ti has a higher priority than tj for i<j. We denote by hp(i) the set of tasks indexes with a higher priority than tj. By synchronous tasks we understand that all tasks are released simultaneously the first time at t=0.
Description
Demo presented in 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015). 8 to 12, Jun, 2015. La Roche-en-Ardenne, Belgium. Extended abstract.