 
Summary: Multiprocessor Scheduling of HardRealTime Periodic Tasks with
Task Migration Constraints \Lambda
Tse Lee and Albert Mo Kim Cheng
Department of Computer Science
University of Houston
Houston, TX 772043475
U.S.A.
Abstract
We present a sufficient condition for preemptive
scheduling of a set of independent, periodic tasks on
n identical processors with task migration constraints
so that each task i can complete its computation time
C i before its deadline D i . Any set of independent, pe
riodic tasks satisfying this condition are guaranteed a
feasible schedule at run time. This condition is op
timal for a set of m independent and periodic tasks
running on an nprocessor system which requires a
task migration time of R(R ? 1) cycles. Let T =
gcd(D 1 ; D 2 ; : : : ; Dm ). If the utilization factor (U) of
a set of periodic tasks is at most n \Lambda (T \Gamma R + 1)=T ,
