This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Competitive On-Line Scheduling of Imprecise Computations
September 1998 (vol. 47 no. 9)
pp. 1027-1032
ASCII Text
x 
 
Sanjoy K. Baruah, Mary Ellen Hickey, "Competitive On-Line Scheduling of Imprecise Computations," IEEE Transactions on Computers, vol. 47, no. 9, pp. 1027-1032, September, 1998.
 
 
BibTex
x
 
@article{ 10.1109/12.713322,
author = {Sanjoy K. Baruah and Mary Ellen Hickey},
title = {Competitive On-Line Scheduling of Imprecise Computations},
journal ={IEEE Transactions on Computers},
volume = {47},
number = {9},
issn = {0018-9340},
year = {1998},
pages = {1027-1032},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.713322},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Competitive On-Line Scheduling of Imprecise Computations
IS - 9
SN - 0018-9340
SP1027
EP1032
EPD - 1027-1032
A1 - Sanjoy K. Baruah,
A1 - Mary Ellen Hickey,
PY - 1998
KW - On-line scheduling
KW - competitive ratio
KW - imprecise computations
KW - uniprocessor systems.
VL - 47
JA - IEEE Transactions on Computers
ER -
 

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.

[1] S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang, "On the Competitiveness of On-Line Real-Time Task Scheduling," Real-Time Systems, vol. 4, pp. 125-144, 1992. Also in Proc. 12th Real-Time Systems Symp., San Antonio, Tex., Dec. 1991.
[2] G. Buttazzo, Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, pp. 102-103. Boston: Kluwer Academic, 1997.
[3] M. Dertouzos, "Control Robotics: The Procedural Control of Physical Processors," Proc. IFIP Congress, pp. 807-813, 1974.
[4] W. Horn, "Some Simple Scheduling Algorithms," Naval Research Logistics Quarterly, vol. 21, pp. 177-185, 1974.
[5] K. Lin, J. Liu, and S. Natarajan, "Scheduling Real-Time, Periodic Jobs Using Imprecise Results," Proc. Real-Time Systems Symp.,San Francisco, Dec. 1987.
[6] K. Lin, S. Natarajan, and J. Liu, "CONCORD: A Distributed System for Making Use of Imprecise Results," Proc. COMPSAC,Tokyo, Oct. 1987.
[7] K. Lin, S. Natarajan, and J. Liu, "Imprecise Results: Utilizing Partial Computations in Real-Time Systems," Proc. Real-Time Systems Symp.,San Francisco, Dec. 1987.
[8] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[9] J.W.S. Liu,K.J. Lin,W.K. Shih,J.Y. Chung,A. Yu,, and W. Zhao,“Algorithms for Scheduling Imprecise Computations,” IEEE Computer, pp. 58-68, May 1991.
[10] A. Mok, "Task Management Techniques for Enforcing ED Scheduling on a Periodic Task Set," Proc. Fifth IEEE Workshop Real-Time Software and Operating Systems, May 1988.
[11] W. Shih and J. Liu, "On-Line Scheduling of Imprecise Computations to Minimize Error," Proc. Real-Time Systems Symp., Dec. 1992.
[12] J. ${\bf Hromkovi}\!\breve{\bf c}$, "Tradeoffs for Language Recognition on Alternating Machines," Theoretical Computer Science, vol. 63, pp. 203-221, 1989.

Index Terms:
On-line scheduling, competitive ratio, imprecise computations, uniprocessor systems.
Citation:
Sanjoy K. Baruah, Mary Ellen Hickey, "Competitive On-Line Scheduling of Imprecise Computations," IEEE Transactions on Computers, vol. 47, no. 9, pp. 1027-1032, Sept. 1998, doi:10.1109/12.713322
Usage of this product signifies your acceptance of the Terms of Use.