Scheduling performance polymorphic computations in real-time systems

Peng Tu, Kwei Jay Lin

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

Abstract

The scheduling problems for real-time systems with multi-version computations are studied. A computation is performance polymorphic if it has been implemented in several versions each with a different performance characteristics like the time needed to produce a result. Given a set of periodic or aperiodic jobs each with multiple versions, we investigate the scheduling problem which determines the execution time for each job and select a version to optimize the overall system performance objective. The problems are modeled as resource sharing problems. Known techniques for the sharing problem can be used to allocate the time to each job. We also study several heuristic algorithms for problems which are NP-complete and compare their performances.

Original languageEnglish
Title of host publicationProceedings of the15th Annual International Computer Software and Applications Conference, CMPSAC 1991
PublisherIEEE Computer Society
Pages406-411
Number of pages6
ISBN (Electronic)0818621524
DOIs
StatePublished - 1991
Externally publishedYes
Event15th Annual International Computer Software and Applications Conference, CMPSAC 1991 - Tokyo, Japan
Duration: 11 09 199113 09 1991

Publication series

NameProceedings - International Computer Software and Applications Conference
ISSN (Print)0730-3157

Conference

Conference15th Annual International Computer Software and Applications Conference, CMPSAC 1991
Country/TerritoryJapan
CityTokyo
Period11/09/9113/09/91

Bibliographical note

Publisher Copyright:
© 1991 IEEE.

Fingerprint

Dive into the research topics of 'Scheduling performance polymorphic computations in real-time systems'. Together they form a unique fingerprint.

Cite this