"A linear-time online task assignment scheme for
multiprocessor systems" ,
Proc. RTOSS'94, Seattle, WA, May 1994, pp. 28-31.
We adapt our task assignment scheme from
"New strategies ..." (Abstract)
to operate in scenarios where the task set may change dynamically.
We demonstrate the effectiveness of this simplified scheme by
proving rigorous worst-case bounds, and by simulation studies
of average-case behavior.
KEY WORDS:
multiprocessor systems, hard real-time constraints,
rate-monotonic scheduling,
task assignment schemes, online algorithms,
worst-case analysis
Homepage
Short CV
Publications