词条 | Deadline-monotonic scheduling |
释义 |
Deadline-monotonic priority assignment is a priority assignment policy used with fixed-priority pre-emptive scheduling. With deadline-monotonic priority assignment, tasks are assigned priorities according to their deadlines. The task with the shortest deadline is assigned the highest priority.[1] This priority assignment policy is optimal for a set of periodic or sporadic tasks which comply with the following restrictive system model:
If restriction 7 is lifted, then "deadline minus jitter" monotonic priority assignment is optimal. If restriction 1 is lifted, allowing deadlines greater than periods, then Audsley's optimal priority assignment algorithm may be used to find the optimal priority assignment. Deadline monotonic priority assignment is not optimal for fixed priority non-pre-emptive scheduling. A fixed priority assignment policy P is referred to as optimal if no task set exists which is schedulable using a different priority assignment policy which is not also schedulable using priority assignment policy P. Or in other words: Deadline-monotonic priority assignment (DMPA) policy is optimal if any process set, Q, that is schedulable by priority scheme W, is also schedulable by DMPA[2] See also
References1. ^{{cite web|title=Deadline Monotonic Scheduling|url=http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.8928|accessdate=21 June 2013}} {{Comp-sci-stub}}2. ^{{cite book |title=Real-Time Systems and Programming Languages (3rd Edition) |author=Alan Burns and Andy Wellings |page=485 |isbn=0-201-72988-1 |year=2001 |publisher=Addison Wesley}} 1 : Processor scheduling algorithms |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。