User-controlled optimization of task scheduling for imprecise computer systems

Abstract The performance of imprecise computer systems with optimized task scheduling is studied. An imprecise computer system trades off computational accuracy for faster response time of tasks (when necessary) and is therefore potentially useful in real-time applications. In the authors' system, tasks arrive randomly during runtime. Each task has two levels of computation time requirements: the full-level computation requirement and the reduced-level computation requirement. The reduced-level computation of a task takes less time to accomplish than the full-level one and produces results that are acceptable as, though less precise than, those of the full-level computation. The tasks are scheduled in the following way: if the total number of tasks in the system is no more than M — a system parameter — the tasks are executed at the full level; otherwise, the tasks are executed at the reduced level. An optimization procedure that is driven by user requirements is studied. It is proposed to select the system parameter M such that an objective function is optimized and a set of user-specified requirements is met. The optimization procedure aims to give the user the control in determining the parameter M according to performance requirements. The performance of the system under the control of the optimization procedure is examined.

[1]  John A. Stankovic,et al.  A Perspective on Distributed Computer Systems , 1984, IEEE Transactions on Computers.

[2]  Wei Zhao A heuristic approach to scheduling hard real-time tasks with resource requirements in distributed systems , 1986 .

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

[4]  Yechiam Yemini A bang-bang principle for real-time transport protocols , 1983, SIGCOMM 1983.

[5]  Krithi Ramamritham,et al.  Scheduling Tasks with Resource Requirements in Hard Real-Time Systems , 1987, IEEE Transactions on Software Engineering.

[6]  R. H. Campbell,et al.  A fault-tolerant scheduling problem , 1989, IEEE Transactions on Software Engineering.

[7]  Krithi Ramamritham,et al.  Preemptive Scheduling Under Time and Resource Constraints , 1987, IEEE Transactions on Computers.

[8]  Jane W.-S. Liu,et al.  Algorithms for scheduling periodic jobs to minimize average error , 1988, Proceedings. Real-Time Systems Symposium.

[9]  Krithi Ramamritham,et al.  Hard Real-Time Systems , 1988 .

[10]  Edwin K. P. Chong,et al.  Performance evaluation of scheduling algorithms for imprecise computer systems , 1991, J. Syst. Softw..

[11]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .

[12]  Donald F. Towsley,et al.  Dynamic Flow Control Protocols for Packet-Switching Multiplexers Serving Real-Time Multipacket Messages , 1986, IEEE Trans. Commun..

[13]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[14]  Kang G. Shin Introduction to the Special Issue on Real-Time Systems , 1987 .

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

[16]  Kwei-Jay Lin,et al.  Recovering imprecise transactions with real-time constraints , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.