Summary: On the Implementation of Global Real­Time Schedulers #
Bj˜ orn B. Brandenburg and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
An empirical study of implementation tradeoffs (choice of
ready queue implementation, quantum­driven vs. event­
driven scheduling, and interrupt handling strategy) affect­
ing global real­time schedulers, and in particular global
EDF, is presented. This study, conducted using UNC's
Linux­based LITMUS RT on Sun's Niagara platform, sug­
gests that implementation tradeoffs can impact schedula­
bility as profoundly as scheduling­theoretic tradeoffs. For
most of the considered workloads, implementation scalabil­
ity proved to not be a key limitation of global EDF on the
considered platform. Further, a combination of a paral­
lel heap, event­driven scheduling, and dedicated interrupt
handling performed best for most workloads.
1 Introduction
The advent of multicore systems has resulted in renewed
interest in real­time multiprocessor scheduling algorithms.

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

Collections: Computer Technologies and Information Sciences