Greedy Tree Growing Heuristics on Block-Test Scheduling Under Power Constraints
| Autor: | Xiaojun Wang, Mircea Vlăduţiu, Valentina Mureşan, Valentin Muresan |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Rate-monotonic scheduling
Earliest deadline first scheduling Mathematical optimization Fixed-priority pre-emptive scheduling Two-level scheduling Dynamic priority scheduling Electrical and Electronic Engineering Round-robin scheduling Computer Science::Operating Systems Fair-share scheduling Deadline-monotonic scheduling Mathematics |
| Zdroj: | Journal of Electronic Testing. 20:61-78 |
| ISSN: | 0923-8174 |
| DOI: | 10.1023/b:jett.0000009314.39022.78 |
| Popis: | Greedy scheduling algorithms are proposed here to improve the test concurrency under power limits. An extended tree growing technique is used to model the power-constrained test scheduling problem in these algorithms. A constant additive model is employed for power dissipation analysis and estimation. The efficiency of this approach is assessed with test scheduling examples and the experimental results are presented. Known list scheduling approaches are proven to give acceptable power-constrained test scheduling results quickly, but not guaranteed to be optimal. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink