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 language | English |
|---|---|
| Title of host publication | Proceedings of the15th Annual International Computer Software and Applications Conference, CMPSAC 1991 |
| Publisher | IEEE Computer Society |
| Pages | 406-411 |
| Number of pages | 6 |
| ISBN (Electronic) | 0818621524 |
| DOIs | |
| State | Published - 1991 |
| Externally published | Yes |
| Event | 15th Annual International Computer Software and Applications Conference, CMPSAC 1991 - Tokyo, Japan Duration: 11 09 1991 → 13 09 1991 |
Publication series
| Name | Proceedings - International Computer Software and Applications Conference |
|---|---|
| ISSN (Print) | 0730-3157 |
Conference
| Conference | 15th Annual International Computer Software and Applications Conference, CMPSAC 1991 |
|---|---|
| Country/Territory | Japan |
| City | Tokyo |
| Period | 11/09/91 → 13/09/91 |
Bibliographical note
Publisher Copyright:© 1991 IEEE.