A Uniprocessor Scheduling Policy for Non-Preemptive Task Sets with Precedence and Temporal Constraints
Name
infotechPaperGombolayShah.pdf
Size
802.07 KB
Format
Adobe PDF
Checksum (MD5)
afffe5fa7562145f6f978bb6bd57f0d3
Author(s)
Gombolay, Matthew C.
Shah, Julie A
Date Issued
June 2012
Journal
Infotech@Aerospace 2012
Publisher
American Institute of Aeronautics and Astronautics (AIAA)
Citation
Gombolay, Matthew, and Julie Shah. “A Uniprocessor Scheduling Policy for Non-Preemptive Task Sets with Precedence and Temporal Constraints.” Infotech@Aerospace 2012 (June 19, 2012).
Version
Author's final manuscript
Abstract
We present an idling, dynamic priority scheduling policy for non-preemptive task sets with precedence, wait constraints, and deadline constraints. The policy operates on a well-formed task model where tasks are related through a hierarchical temporal constraint structure found in many real-world applications. In general, the problem of sequencing according to both upperbound and lowerbound temporal constraints requires an idling scheduling policy and is known to be NP-complete. However, we show through empirical evaluation that, for a given task set, our polynomial-time scheduling policy is able to sequence the tasks such that the overall duration required to execute the task set, the makespan, is within a few percent of the theoretical, lowerbound makespan
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.2514/6.2012-2431
