Competitive On-Line Scheduling of Imprecise Computations

Authors:
Sanjoy K. Baruah;Mary Ellen Hickey
Affiliations:
Univ. of Vermont, Burlington;3Com, Boxborough, MA
Venue:
IEEE Transactions on Computers
Year:
1998

Citing 5
Cited 5

Algorithms for Scheduling Imprecise Computations

Computer - Special issue on real-time systems
Algorithms for scheduling imprecise computations with timing constraints

SIAM Journal on Computing
On the competitiveness of on-line real-time task scheduling

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Partial servicing of on-line jobs

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Software radio system design for accessing wireless multimedia services

Information processing and technology
Competitive analysis of online real-time scheduling algorithms under hard energy constraint

Real-Time Systems
I-DEVS: imprecise real-time and embedded DEVS modeling

Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Automated analysis of real-time scheduling using graph games

Proceedings of the 16th international conference on Hybrid systems: computation and control

Quantified Score

Hi-index	14.98

Visualization

Abstract

The on-line scheduling of systems of imprecise-computation tasks is investigated. The system objective is to maximize the value obtained. A formal model is defined. Under certain reasonable assumptions驴formalized here as the weak feasible mandatory constraint驴a competitive on-line scheduling algorithm is presented for the commonly studied uniform-density task systems. It is proven, however, that an on-line algorithm may, in general, perform arbitrarily poorly as compared to a clairvoyant scheduler.