Summary: LITMUS RT : A Testbed for Empirically Comparing Real­Time
Multiprocessor Schedulers #
John M. Calandrino, Hennadiy Leontyev, Aaron Block, UmaMaheswari C. Devi, and James H. Anderson
Department of Computer Science, The University of North Carolina at Chapel Hill
Abstract
We present a real­time, Linux­based testbed called
LITMUS RT , which we have developed for empirically eval­
uating multiprocessor real­time scheduling algorithms. We
also present the results from such an evaluation, in which
partitioned earliest­deadline­first (EDF) scheduling, pre­
emptive and nonpreemptive global EDF scheduling, and two
variants of the global PD 2 Pfair algorithm were considered.
The tested algorithms were compared based on both raw
performance and schedulability (with real overheads con­
sidered) assuming either hard­ or soft­real­time constraints.
To our knowledge, this paper is the first attempt by anyone
to compare partitioned and global real­time scheduling ap­
proaches using empirical data.
1 Introduction
Interest in techniques for effectively scheduling real­time

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

Collections: Computer Technologies and Information Sciences