Name
Title | ||
|---|---|---|
Algorithms for Scheduling Imprecise Computations with Timing Constraints to Minimize Maximum Error |
Abstract | ||
|---|---|---|
We consider here the problem of scheduling tasks in the imprecise computation model to minimize the maximum error. Given a task system and a schedule of it, the maximum error of the task system is equal to the error of the task that has the largest error when the task system is executed according to the schedule. We describe two preemptive algorithms for scheduling on a processor n dependent tasks with rational ready times, deadlines, and processing times. Each schedule found by our algorithms is an optimal schedule with the minimum total error, and according to this schedule the maximum error is minimized. The run times of our algorithms are O(n3) and O(n2). |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/12.372040 | IEEE Trans. Computers |
Keywords | Field | DocType |
scheduling imprecise computations,processor n dependent task,minimize maximum error,processing time,imprecise computation model,maximum error,optimal schedule,preemptive algorithm,largest error,rational ready time,timing constraints,task system,minimum total error,real time systems,computer model,protocols,availability,aging,computational complexity,distributed computing,scheduling algorithm,scheduling | Computer network management,Computer science,Scheduling (computing),Maximum error,Parallel computing,Algorithm,Imprecise computation,Real-time operating system,Real-time computing,Deterministic system (philosophy),Computation,Computational complexity theory | Journal |
Volume | Issue | ISSN |
44 | 3 | 0018-9340 |
Citations | PageRank | References |
23 | 1.63 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jane W.-S. Liu | 1 | 1399 | 337.97 |
| Wei-Kuan Shih | 2 | 938 | 98.21 |