Scheduling performance polymorphic computations in real-time systems

Author

Tu, Peng ; Lin, Kwei-Jay

Author_Institution

Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA

fYear

1991

fDate

11-13 Sep 1991

Firstpage

406

Lastpage

411

Abstract

The scheduling problems for real-time systems with multiversion 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, an investigation is made of the scheduling problem which determines the execution time for each job, and a version is selected 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. Several heuristic algorithms are studied for problems which are NP-complete, and their performances are compared

Keywords

operating systems (computers); real-time systems; resource allocation; scheduling; execution time; heuristic algorithms; multiversion computations; performance polymorphic computations; real-time systems; resource sharing problems; scheduling problems; system performance; Aerospace electronics; Computer architecture; Computer science; Heuristic algorithms; Physics computing; Processor scheduling; Real time systems; Resource management; System performance; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1991. COMPSAC '91., Proceedings of the Fifteenth Annual International

Conference_Location

Tokyo

Print_ISBN

0-8186-2152-4

Type

conf

DOI

10.1109/CMPSAC.1991.170213

Filename

170213