Release jitter of tasks may afect their schedulability. They may have more chances to miss their deadlines if their priorities are assigned according to Deadline Monotonic(DM). (D-J)-monotonic is given instead. It is proved in this report that (D-J)-monotonic is an optimal priority assignment algorithm when the deadlines of tasks are less than or equal to their periods.

BibTex Entry

@techreport{Zuhily2006,
 author = {A. Zuhily},
 institution = {University of York, Dept. of Computer Science},
 number = {YCS 404},
 title = {Optimality of (D-J)-monotonic Priority Assignment},
 year = {2006}
}