This Article 
 Bibliographic References 
 Add to: 
Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers
January 1996 (vol. 7 no. 1)
pp. 56-68

Abstract—In this paper, we consider soft real-time systems with redundant off-the-shelf processing components (e.g., CPU, disk, network), and show how applications can exploit the redundancy to improve the system's ability of meeting response time goals (soft deadlines). We consider two scheduling policies, one that evenly distributes load (Balance), and one that partitions load according to job slackness (Chop). We evaluate the effectiveness of these policies through analysis and simulation. Our results show that by intelligently distributing jobs by their slackness amount the servers, Chop can significantly improve real-time performance.

[1] Tandom Computers, Introduction to NonStop Systems, 16270.Cupertino, Calif., 1991.
[2] R. Abbott and H. Garcia-Molina, "Scheduling I/O Requests with Deadlines: A Performance Evaluation," Proc. IEEE Real-Time Systems Symp., pp. 113-124, 1990.
[3] B. Adelberg,H. Garcia-Molina, and B. Kao,"Emulating soft real-time scheduling using traditional operating system schedulers," IEEE Real-Time System Symp., 1994.
[4] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[5] D. Bitton and J. Gray, “Disk Shadowing,” Very Large Data Bases, pp. 331–338, 1988.
[6] M. Carey, R. Jauhari, and M. Livny, "Priority in DBMS Resource Scheduling," Proc. Int'l Conf. Very Large Data Bases, pp. 397-410, 1989.
[7] S. Chiou and V.O.K. Li,"An optimal two-copy routing scheme in a communication network," IEEE INFOCOM, pp. 288-297, 1988.
[8] H. Garcia-Molina,B. Kao, and D. Barbara,"Aggressive transmission over redundant paths," Proc. 11th IEEE Int'l Conf. Distributed Computing Systems, pp. 198-207, 1991.
[9] J. Gray, B. Horst, and M. Walker, "Parity Striping of Disk Arrays: Low Cost Reliable Storage with Acceptable Throughput," Proc. 16th Int'l VLDB Conf., p. 152, 1990.
[10] J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kauffman, 1993.
[11] J. Hong,X. Tan,, and D. Towsley,“A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system,” IEEE Transactions on Computers, vol. 38, pp. 1,736-1,744, Dec. 1989.
[12] I. Iliadis and L.Y Lien,"Resequencing delay for a queueing system with two heterogeneous servers under a threshold-type scheduling," IEEE Trans. Comm., vol. 36, no. 6, pp. 692-702, June 1988.
[13] E.D. Jensen,C.D. Locke, and H. Tokuda,"A time-value driven scheduling model for real-time operating systems," IEEE Real-Time System Symp., 1985.
[14] L. Kleinrock,Queueing Systems, vol. 1. John Wiley&Sons, 1976.
[15] C. Knessl,B.J. Matkowsky,Z. Schuss, and C. Tier,"Two parallel queues with dynamic routing," IEEE Trans. Comm., vol. 34, no. 12, pp. 1,170-1,175,, Dec. 1986.
[16] H.F. Korth and A. Silberschatz, Database System Concepts. McGraw-Hill Advanced Computer Science Series. McGraw-Hill Book Co., 1986.
[17] W. Lin and P.R. Kumar,"Optimal control of a queueing system with two heterogeneous servers," IEEE Trans. Comm., vol. 29, no. 8, pp. 696-703, Aug. 1984.
[18] B.G. Lindsay, L. Haas, C. Mohan, H. Pirahesh, and P. Wilms, "A Snapshot Differential Refresh Algorithm," Proc. ACM SIGMOD Conf., pp. 53-60, June 1986.
[19] M. Livny, DeNet user's guide, technical report, Univ. of Wisconsin-Madison, 1990.
[20] J.W. Mark and B.J. Lee, "A Dual-Ring LAN for Integrated Voice/Video/Data Services," Proc. IEEE INFOCOM '90, pp. 850-857, 1990.
[21] R.M. Metcalfe and D.R. Boggs, “Ethernet: Distributed Packet Switching for Local Computer Networks,” Comm. ACM, vol. 19, pp. 395–404, 1976.
[22] M.L. Molle and L. Kleinrock,"Virtual time CSMA: Why two clocks are better than one," IEEE Trans. Comm., vol. 33, no. 9, Sept. 1985.
[23] M. Nakamura,I. Sasase, and S. Mori,"Two parallel queues with dynamic routing under a threshold-type scheduling," IEEE GLOBECOM, pp. 1,445-1,449, 1989.
[24] R.M. Newman and J.L. Hullet,"Distributed queueing: A fast and efficient packet access protocol for QPSX," Proc. 8th Int'l Conf. Computer Comm., pp. 294-299, 1986.
[25] A. Orda and R. Rom,"Routing with packet duplication and elimination in computer networks," IEEE Trans. Comm., vol. 36, no. 7, pp. 860-866, July 1988.
[26] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[27] J.L. Peterson and A. Silberschatz,Operating System Concepts, Addison-Wesley, 1985
[28] K. Ramamritham, “Allocation and Scheduling of Complex Periodic Tasks,” Proc. 10th IEEE Int'l Conf. Distributed Computing Systems, 1990.
[29] K. Ramamritham, J. Stankovic, and P. Shiah, “Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, Apr. 1990.
[30] P. Ramanathan and K.G. Shin,"A multiple copy approach for delivering messages under deadline constraints," Proc. FTCS-21, pp. 300-307, 1991.
[31] I. Sasase and S. Mori,"Analysis of queueing systems with multiple servers under a threshold-type scheduling," IEEE GLOBECOM, pp. 1,450-1,454, 1989.
[32] J. Lehoczky and L. Sha, "Performance of Real-Time Bus Scheduling Algorithms," ACM Performance Evaluation Review, special issue, vol. 14, May 1986.
[33] J. Stankovic,K. Ramamritham, and S. Cheng,"Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems," IEEE Trans. Computers, vol. 34, no. 12, pp. 1,130-1,143, 1985.
[34] A. Tanenbaum, Computer Networks. Prentice Hall, 1988.
[35] Y.C. Tay,"A behavioral analysis of scheduling by earliest deadline," Technical Report No. 532, Dept. of Mathematics, National Univ. of Singapore, 1992.
[36] F. Wang,K. Ramamritham, and J. Stankovic,"Bounds on the performance of heuristic algorithm for multiprocessor scheduling of hard real-time tasks," IEEE Real-Time Systems Symp., pp. 136-145, 1992.

Index Terms:
Real-time systems, scheduling, dual servers, soft deadlines, distributed systems.
Benjamin Kao, Hector Garcia-Molina, "Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 56-68, Jan. 1996, doi:10.1109/71.481598
Usage of this product signifies your acceptance of the Terms of Use.