Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Implementing Resource Reservations in Linux Luca Abeni and Giuseppe Lipari
 

Summary: Implementing Resource Reservations in Linux
Luca Abeni and Giuseppe Lipari
ReTiS Lab, Scuola Superiore Sant'Anna,
Piazza S. Caterina, Pisa, Italy
fluca, liparig@sssup.it
Abstract
With the recent development of kernel patches for implementing kernel preemptability and high-
resolution timers and the acceptance of the rst patch in the 2.5 development branch, it is now possible
to support real-time applications in Linux user-space. However, real-time applications must be ran using
the POSIX xed priority scheduler, and we believe that this solution presents a number of problems. In
our opinion, a workstation OS must support temporal protection among applications, so that users can
access real-time scheduling facilities without the danger to starve the system. The Resource Reservation
framework is a class of techniques that can be used for providing temporal protection among di erent
real-time and non-real-time applications. Algorithms based on the Resource Reservation framework have
been implemented in a number of Linux variants (the most notable is Linux/RK). In this work, we propose
a novel implementation that di ers from the previous ones in some fundamental points. Thanks to the
particular reservation mechanism (the Constant Bandwidth Server - CBS) and to a careful design of our
scheduling infrastructure, our scheduler can correctly cope with aperiodic task arrivals.
1 Introduction
In recent years, there has been a great interest in

  

Source: Abeni, Luca - Dipartimento di Ingegneria e Scienza dell'Informazione, UniversitÓ di Trento

 

Collections: Computer Technologies and Information Sciences