论文信息 - Competitive On-Line Scheduling of Imprecise Computations

Competitive On-Line Scheduling of Imprecise Computations

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.

Sanjoy K. Baruah | Mary Ellen Hickey

[1] Michael L. Dertouzos,et al. Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

[2] Wei-Kuan Shih,et al. On-line scheduling of imprecise computations to minimize error , 1992, [1992] Proceedings Real-Time Systems Symposium.

[3] Wei Kuan Shih,et al. Algorithms for Scheduling Imprecise Computations with Timing Constraints , 1991, SIAM J. Comput..

[4] Giorgio Buttazzo,et al. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[5] Jane W.-S. Liu,et al. Scheduling Periodic Jobs That Allow Imprecise Results , 1990, IEEE Trans. Computers.

[6] Wei Kuan Shih,et al. Fast algorithms for scheduling imprecise computations , 1989, RTSS 1989.

[7] W. A. Horn. Some simple scheduling algorithms , 1974 .

[8] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[9] Wei-Kuan Shih,et al. Algorithms for scheduling imprecise computations , 1991, Computer.

[10] Jane W.-S. Liu,et al. Scheduling Real-Time, Periodic Jobs Using Imprecise Results , 1987, RTSS.

[11] Jane W.-S. Liu,et al. Imprecise Results: Utilizing Partial Comptuations in Real-Time Systems , 1987, RTSS.