Competitive On-Line Scheduling of Imprecise Computations

  title={Competitive On-Line Scheduling of Imprecise Computations},
  author={Sanjoy K. Baruah and Mary Ellen Hickey},
The on-line scheduling of systems of imprecisecomputation 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 B-competitive on-line scheduling algorithm is presented for the commonly studied uniform-density task systems. It ia proven, however, that an on-line algorithm may in general perform arbitratily poorly as compared to a clairvoyant… CONTINUE READING