This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
June 2004 (vol. 53 no. 6)
pp. 744-759

Abstract—This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed (or, equivalently, must be met) in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded, even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while, at the same time, guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for bandwidth by a set of window-constrained streams can exceed 100 percent and still ensure all window-constraints are met. In fact, we show how it is possible to strategically skip certain deadlines in overload conditions, yet fully utilize all available link capacity and guarantee worst-case per-stream bandwidth and delay constraints. Finally, we compare DWCS to the "Distance-Based” Priority (DBP) algorithm, emphasizing the trade-offs of both approaches.

[1] A. Atlas and A. Bestavros, Statistical Rate Monotonic Scheduling Proc. 19th IEEE Real-Time Systems Symp., pp. 123-132, 1998.
[2] S.K. Baruah and S.-S. Lin, Pfair Scheduling of Generalized Pinwheel Task Systems IEEE Trans. Computers, vol. 47, no. 7, pp. 812-516, July 1998.
[3] J. Bennett and H. Zhang, “$\big. WF^2Q\bigr.$: Worst-Case Fair Weighted Fair Queueing,” Proc. IEEE INFOCOM 96, pp. 120-128, Mar. 1996.
[4] G. Bernat and A. Burns, "Combining (n, m)-Hard Deadlines and Dual Priority Scheduling," Proc. IEEE Real-Time Systems Symp.,San Francisco, pp. 46-57, Dec. 1997.
[5] G. Bernat, A. Burns, and A. Llamosi, Weakly-Hard Real-Time Systems IEEE Trans. Computers, vol. 50, no. 4, pp. 308-321, Apr. 2001.
[6] G. Bernat and R. Cayssials, Guaranteed On-Line Weakly-Hard Real-Time Systems Proc. 22nd IEEE Real-Time Systems Symp., Dec. 2001.
[7] P.P. Bhattacharya and A. Ephremides, Optimal Scheduling with Strict Deadlines IEEE Trans. Automatic Control, vol. 34, no. 7, pp. 721-728, July 1989.
[8] C. Carlsson and O. Hagsand, DIVE A Platform for Multi-User Virtual Environments Computers and Graphics, vol. 17, no. 6, pp. 663-669, Nov./Dec. 1993.
[9] M. Chan and F. Chin, Schedulers for the Pinwheel Problem Based on Double-Integer Reduction IEEE Trans. Computers, vol. 41, no. 6, pp. 755-768, June 1992.
[10] A. Demers, S. Keshav, and S. Schenker, Analysis and Simulation of a Fair-Queueing Algorithm J. Internetworking Research and Experience, pp. 3-26, Oct. 1990.
[11] D. Ferrari, Client Requirements for Real-Time Communication Services IEEE Comm. Magazine, vol. 28, no. 11, pp. 76-90, Nov. 1990.
[12] S.J. Golestani, A Self-Clocked Fair Queueing Scheme for Broadband Applications Proc. IEEE INFOCOM, pp. 636-646, June 1994.
[13] P. Goyal, H.M. Vin, and H. Cheng, Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks Proc. IEEE SIGCOMM '96, 1996.
[14] S. Greenberg and D. Marwood, Real-Time Groupware as a Distributed System: Concurrency Control and Its Effect on the Interface Proc. ACM Conf. Cooperative Support for Cooperative Work, pp. 207-217, 1994.
[15] M. Hamdaoui and P. Ramanathan, "A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines," IEEE Trans. Computers, vol. 44, no. 12, pp. 1,443-1,451, Dec. 1995.
[16] J.M. Harrison, Dynamic Scheduling of a Multiclass Queue: Discount Optimality Operations Research, vol. 23, no. 2, pp. 370-382, Mar.-Apr. 1975.
[17] R. Holte, A. Mok, L. Rosier, I. Tulchinsky, and D. Varvel, The Pinwheel: A Real-Time Scheduling Problem Proc. 22nd Hawaii Int'l Conf. System Science, pp. 693-702, Jan. 1989.
[18] K. Jeffay and S. Goddard, A Theory of Rate-Based Execution Proc. 20th IEEE Real-Time Systems Symp. (RTSS), Dec. 1999.
[19] G. Koren and D. Shasha, "Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips," Proc. IEEE Real-Time System Symp., pp. 110-117,Pisa, Italy, Dec. 1995.
[20] R. Kravets, K. Calvert, P. Krishnan, and K. Schwan, Adaptive Variation of Reliability Proc. High-Performance Networking Conf. (HPN-97), Apr. 1997.
[21] R. Krishnamurthy, K. Schwan, R. West, and M. Rosu, On Network Coprocessors for Scalable, Predictable Media Services IEEE Trans. Parallel and Distributed Systems, to appear.
[22] R. Krishnamurthy, S. Yalamanchili, K. Schwan, and R. West, Leveraging Block Decisions and Aggregation in the Sharestreams QoS Architecture Proc. Int'l Conf. Parallel and Distributed Systems (IPDPS), 2003.
[23] Linux DWCS,http://www.cs.bu.edu/fac/richwestdwcs.html , 2004.
[24] C.L. Liu and J.W. Layland, Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[25] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks Proc. Operating Systems Design and Implementation, Dec. 2002.
[26] A.K. Mok and W. Wang, Window-Constrained Real-Time Periodic Task Scheduling Proc. 22nd IEEE Real-Time Systems Symp., 2001.
[27] J. Nieh and M.S. Lam, The Design, Implementatin and Evaluation of SMART: A Scheduler for Multimedia Applications Proc. 16th ACM Symp. Operating Systems Principles, Oct. 1997.
[28] S.S. Panwar, D. Towsley, and J.K. Wolf, Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service J. ACM, vol. 35, no. 4, pp. 832-844, Oct. 1988.
[29] A. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
[30] X.G. Pawan Goyal and H.M. Vin, A Hierarchical CPU Scheduler for Multimedia Operating Systems Proc. Second Symp. Operating Systems Design and Implementation, pp. 107-121, 1996.
[31] J.M. Peha and F.A. Tobagi, A Cost-Based Scheduling Algorithm to Support Integrated Services Proc. IEEE INFOCOM '91, pp. 741-753, 1991.
[32] S. Singhal, Effective Remote Modeling in Large-Scale Distributed Simulation and Visualization Environments PhD thesis, Stanford Univ., Aug. 1996.
[33] D. Stiliadis and A. Varma, Efficient Fair Queueing Algorithms for Packet-Switched Networks IEEE/ACM Trans. Networking, vol. 6, no. 2, 1998.
[34] I. Stoica, H. Abdel-Wahab, K. Jeffay, S.K. Baruah, J.E. Gehrke, and C.G. Plaxton, A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems Proc. Real-Time Systems Symp., Dec. 1996.
[35] A. Striegel and G. Manimaran, Dynamic Class-Based Queue Management for Scalable Media Servers J. Systems and Software, 2003.
[36] R. West, I. Ganev, and K. Schwan, Window-Constrained Process Scheduling for Linux Systems Proc. Third Real-Time Linux Workshop, Nov. 2001.
[37] R. West and C. Poellabauer, Analysis of a Window-Constrained Scheduler for Real-Time and Best-Effort Packet Streams Proc. 21st IEEE Real-Time Systems Symp., Dec. 2000.
[38] R. West and K. Schwan, Dynamic Window-Constrained Scheduling for Multimedia Applications Proc. Sixth Int'l Conf. Multimedia Computing and Systems (ICMCS '99), June 1999. Also available as Technical Report: GIT-CC-98-18, Georgia Inst. of Tech nology.
[39] R. West, K. Schwan, and C. Poellabauer, Scalable Scheduling Support for Loss and Delay Constrained Media Streams Proc Fifth IEEE Real-Time Technology and Applications Symp., June 1999.
[40] J. Xu and R.J. Lipton, On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms Proc. SIGCOMM 2002, Aug. 2002.
[41] H. Zhang and S. Keshav, Comparison of Rate-Based Service Disciplines Proc. ACM SIGCOMM, pp. 113-121, Aug. 1991.

Index Terms:
Real-time systems, multimedia, window-constraints, scheduling.
Citation:
Richard West, Yuting Zhang, Karsten Schwan, Christian Poellabauer, "Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers," IEEE Transactions on Computers, vol. 53, no. 6, pp. 744-759, June 2004, doi:10.1109/TC.2004.10
Usage of this product signifies your acceptance of the Terms of Use.