Issue No.09 - September (1998 vol.47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.713322
<p><b>Abstract</b>—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 <it>weak feasible mandatory constraint</it>—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.</p>
On-line scheduling, competitive ratio, imprecise computations, uniprocessor systems.
Sanjoy K. Baruah, "Competitive On-Line Scheduling of Imprecise Computations", IEEE Transactions on Computers, vol.47, no. 9, pp. 1027-1032, September 1998, doi:10.1109/12.713322