This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
November 2000 (vol. 49 no. 11)
pp. 1170-1183

Abstract—Real-time middleware services must guarantee predictable performance under specified load and failure conditions, and ensure graceful degradation when these conditions are violated. Guaranteed predictable performance typically entails reservation of resources and use of admission control. Graceful degradation, on the other hand, requires dynamic reallocation of resources to maximize the application-perceived system utility while coping with unanticipated overload and failures. We propose a model for quality-of-service (QoS) negotiation in building real-time services to meet both of the above requirements. QoS negotiation is shown to 1) outperform “binary” admission control schemes (either guaranteeing the required QoS or rejecting the service request), 2) achieve higher application-perceived system utility, and 3) deal with violations of the load and failure hypotheses. We incorporated the proposed QoS-negotiation model into an example real-time middleware service, called RTPOOL, which manages a distributed pool of shared computing resources (processors) to guarantee timeliness QoS for real-time applications. In order to guarantee timeliness QoS, the resource pool is encapsulated with its own schedulability analysis, admission control, and load-sharing support. This support differs from others in that it adheres to the proposed QoS-negotiation model. The efficacy and power of QoS negotiation are demonstrated for an automated flight control system implemented on a network of PCs running RTPOOL. This system is used to fly an F-16 fighter aircraft modeled using the Aerial Combat (ACM) F-16 Flight Simulator. Experimental results indicate that QoS negotiation, while maintaining real-time guarantees, enables graceful QoS degradation under conditions in which traditional schedulability analysis and admission control schemes fail.

[1] D.J. Musliner, E.H. Durfee, and K.G. Shin, “World Modeling for the Dynamic Construction of Real-Time Control Plans,” AI J., pp. 83-127, 1995.
[2] E.M. Atkins, E.H. Durfee, and K.G. Shin, “Plan Development in Circa Using Local Probabilistic Models,” Uncertainty in Artificial Intelligence: Proc. 12th Conf., pp. 49-56, Aug. 1996.
[3] J. Xu and D.L. Parnas, “Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations,” IEEE Trans. Software Eng., vol. 16, no. 3, pp. 360-369, Mar. 1990.
[4] J. Xu, “Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations,” IEEE Trans. Software Eng., vol. 19, no. 2, pp. 139-154, Feb. 1993.
[5] T. Shepard and M. Gagne, “A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems,” IEEE Trans. Software Eng., vol. 17, no. 7, pp. 669-677, July 1991.
[6] T.F. Abdelzaher and K.G. Shin, “Optimal Combined Task and Message Scheduling in Distributed Real-Time Systems,” Proc. Real-Time Systems Symp., vol. 16, Dec. 1995.
[7] M. Alfano, A. Di-Stefano, L. Lo-Bello, O. Mirabella, and J.H. Stewman, “An Expert System for Planning Real-Time Distributed Task Allocation,” Proc. Florida AI Research Symp., May 1996.
[8] P. Altenbernd, C. Ditze, P. Laplante, and W. Halang, “Allocation of Periodic Real-Time Tasks,” Proc. 20th IFAC/IFIP Workshop, Nov. 1995.
[9] J.L. Lanet, “Task Allocation in a Hard Real-Time Distributed System,” Proc. Second Conf. Real-Time Systems, pp. 244-252, Sept. 1995.
[10] T.C. Lueth and T. Laengle, “Task Description, Decomposition and Allocation in a Distributed Autonomous Multi-Agent Robot System,” Proc. Int'l Conf. Intelligent Robots and Systems, pp. 1,516-1,523, Sept. 1994.
[11] C.M. Hopper and Y. Pan, “Task Allocation in Distributed Computer Systems through an AI Planner Solver,” Proc. IEEE 1995 Nat'l Aerospace and Electronics Conf., vol. 2, pp. 610-616, May 1995.
[12] B.R. Tsai and K.G. Shin, “Assignment of Task Modules in Hypercube Multicomputers with Component Failures for Communication Efficiency,” IEEE Trans. Computers, vol. 43, no. 5, pp. 613-618, May 1994.
[13] K.G. Shin and C.J. Hou, “Evaluation of Load Sharing in Harts with Consideration of Its Communication Activities,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 7, pp. 724-739, July 1996.
[14] S.M. Yoo and H.Y. Youn, “An Efficient Task Allocation Scheme for Two Dimensional Mesh-Connected Systems,” Proc. 15th Int'l Conf. Distributed Computing Systems, pp. 501-508, 1995.
[15] S. Kirkpatrick, C. Gelatt, and M. Vecchi, “Optimization by Simulated Annealing,” Science, vol. 220, pp. 671-680, 1983.
[16] K. Tindell, A. Burns, and A. Wellings, “Allocating Hard Real-Time Tasks: An NP-Hard Problem Made Easy,” J. Real-Time Systems, vol. 4, no. 2, pp. 145-166, May 1992.
[17] E. Wells and C.C. Caroll, “An Augmented Approach to Task Allocation: Combining Simulated Annealing with List-Based Heuristics,” Proc. Euromicro Workshop, pp. 508-515, 1993.
[18] J.E. Beck and D.P. Siewiorek, “Simulated Annealing Applied to Multicomputer Task Allocation and Processor Specification,” Proc. Eighth IEEE Symp. Parallel and Distributed Processing, pp. 232-239, Oct. 1996.
[19] S.T. Cheng, S.I. Hwang, and A.K. Agrawala, “Schedulability Oriented Replication of Periodic Tasks in Distributed Real-Time Systems,” Proc. 15th Int'l Conf. Distributed Computing Systems, 1995.
[20] T.-S. Tia and J.W.-S. Liu, “Assigning Real-Time Tasks and Resources to Distributed Systems,” Int'l J. Minim and Microcomputers, vol. 17, no. 1, pp. 18-25, 1995.
[21] S.S. Wu and D. Sweeping, “Heuristic Algorithms for Task Assignment and Scheduling in a Processor Network,” Parallel Computing, vol. 20, pp. 1-14, 1994.
[22] K. Ramamritham, “Allocation and Scheduling of Precedence-Related Periodic Tasks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 4, pp. 412-420, Apr. 1995.
[23] A. Banerjea, D. Ferrari, B. Mah, M. Moran, D. Verma, and H. Zhang, “The Tenet Real-Time Protocol Suite: Design, Implementation, and Experiences,” IEEE/ACM Trans. Networking, vol. 4, no. 1, pp. 1-10, Feb. 1996.
[24] D.D. Kandlur, K.G. Shin, and D. Ferrari, “Real-Time Communication in Multi-Hop Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 10, pp. 1,044-1,056, Oct. 1994.
[25] A. Cambell, G. Coulson, and D. Hutchison, “A Quality of Service Architecture,” ACM Computer Comm. Review, Apr. 1994.
[26] C. Volg, L. Wolf, R. Herrwich, and H. Wittig, “HeiRAT—Quality of Service Management for Distibuted Multimedia Systems,” Multimedia Systems J., 1996.
[27] A. Lazar, S. Bhonsle, and K. Lim, “A Binding Architecture for Multimedia Networks,” J. Parallel and Distributed Computing, vol. 30, pp. 204-216, Nov. 1995.
[28] K. Nahrstedt and J. Smith, “Design, Implementation, and Experiences with the OMEGA end-Point Architecture,” IEEE J. Selected Areas in Comm., Sept. 1996.
[29] K. Nahrstedt and J. Smith, “The QoS Broker,” IEEE Multimedia, vol. 2, no. 1, pp. 53-67, 1995.
[30] C. Aurrecoechea, A. Cambell, and L. Hauw, “A Survey of QoS Architectures,” Proc. Fourth IFIP Int'l Conf. Quality of Service, Mar. 1996.
[31] C. Mercer, S. Savage, and H. Tokuda, “Processor Capacity Reserves: Operating System Support for Multimedia Applications,” Proc. IEEE Int'l Conf. Multimedia Computing and Systems, May 1994.
[32] C. Lee, R. Rajkumar, and C. Mercer, “Experiences with Processor Reservation and Dynamic QoS in Real-Time Mach,” Proc. Multimedia, Mar. 1996.
[33] M. Jones, D. Rosu, and M.-C. Rosu, “CPUReservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities,” Proc. 16th ACM Symp. Operating Systems Principles, Oct. 1997.
[34] C. Waldspurger, “Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management,” PhD thesis, Massachusetts Inst. of Tech nology, Sept. 1995.
[35] P. Goyal, X. Guo, and H. Vin, “A Hierarchical CPU Scheduler for Multimedia Operating Systems,” Proc. Second Usenix Symp. Operating System Design and Implementation, Oct. 1996.
[36] J.A. Stankovic and K. Ramamritham, “The Spring Kernel: A New Paradigm for Real-Time Systems,” IEEE Software, pp. 62-72, May 1991.
[37] S. Sommer and J. Potter, “Operating System Extensions for Dynamic Real-Time Applications,” Proc. IEEE Real-Time Systems Symp., pp. 45-50, Dec. 1996.
[38] M.B. Jones and P.J. Leach, “Modular Real-Time Resource Management in the Rialto Operating System,” Technical Report MSR-TR-95-16, Microsoft Research, Advanced Technology Division, May 1995.
[39] I. Leslie, D. McAuley, R. Black, T. Roscoe, P. Barham, D. Evers, R. Fairbairns, and E. Hyden, “The Design and Implementation of an Operating System to Support Distributed Multimedia Applications,” IEEE J. Selected Areas in Comm., June 1997.
[40] R. Clark, E. Jensen, and F. Reynolds, “An Architectural Overview of the Alpha Real-Time Distributed Kernel,” Proc. USENIX Workshop Microkernels and Other Kernel Architectures, 1992.
[41] H. Tokuda, T. Nakajima, and P. Rao, “Real-Time Mach: Towards a Predictable Real-Time System,” Proc. USENIX Mach Workshop, pp. 73-82, Oct. 1990.
[42] G. Koren and D. Shasha, “D-Over: An Optimal On-Line Scheduling Algorithm for Overloaded Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., pp. 290-299, Dec. 1992.
[43] S.K. Baruah, J. Haritsa, and N. Sharma, “On-Line Scheduling to Maximize Task Completions,” Proc. IEEE Real-Time Systems Symp., pp. 228-236, Dec. 1994.
[44] W. Zhao and K. Ramamritham, “Virtual Time CSMA Protocols for Hard Real-Time Communication,” IEEE Trans. Software Eng., vol. 13, no. 8, pp. 938-952, 1987.
[45] J.W.S. Liu, W. Shih, K.J. Lin, R. Bettati, and J. Chung, “Imprecise Computations,” IEEE Proc., Jan. 1994.
[46] P. Ramanathan, “Graceful Degradation in Real-Time Control Applications Using (m, k)-Firm Guarantee,” Proc. IEEE 27th Int'l Symp. Fault-Tolerant Computing, June 1997.
[47] M. Bizzarri, P. Bizzarri, A. Bondavalli, F. Di-Giandomenico, F. Tarini, P. Laplante, and W. Halang, “Design of Flexible and Dependable Real-Time Applications,” Proc. 20th IFAC/IFIP Workshop, Nov. 1995.
[48] R. Davis, S. Punnekkat, N. Audsley, and A. Burns, “Flexible Scheduling for Adaptable Real-Time Systems,” Proc. Real-Time Technology and Applications Symp., pp. 230-239, May 1995.
[49] C. Mercer, S. Savage, and H. Tokuda, “Processor Capacity Reserves: Operating System Support for Multimedia Applications,” Proc. IEEE Int'l Conf. Multimedia Computing and Systems, May 1994.
[50] D. Seto, J.P. Lehoczky, L. Sha, and K.G. Shin, “On Task Schedulability in Real-Time Control Systems,” Proc. IEEE Real-Time Systems Symp., pp. 13-21, Dec. 1996.
[51] T. Abdelzaher, A. Shaikh, F. Jahanian, and K. Shin, “RTCAST: Lightweight Multicast for Real-Time Process Groups,” Proc. IEEE Real-Time Technology and Applications Symp., June 1996.
[52] N.C. Hutchinson and L.L. Peterson, “The x-Kernel: An Architecture for Implementing Network Protocols,” IEEE Trans. Software Eng., vol. 17, no. 1, pp. 64-76, Jan. 1991.
[53] A. Mehra, A. Indiresan, and K.G. Shin, “Structuring Communication for Quality of Service Guarantees,” Proc. IEEE Real-Time Systems Symp., pp. 144-154, Dec. 1996.
[54] S. Liden, “The Evolution of Flight Management Systems,” Proc. 1994 IEEE/AIAA 13th Digital Avionics Systems Conf., pp. 157-169, 1995.
[55] J. Schreur, “B737 Flight Management Computer Flight Plan Trajectory Computation and Analysis,” Proc. Am. Control Conf., pp. 3,419-3,429, June 1995.
[56] E.M. Atkins, “Reasoning about and in Time when Building Plans for Safe, Fully-Automated Aircraft Flight,” PhD thesis proposal, Dec. 1996.
[57] E.M. Atkins, E.H. Durfee, and K.G. Shin, “Buying Time for Resource-Bounded Planning,” Proc. AAAI-97 Workshop: Building Resource-Bounded Reasoning Systems Technical Report, pp. 7-11, July 1997.
[58] R. Rainey, ACM: The Aerial Combat Simulation for X11, Feb. 1994.

Index Terms:
Quality-of-service (QoS), QoS negotiation, QoS levels and rewards, schedulability analysis and admission control, automated flight systems.
Citation:
Tarek F. Abdelzaher, Ella M. Atkins, Kang G. Shin, "QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control," IEEE Transactions on Computers, vol. 49, no. 11, pp. 1170-1183, Nov. 2000, doi:10.1109/12.895935
Usage of this product signifies your acceptance of the Terms of Use.