Feasibility conditions with kernel overheads for mixed preemptive FP/FIFO Scheduling with priority ceiling protocol on an event driven OSEK system.
Franck BimbardLaurent GeorgePublished in: ETFA (2007)
Keyphrases
- event driven
- scheduling algorithm
- scheduling policies
- scheduling problem
- response time
- round robin
- priority queue
- information delivery
- support vector
- priority scheduling
- markup language
- publish subscribe
- kernel methods
- resource constraints
- single machine
- queueing networks
- lower bound
- resource allocation
- building blocks
- lightweight
- flowshop
- real time
- heavy traffic
- sufficient conditions
- sensor networks
- mobile robot
- np hard
- feature space
- deadlock free