摘要
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.
| 原文 | 英語 |
|---|---|
| 主出版物標題 | Proceedings of the15th Annual International Computer Software and Applications Conference, CMPSAC 1991 |
| 發行者 | IEEE Computer Society |
| 頁面 | 406-411 |
| 頁數 | 6 |
| ISBN(電子) | 0818621524 |
| DOIs | |
| 出版狀態 | 已出版 - 1991 |
| 對外發佈 | 是 |
| 事件 | 15th Annual International Computer Software and Applications Conference, CMPSAC 1991 - Tokyo, 日本 持續時間: 11 09 1991 → 13 09 1991 |
出版系列
| 名字 | Proceedings - International Computer Software and Applications Conference |
|---|---|
| ISSN(列印) | 0730-3157 |
Conference
| Conference | 15th Annual International Computer Software and Applications Conference, CMPSAC 1991 |
|---|---|
| 國家/地區 | 日本 |
| 城市 | Tokyo |
| 期間 | 11/09/91 → 13/09/91 |
文獻附註
Publisher Copyright:© 1991 IEEE.
指紋
深入研究「Scheduling performance polymorphic computations in real-time systems」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver