This Article 
 Bibliographic References 
 Add to: 
A Multiframe Model for Real-Time Tasks
October 1997 (vol. 23 no. 10)
pp. 635-645

Abstract—The well-known periodic task model of Liu and Layland [10] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a task is much longer than the average. In this paper, we give a multiframe real-time task model which allows the execution time of a task to vary from one instance to another by specifying the execution time of a task in terms of a sequence of numbers. We investigate the schedulability problem for this model for the preemptive fixed priority scheduling policy. We show that a significant improvement in the utilization bound can be established in our model.

[1] S.K. Baruah, D. Chen, S. Gorinsky, and A.K. Mok, "Generalized Multiframe Tasks, 1997, to appear.
[2] A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, “Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems,” IEEE Trans. Computers, vol. 44, no. 12, pp. 1429-1442, Dec. 1995.
[3] A. Burns and A J. Wellings, "Dual Priority Assignment: A Practical Method for Increasing Processor Utilization," Fifth Euromicro Workshop on Real-Time Systems. pp. 48-55, Oulu, 1993.
[4] J.Y. Chung,J.W.S. Liu,, and K.J. Lin,“Scheduling Periodic Jobs That Allows Imprecise Results,” IEEE Transactions on Computers, vol.19, no. 9, pp. 1156-1173, September 1990.
[5] D. Le Gall, “MPEG: A Video Compression Standard for Multimedia Applications,” Comm. ACM, Apr. 1991.
[6] T.M. Ghazalie and T.P. Baker, “Aperiodic Servers in a Deadline Scheduling Environment,” J. Real-Time Systems, vol. 9, pp. 21-36, 1995.
[7] M.G. Harbour, M.H. Klein, and J.P. Lehoczky, “Timing Analysis for Fixed Priority Scheduling of Hard Real Time Systems,” IEEE Trans. Software Eng., vol. 20, no. 1, pp. 13-28, Jan. 1994.
[8] T.-W. Kuo and A.K. Mok, “Load Adjustment in Adaptive Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., Dec. 1991.
[9] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE Real-Time Systems Symp., pp. 166-171, 1989.
[10] 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.
[11] A.K. Mok, "Fundamental Design Problems of Distributed Systems for the Hard-Real Time Environment," PhD thesis, MIT, 1983
[12] A.K. Mok and D. Chen, "A General Model for Real-Time Tasks," Technical Report CS-TR-96-24, Dept. of Computer Sciences, The University of Texas at Austin, Oct. 1996.
[13] A.K. Mok and D. Chen, "A Multiframe Model for Real-Time Tasks," Proc. IEEE Real-Time System Symp., pp. 22-29,Washington DC, Dec. 1996.
[14] L. Sha and J.B. Goodenough, "Real-Time Scheduling Theory and Ada," Computer, vol. 24, no. 4, pp. 53-62, Apr. 1990.
[15] B. Sprunt, L. Sha, and J.P. Lehoczky, "Aperiodic Task Scheduling for Hard Real-Time Systems," Real-Time Systems: The International J. of Time-Critical Computing Systems, vol. 1, pp. 27-60, 1989.
[16] J.K. Strosnider, J.P. Lehoczky, and L. Sha, “The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments,” IEEE Trans. Computers, vol. 44, no. 1, Jan. 1995.

Index Terms:
Real-time, task model, scheduling, utilization bound.
Aloysius K. Mok, Deji Chen, "A Multiframe Model for Real-Time Tasks," IEEE Transactions on Software Engineering, vol. 23, no. 10, pp. 635-645, Oct. 1997, doi:10.1109/32.637146
Usage of this product signifies your acceptance of the Terms of Use.