PerformanceGuaranteed Communications over Packet Switching分组交换的性能保证通信.pptVIP

Pfair Scheduling of Periodic Tasks with Allocation Constraints on Multiple Processors Deming Liu and Yann-Hang Lee Contributions Give a polynomial-time pfair schedulability test of periodic tasks over multiple processors with arbitrary allocation constraints Propose an approximate scheduling algorithm for fixed tasks Basics of Proportionate Fairness (pfair) n periodic tasks to be scheduled over m identical processors Task constraint – at any time, no task can run on more than one processor All input parameters of any task x are integers Period px, execution time ex, release time etc. Pfair (proportionate fairness) Task x receives either ?wxt? or ?wxt? serving time in [0, t], where wx = ex / px Tasks make progress in a steady rate Allocation Constraints Allocation constraint A task can only run on a given subset of processors An instance ? is defined as a tuple {T, R, {P(x)|x?T }} T is a set of n periodic tasks R is a ser of m identical processors P is a allocation constraint function defined as P : T ? subsets of R such that for x ?T, P(x) ? R represents the subset of processors on which task x can be executed Schedulability with Arbitrary Allocation Constraints For ?, assuming wx ? 1 and Theorem 1. Instance ? is pfair schedulable if and only if there exists a set of nonnegative numbers w(x, r) (?x?T, ?r?R) such that Proof by Constructing a Graph Proof of Theorem 1 Applying max-flow theory to a constructed digraph G = (V, E) representing the scheduling problem V = V0 ? V1 ? V2 ? V3 ? V4 ? V5 V0 = {source}. V1 = {?1, x, i? | x ? T, i ? [0, wxL)}. V2 = {?2, x, j? | x ? T, j ? [0, L)}. V3 = {?3, x, j? | x ? T, j ? [0, L)}. V4 = {?4, r, j? | r ? R, j ? [0, L)}. V5 = {sink}. Proof by Constructing a Graph E = E0 ? E1? E2 ? E3 ? E4 E0 = {(source, ?1, x, i?, 1) | x ? T, i ? [0, wxL)}. E1 = {(?1, x, i?, ?2, x, j?, 1) | x ? T, i ? [0, wxL), j ? [earliest(x, i), latest(x, i)]} earliest(x, i) (latest(x, i)) is the earliest (latest) time slot at which subtas