Spare CASH: Reclaiming holes to minimize aperiodic response times in a firm real-time environment

Deepu C. Thomas, Sathish Gopalakrishnan, Marco Caccamo, Chang Gun Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Scheduling periodic tasks that allow some instances to be skipped produces spare capacity in the schedule. Only a fraction of this spare capacity is uniformly distributed and can easily be reclaimed for servicing aperiodic requests. The remaining fraction of the spare capacity is non-uniformly distributed, and no existing technique has been able to reclaim it. We present a method for improving the response times of aperiodic tasks by identifying the non-uniform holes in the schedule and adding these holes as extra capacity to the capacity queue of the CASH mechanism. The non-uniform holes can account for a significant portion of spare capacity, and reclaiming this capacity results in considerable improvements to aperiodic response times.

Original languageEnglish (US)
Title of host publicationProceedings - 17th Euromicro Conference on Real-Time Systems, ECRTS 2005
Pages147-156
Number of pages10
DOIs
StatePublished - 2005
Event17th Euromicro Conference on Real-Time Systems, ECRTS 2005 - Palma de Mallorca, Balearic Islands, Spain
Duration: Jul 6 2005Jul 8 2005

Publication series

NameProceedings - Euromicro Conference on Real-Time Systems
Volume2005
ISSN (Print)1068-3070

Other

Other17th Euromicro Conference on Real-Time Systems, ECRTS 2005
CountrySpain
CityPalma de Mallorca, Balearic Islands
Period7/6/057/8/05

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Spare CASH: Reclaiming holes to minimize aperiodic response times in a firm real-time environment'. Together they form a unique fingerprint.

Cite this