Non-preemptive Scheduling with History-Dependent Execution Time

Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.

Saved in:
Bibliographic Details
Main Authors: Andersson, B., Chaki, S., de Niz, Dionisio, Dougherty, B., Kegley, R., White, J.
Format: Conference Proceeding
Language:English
Subjects:
Computational modeling
History
Optimization
Processor scheduling
Schedules
Time factors
Upper bound
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.
ISSN:1068-3070
2377-5998
DOI:10.1109/ECRTS.2012.38