Title :
Competitive on-line scheduling of imprecise computations
Author :
Baruah, Sanjoy K. ; Hickey, Mary Ellen
Author_Institution :
Dept. of Comput. Sci., Vermont Univ., Burlington, VT, USA
fDate :
9/1/1998 12:00:00 AM
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
Keywords :
competitive algorithms; processor scheduling; competitive on-line scheduling; competitive ratio; imprecise computation; imprecise computations; on-line algorithm; on-line scheduling; uniprocessor systems; weak feasible mandatory constraint; Airplanes; Algorithm design and analysis; Computational modeling; Computer displays; Computer errors; Control systems; Processor scheduling; Real time systems; Scheduling algorithm; Time factors;
Journal_Title :
Computers, IEEE Transactions on
