This Article 
 Bibliographic References 
 Add to: 
Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems
August 2002 (vol. 51 no. 8)
pp. 945-962

This paper presents two proactive resource allocation algorithms, called RBA* and OBA, for asynchronous real-time distributed systems. The algorithms consider an application model where timeliness requirements are expressed using Jensen's benefit functions and propose adaptation functions to describe anticipated application workload during future time intervals. Furthermore, the algorithms consider an adaptation model, where application processes are dynamically replicated for sharing workload increases and a switched real-time Ethernet network as the underlying system model. Given such models, the objective of the algorithms is to maximize aggregate application benefit and minimize aggregate missed deadline ratio. Since determining the optimal allocation is computationally intractable, the algorithms heuristically compute near-optimal resource allocations in polynomial-time. While RBA* analyzes process response times to determine resource allocation decisions, which is computationally expensive, OBA analyzes processor overloads to compute its decisions in a much faster way. RBA* incurs a quadratic amortized complexity in terms of process arrivals for its most computationally intensive component when DASA is used as the underlying scheduling algorithm, whereas OBA incurs a logarithmic amortized complexity for the corresponding component. Our benchmark-driven experimental studies reveal that RBA* produces a higher aggregate benefit and lower missed deadline ratio than OBA.

[1] IEEE Trans. Computers, special issue on asynchronous real-time distributed systems, vol. 51, no. 8, Aug. 2002.
[2] G. Koob, “Quorum,” Proc. Darpa ITO General PI Meeting, pp. A-59-A-87, Oct. 1996.
[3] E.D. Jensen, “Asynchronous Decentralized Real-Time Computer Systems,” Real-Time Computing, W.A. Halang and A.D. Stoyenko, eds., Proc. NATO Advanced Study Inst., Oct. 1992.
[4] T. Abdelzaher and K. Shin, "End-Host Architecture for QoS-Adaptive Communication," Proc. IEEE Real-Time Technology and Applications Symp., IEEE Press, Piscataway, N.J., June 1998, pp. 121-130.
[5] S. Brandt, G. Nutt, T. Berk, and J. Mankovich, “A Dynamic Quality of Service Middleware Agent for Mediating Application Resource Usage,” Proc. IEEE Real-Time Systems Symp., pp. 307-317, Dec. 1998.
[6] M. Humphrey, S. Brandt, G. Nutt, and T. Berk, “The DQM Architecture: Middleware for Application Centered QoS Resource Management,” Proc. IEEE Workshop Middleware for Distributed Real-Time Systems and Services, pp. 97-104, Dec. 1997.
[7] D. Hull, A. Shankar, K. Nahrstedt, and J.W.S. Liu, “An End-to-End QoS Model and Management Architecture,” Proc. IEEE Workshop Middleware for Distributed Real-Time Systems and Services, pp. 82-89, Dec. 1997.
[8] C. Lee, “On Quality of Service Management,” PhD thesis, Carnegie Mellon Univ., Aug. 1999.
[9] C. Lee, J. Lehoczky, R. Rajkumar, and D. Siewiorek, “On Quality of Service Optimization with Discrete QoS Options,” Proc. IEEE Real-Time Technology and Applications Symp., pp. 276-286, June 1999.
[10] B. Ravindran, Engineering Dynamic Real-Time Distributed Systems: Architecture, System Description Language, and Middleware IEEE Trans. Software Eng., vol. 28, no. 2, pp. 30-57, Jan. 2002.
[11] D.I. Rosu, K. Schwan, S. Yalamanchili, and R. Jha, “On Adaptive Resource Allocation for Complex Real-Time Applications,” Proc. 18th IEEE Real-Time Systems Symp., pp. 320–329, Dec. 1997.
[12] B. Ravindran, L.R. Welch, and B. Shirazi, “Resource Management Middleware for Dynamic, Dependable Real-Time Systems,” J. Real-Time Systems, vol. 20, no. 2, pp. 183-196, Mar. 2001.
[13] T. Hegazy, “Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems,” MS thesis, Virginia Tech, Sept. 2001.
[14] B. Ravindran and T. Hegazy, “RBA: A Best Effort Resource Allocation Algorithm for Asynchronous, Real-Time Distributed Systems,” J. Research and Practice in Information Technology, vol. 33, no. 3, pp. 213-227, Aug. 2001.
[15] R.K. Clark, “Scheduling Dependent Real-Time Activities,” PhD thesis, Carnegie Mellon Univ., CMU-CS-90-155, 1990.
[16] L.R. Welch, B. Ravindran, B. Shirazi, and C. Bruggeman, “Specification and Modeling of Dynamic, Distributed Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., pp. 72-81, Dec. 1998.
[17] US Naval Surface Warfare Center, “High Performance Distributed Computing,” / FAPS. / FA. , 1997.
[18] R. Clark, E.D. Jensen, A. Kanevsky, J. Maurer, P. Wallace, T. Wheeler, Y. Zhang, D. Wells, T. Lawrence, and P. Hurley, “An Adaptive, Distributed Airborne Tracking System,” Proc. Seventh IEEE Int'l Workshop Parallel and Distributed Real-Time Systems, pp. 353-362, Apr. 1999.
[19] T. Abdelzaher, An Automated Profiling Subsystem for QoS-Aware Services Proc. IEEE EEE Real-Time Technology and Applications Symp. (RTAS), pp. 208-217, 2000.
[20] R. Devarasetty, “Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems,” MS thesis, Virginia Tech, Feb. 2001.
[21] D.L. Mills, Improved Algorithms for Synchronizing Computer Network Clocks IEEE/ACM Trans. Networking, vol. 3, pp. 245-254, June 1995.
[22] C. D. Locke, "Best-Effort Decision Making for Real-Time Scheduling," PhD thesis, Computer Science Dept., Carnegie Mellon Univ., 1986.
[23] G. Buttazzo and J. Stankovic, “Adding Robustness in Ddynamic Preemptive Scheduling,” Responsive Computer Systems: Steps toward Fault-Tolerant Real-Time Systems, D. Fussel and M. Malek, eds., pp. 67-88, Kluwer Academic, Oct. 1995.
[24] G. Buttazzo, Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, pp. 102-103. Boston: Kluwer Academic, 1997.
[25] 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.
[26] B. Kao and H. Garcia-Molina, “Deadline Assignment in a Distributed Soft Real-Time System,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1268-1274, Dec. 1997.
[27] N.C. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, "Applying New Scheduling Theory to Static Priority Preemptive Scheduling," Software Eng. J. vol. 8, no. 5, pp. 284-292, Sept. 1993.
[28] L.R. Welch and B.A. Shirazi, “A Dynamic Real-Time Benchmark for Assessment of QoS and Resource Management Technology,” Proc. Fifth IEEE Real-Time Technology and Applications Symp., June 1999.
[29] DARPA IPTO, “Quorum,” projlist.html, 2002.

Index Terms:
Asynchronous real-time distributed systems, distributed real-time systems, proactive resource allocation, adaptive resource allocation, best-effort resource allocation, best-effort real-time scheduling, benefit functions, switched real-time Ethernet.
Tamir Hegazy, Binoy Ravindran, "Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems," IEEE Transactions on Computers, vol. 51, no. 8, pp. 945-962, Aug. 2002, doi:10.1109/TC.2002.1024741
Usage of this product signifies your acceptance of the Terms of Use.