SNS: A Simple Model for Understanding Optimal Hard Real-Time Multiprocessor Scheduling (original) (raw)
Related papers
RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor
2011
Optimal multiprocessor real-time schedulers incur significant overhead for preemptions and migrations. We present RUN, an efficient scheduler that reduces the multiprocessor problem to a series of uniprocessor problems. RUN significantly outperforms existing optimal algorithms with an upper bound of O(log m) average preemptions per job on m processors (≤ than 3 per job in all of our simulated task sets) and reduces to Partitioned EDF whenever a proper partitioning is found.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.