|
Abstract : |
The earliest-deadline-rst scheduling of hard realtime systems upon multiprocessor platforms is considered. Several results that run somewhat counter to intuition are presented. With respect to interprocessor migrations, it is shown that what seem like intuitive heuristics for decreasing the number of such migrations may in fact severely exacerbate the problem. With respect to scheduling periodic task systems, it is demonstrated that uniprocessor results which permit the ecient identication of worst-case system behavior do not extend to multiprocessors., |
