A Uniprocessor Scheduling Policy for Non-Preemptive Task Sets with Precedence and Temporal Constraints
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 app...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
American Institute of Aeronautics and Astronautics (AIAA)
2018
|
| Online Access: | http://hdl.handle.net/1721.1/116085 https://orcid.org/0000-0002-5321-6038 https://orcid.org/0000-0003-1338-8107 |