Algorithms for scheduling computations with secondary deadlines to minimize penalty

Ching Chih Han, Kwei Jay Lin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In many real-time applications, some job allows part of its computation to be executed after its primary deadline but before an extended, or secondary deadline. We study the scheduling issues for real-time computations with secondary deadlines. We call the part of a computation which must be completed before the primary deadline its hard part, and the rest its soft part. The soft part of a computation can be delayed after its primary deadline but must be finished before its secondary deadline. Although the computations have secondary deadlines, it is still desirable to finish the complete computations before their primary deadlines. Therefore, the system receives a penalty for each soft part that finishes after the primary deadline. We present scheduling algorithms for the model which minimizes the total penalty or the maximum penalty.

Original languageEnglish
Title of host publicationProceedings - 6th Euromicro Workshop on Real-Time Systems, ECRTS 1994
Pages143-148
Number of pages6
DOIs
StatePublished - 1994
Externally publishedYes
Event6th Euromicro Workshop on Real-Time Systems, ECRTS 1994 - Vaesteraas, Sweden
Duration: 15 06 199417 06 1994

Publication series

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

Conference

Conference6th Euromicro Workshop on Real-Time Systems, ECRTS 1994
Country/TerritorySweden
CityVaesteraas
Period15/06/9417/06/94

Fingerprint

Dive into the research topics of 'Algorithms for scheduling computations with secondary deadlines to minimize penalty'. Together they form a unique fingerprint.

Cite this