An evaluation of the RUN algorithm in LITMUSRT

Authors:
Hiroyuki Chishiro;James H. Anderson;Nobuyuki Yamasaki
Affiliations:
The University of North Carolina at Chapel Hill, NC and Keio University, Yokohama, Japan;The University of North Carolina at Chapel Hill, NC;Keio University, Yokohama, Japan
Venue:
ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
Year:
2013

Citing 5
Cited 0

Optimal rate-based scheduling on multiprocessors

Journal of Computer and System Sciences
An Optimal Real-Time Scheduling Algorithm for Multiprocessors

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
LITMUS^RT: A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor

RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing multiprocessor real-time scheduling algorithms follow partitioning/global scheduling approaches or some hybrid approaches of the two. Under partitioning, all tasks are assigned to specific processors. Under global scheduling, tasks may migrate among processors. Global scheduling has the advantage of better schedulability compared to partitioning. However, optimal algorithms based on global scheduling such as PD2 [5] and LLREF [3] incur significant overhead.