Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling

Citation data:

Information Processing Letters, ISSN: 0020-0190, Vol: 117, Page: 1-5

Publication Year:
Usage 475
Abstract Views 473
Link-outs 2
Captures 2
Readers 2
Social Media 6
Shares, Likes & Comments 6
Georg von der Brüggen, Jian-Jia Chen, Robert I. Davis, Wen-Hung Huang
Elsevier BV
Mathematics, Computer Science
article description
In this paper, we investigate the quality of several linear-time schedulability tests for preemptive and non-preemptive fixed-priority scheduling of uniprocessor systems. The metric used to assess the quality of these tests is the resource augmentation bound commonly known as the processor speedup factor. The speedup factor of a schedulability test corresponds to the smallest factor by which the processing speed of a uniprocessor needs to be increased such that any task set that is feasible under an optimal preemptive (non-preemptive) work-conserving scheduling algorithm is guaranteed to be schedulable with preemptive (non-preemptive) fixed priority scheduling if this scheduling test is used, assuming an appropriate priority assignment. We show the surprising result that the exact speedup factors for Deadline Monotonic (DM) priority assignment combined with sufficient linear-time schedulability tests for implicit-, constrained-, and arbitrary-deadline task sets are the same as those obtained for optimal priority assignment policies combined with exact schedulability tests. Thus in terms of the speedup-factors required, there is no penalty in using DM priority assignment and simple linear schedulability tests.

This article has 0 Wikipedia mention.