This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
December 1995 (vol. 44 no. 12)
pp. 1443-1451

Abstract—The problem of scheduling multiple streams of real-time customers. is addressed in this paper. The paper first introduces the notion of (m, k)-firm deadlines to better characterize the timing constraints of real-time streams. More specifically, a stream is said to have (m, k)-firm deadlines if at least m out of any k consecutive customers must meet their deadlines. A stream with (m, k)-firm deadlines experiences a dynamic failure if fewer than m out of any k consecutive customers meet their deadlines.

The paper then proposes a priority-based policy for scheduling N such streams on a single server to reduce the probability of dynamic failure. The basic idea is to assign higher priorities to customers from streams that are closer to a dynamic failure so as to improve their chances of meeting their deadlines. The paper proposes a heuristic for assigning these priorities. The effectiveness of this approach is evaluated through simulation under various customer arrival and service patterns. The scheme is compared to a conventional scheme where all customers are serviced at the same priority level and to an imprecise computation model approach. The evaluation shows that substantial reductions in the probability of dynamic failure are achieved when the proposed policy is used.

[1] C.M. Aras, J.F. Kurose, D.S. Reeves, and H. Schulzrinne, “Real-Time Communication in Packet-Switched Networks,” Proc. IEEE, vol. 82, no. 1, pp. 122-139, Jan. 1994.
[2] J.J. Bae and T. Suda,“Survey of traffic control schemes and protocols in ATM networks,” IEEE Proc., vol. 79, pp. 170-189, Feb. 1991.
[3] R. Chipalkatti,J.F. Kurose,, and D. Towsley,“Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer,” IEEE INFOCOM, pp. 774-783, Apr. 1989.
[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] K. Kubota,M. Murata,H. Miyahara,, and Y. Oie,“Congestion control for bursty video traffic in ATM networks,” Electronics and Comm. in Japan, vol. 175, pp. 13-19, Apr. 1992.
[6] J.W.S. Liu,K.-J. Lin,C.L. Liu,W.K. Shih,, and J.Y. Chung,“Imprecise computations: A means to provide scheduling flexibility and enhance dependability,” Readings in Real-Time Systems, Y.-H. Lee and C.M. Krishna, eds., ch. 2, pp. 81-97, IEEE CS Press, 1993.
[7] 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.
[8] D.W. Petr and V.S. Frost,“Optimal packet discarding: An ATM-oriented analysis model and initial results,” IEEE INFOCOM, pp. 537-542, June 1990.
[9] M.A. Saleh,I.W. Habib,, and T.N. Saadawi,“Simulation analysis of a communication link with statistically multiplexedbursty voice sources,” IEEE J. Selected Areas in Comm., vol. 11, no. 3, pp. 432-442, Apr. 1993.
[10] L. Tierney, Lispstat: An Object-Orientated Environment for Statistical Computing and Dynamic Graphics. New York: Wiley, 1991.
[11] K. Sriram and W. Whitt,“Characterizing superposition arrival processes in packet multiplexers forvoice and data,” IEEE J. Selected Areas in Comm., vol. 4, no. 6,, Sept. 1986.

Index Terms:
Real-time systems, deadline-constrained scheduling, dynamic failure, priority queues, soft deadlines.
Citation:
Parameswaran Ramanathan, Moncef Hamdaoui, "A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines," IEEE Transactions on Computers, vol. 44, no. 12, pp. 1443-1451, Dec. 1995, doi:10.1109/12.477249
Usage of this product signifies your acceptance of the Terms of Use.