Name
Abstract | ||
|---|---|---|
The imprecise computation technique, which prevents timing faults and achieves graceful degradation by giving the user an approximate result of acceptable quality whenever the system cannot produce the exact result in time, is considered. Different approaches for scheduling imprecise computations in hard real-time environments are discussed. Workload models that quantify the tradeoff between result quality and computation time are reviewed. Scheduling algorithms that exploit this tradeoff are described. These include algorithms for scheduling to minimize total error, scheduling periodic jobs, and scheduling parallelizable tasks. A queuing-theoretical formulation of the imprecise scheduling problem is presented. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/2.76287 | IEEE Computer |
Keywords | DocType | Volume |
Scheduling Imprecise Computations,acceptable quality,imprecise scheduling problem,imprecise computation,Workload model,computation time,result quality,approximate result,exact result,Scheduling algorithm,imprecise computation technique | Journal | 24 |
Issue | ISSN | Citations |
5 | 0018-9162 | 173 |
PageRank | References | Authors |
18.85 | 9 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jane W.-S. Liu | 1 | 1399 | 337.97 |
| Kwei-Jay Lin | 2 | 3209 | 376.05 |
| Wei-Kuan Shih | 3 | 938 | 98.21 |
| Albert Chuang-shi Yu | 4 | 177 | 19.38 |
| Jen-Yao Chung | 5 | 1489 | 243.42 |
| Wei Zhao | 6 | 3532 | 404.01 |