Name
Title | ||
|---|---|---|
On-line scheduling algorithms for reducing the largest weighted error incurred by imprecise tasks |
Abstract | ||
|---|---|---|
The paper proposes online scheduling algorithms that reduce the largest weighted error incurred by preemptive imprecise tasks running on a single processor system. The first one is a two level algorithm. The top level scheduling, which is executed whenever a new task arrives, determines the processing times to be allotted to tasks in such a way to minimize maximum weighted error as well as to minimize total error. The lower level algorithm actually allocates the processor to the tasks. The second algorithm extends the online algorithm studied by W.K. Shih and J.W.S. Liu (1992) by formalizing the top level algorithm mathematically. The numerical simulation shows that the proposed algorithm outperforms the previous works in the sense that it greatly reduces the largest weighted error |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/RTCSA.1998.726409 | RTCSA |
Keywords | Field | DocType |
single processor system,processing times,top level scheduling,lower level algorithm,scheduling,preemptive imprecise tasks,two level algorithm,maximum weighted error,resource allocation,largest weighted error,online scheduling algorithms,numerical simulation,processor allocation,minimisation,on-line scheduling algorithms,top level algorithm,imprecise tasks,computational modeling,degradation,scheduling algorithm,online algorithm | Online algorithm,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Real-time computing,Least slack time scheduling,Generalized processor sharing,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-9209-X | 2 | 0.60 |
References | Authors | |
2 | 6 | |