In other words, if ANY static priority scheme can meet all the deadlines, the rate-monotonic static priority scheme will meet all the deadlines, too. This is mathematically optimal among all static-priority scheduling policies. Find the course that releases new homework the most frequently, and list it the highest (do the work first), and so forth. To solve this problem, if you cannot meet all the deadlines, use a static priority rate-monotonic policy.However, if you cannot meet any deadlines, you will miss them randomly with EDF.
That means, if you get a new assignment due the next day, you need to suspend all work due in 2 days and work on the next day's assignment. If it is humanly possible to meet all the deadlines, earliest deadline first policy will work. This is an optimal dynamic scheduling policy. Prioritize Using the Earliest Deadline First (EDF) Policy.
0 kommentar(er)
