This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Time/Utility Function Decomposition Techniques for Utility Accrual Scheduling Algorithms in Real-Time Distributed Systems
September 2005 (vol. 54 no. 9)
pp. 1138-1153
We consider Real-Time CORBA 1.2's distributable threads (DTs), whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resources—both physical and logical—are shared among time-critical DTs and local applications that may also be time-critical. Hence, DTs that are scheduled using their propagated TUFs, as mandated by Real-Time CORBA 1.2's Case 2 approach, may suffer performance degradation, if a node utility accrual (UA) scheduler achieves higher locally accrued utility by giving higher eligibility to local threads than to DTs. To alleviate this, we consider decomposing TUFs of DTs into "sub-TUFs” for scheduling segments of DTs. We present five decomposition techniques, called UT, SCEQF, SCALL, OPTCON, and TUFS, which are specific to different classes of UA scheduling algorithms, such as those that use utility density and those that use deadline as their key decision metric. Our experimental studies identify the decomposition technique that performs best for each class of UA scheduling algorithms. In particular, our studies show that OPTCON and TUFS perform best for utility density-based UA algorithms, while SCEQF and SCALL perform best for deadline-based UA algorithms.

[1] OMG, “Real-Time CORBA 2.0: Dynamic Scheduling Specification,” Object Management Group, technical report, Sept. 2001, OMG Final Adopted Specification, http://www.omg.org/docs/ptc01-08-34.pdf, Oct. 2004.
[2] E.D. Jensen, A. Wellings, R. Clark, and D. Wells, “The Distributed Real-Time Specification for Java: A Status Report,” Proc. Embedded Systems Conf., 2002.
[3] J.D. Northcutt, Mechanisms for Reliable Distributed Real-Time Operating Systems: The Alpha Kernel. Academic Press, 1987.
[4] E.D. Jensen and J.D. Northcutt, “Alpha: A Non-Proprietary Operating System for Large, Complex, Distributed Real-Time Systems,” Proc. IEEE Workshop Experimental Distributed Systems, pp. 35-41, 1990.
[5] The Open Group, “MK7.3a Release Notes,” http://www.real-time.org/docsRelNotes7.Book.pdf , 1998.
[6] GlobalSecurity.org, “Multi-Platform Radar Technology Insertion Program,” http://www.globalsecurity.org/intell/systems mp-rtip.htm/, Oct. 2004.
[7] GlobalSecurity.org, “BMC3I Battle Management, Command, Control, Communications and Intelligence,” http://www.global security.org/space/systems bmc3i.htm/, Oct. 2004.
[8] E.D. Jensen, C.D. Locke, and H. Tokuda, “A Time-Driven Scheduling Model for Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., pp. 112-122, Dec. 1985.
[9] 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. IEEE Workshop Parallel and Distributed Systems, pp. 353-362, Apr. 1999.
[10] D.P. Maynard, S.E. Shipman, R.K. Clark, J.D. Northcutt, R.B. Kegley, B.A. Zimmerman, and P.J. Keleher, “An Example Real-Time Command, Control, and Battle Management Application for Alpha,” Archons Project TR-88121, Dept. of Computer Science, Carnegie Mellon Univ., Dec. 1988, http:/www.real-time.org, Oct. 2004.
[11] P. Li, “Utility Accrual Real-Time Scheduling: Models and Algorithms,” PhD dissertation, Virginia Tech, 2004, http://scholar.lib.vt.edu/theses/available etd-08092004-230138/, Oct. 2004.
[12] C.D. Locke, “Best-Effort Decision Making for Real-Time Scheduling,” PhD dissertation, Carnegie Mellon Univ., 1986, CMU-CS-86-134, http:/www.real-time.org, Oct. 2004.
[13] R.K. Clark, “Scheduling Dependent Real-Time Activities,” PhD dissertation, Carnegie Mellon Univ., 1990, CMU-CS-90-155, http:/www.real-time.org, Oct. 2004.
[14] 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.
[15] K. Chen and P. Muhlethaler, “A Scheduling Algorithm for Tasks Described by Time Value Function,” J. Real-Time Systems, vol. 10, no. 3, pp. 293-312, May 1996.
[16] D. Mosse, M.E. Pollack, and Y. Ronen, “Value-Density Algorithm to Handle Transient Overloads in Scheduling,” Proc. IEEE Euromicro Conf. Real-Time Systems, pp. 278-286, June 1999.
[17] J. Wang and B. Ravindran, “Time-Utility Function-Driven Switched Ethernet: Packet Scheduling Algorithm, Implementation, and Feasibility Analysis,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 2, pp. 119-133, Feb. 2004.
[18] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1175-1185, Sept. 1990.
[19] W. Horn, “Some Simple Scheduling Algorithms,” Naval Research Logistics Quarterly, vol. 21, pp. 177-185, 1974.
[20] 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, 1973.
[21] 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.
[22] A. Varga, “OMNeT++ Discrete Event Simulation System,” http:/www.omnetpp.org/, Oct. 2004.
[23] OMG, “Real-Time CORBA Joint Revised Submission,” Object Management Group, Technical Report OMG TC Document ptc/99-05-03, May 1998, http://www.omg.org/docs/ptc99-05-03. pdf , Oct. 2004.
[24] R. Bettati and J.W.S. Liu, “Algorithms for End-to-End Scheduling to Meet Deadlines,” Proc. IEEE Symp. Parallel and Distributed Processing, pp. 62-67, 1990.
[25] R. Bettati and J.W.S. Liu, “End-to-End Scheduling to Meet Deadlines in Distributed Systems,” Proc. IEEE Real-Time Systems Symp., pp. 452-459, 1992.
[26] B.C. Kao, “Scheduling in Distributed Soft Real-Time Systems with Autonomous Components,” PhD dissertation, Princeton Univ., Nov. 1995.
[27] M.D. Natale and J.A. Stankovic, “Dynamic End-to-End Guarantees in Distributed Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., 1994.
[28] J.J.G. Garcia and M.G. Harbour, “Optimized Priority Assignment for Tasks and Messages in Distributed Hard Real-Time Systems,” Proc. IEEE Workshop Parallel and Distributed Real-Time Systems, pp. 124-132, 1995.
[29] M. Saksena and S. Hong, “An Engineering Approach to Decomposing End-to-End Delays on a Distributed Real-Time System,” Proc. IEEE Workshop Parallel and Distributed Real-Time Systems, pp. 244-251, 1996.
[30] M. Saksena and S. Hong, “Resource Conscious Design of Distributed Real-Time Systems: An End-to-End Approach,” Proc. IEEE Int'l Conf. Eng. of Complex Computer Systems, pp. 306-313, 1996.
[31] J. Jonsson and K.G. Shin, “Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems,” Real-Time Systems, vol. 23, no. 3, pp. 239-271, Nov. 2002.

Index Terms:
Index Terms- Distributable thread, time/utility function, value function, time constraint decomposition, Real-Time CORBA 1.2.
Citation:
Haisang Wu, Binoy Ravindran, E. Douglas Jensen, Peng Li, "Time/Utility Function Decomposition Techniques for Utility Accrual Scheduling Algorithms in Real-Time Distributed Systems," IEEE Transactions on Computers, vol. 54, no. 9, pp. 1138-1153, Sept. 2005, doi:10.1109/TC.2005.153
Usage of this product signifies your acceptance of the Terms of Use.