Performance evaluation of scheduling algorithms for imprecise computer systems
Journal of Systems and Software
On-Line Scheduling of Imprecise Computations to Minimize Error
SIAM Journal on Computing
Competitive On-Line Scheduling of Imprecise Computations
IEEE Transactions on Computers
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Navigating through a forest of quad trees to spot images in a database
Navigating through a forest of quad trees to spot images in a database
Applications and Extensions of the Imprecise-Computation Model
Applications and Extensions of the Imprecise-Computation Model
Scheduling in real-time systems to ensure graceful degradation: The imprecise-computation and the deferred-deadline approaches
| Hi-index | 0.00 |
We consider the problem of scheduling jobs online, where jobs may be served partially in order to optimize the overall use of the machines. Service requests arrive online to be executed immediately; the scheduler must decide how long and if it will run a job (that is, it must fix the Quality of Service level of the job) at the time of arrival of the job: preemption is not allowed. We give lower bounds on the competitive ratio and present algorithms for jobs with varying sizes and for jobs with uniform size, and for jobs that can be run for an arbitrary time or only for some fixed fraction of their full execution time.