The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2010 vol.21)
pp: 1822-1835
Mehdi Kargahi , University of Tehran, Tehran
ABSTRACT
One of the main properties of today's distributed and parallel systems, such as mobile ad-hoc networks and grids, is their heterogeneity in the available resources. Further, many applications of such systems are subject to Time/Utility Function (TUF) time constraints for jobs, unavoidable variability in job characteristics and arrivals, and statistical assurance requirements on timeliness behaviors. In this paper, we propose an exact analytical solution for performance evaluation of dynamic policies used for routing of TUF-constrained Firm Real-Time (FRT) jobs among parallel single-processor queues with arbitrary processing rates and capacities. The analytical method can be used for the evaluation of the compliance of some important statistical assurance requirements. Furthermore, we present a utility-aware dynamic routing policy to improve the expected accrued utility of the parallel system. The policy called Maximum Expected Utility (MEU) behaves based on the information gathered from the analytical solution. MEU is compared with some well-known Dynamic Routing (DR) policies for different TUF shapes and both cases of homogeneous and heterogeneous processors of a two-queue system. The comparisons show the efficiency of MEU for the former case and its good behavior in most situations for the latter case.
INDEX TERMS
Analytical modeling, firm real-time systems, performance modeling, time/utility function, utility accrual dynamic routing.
CITATION
Mehdi Kargahi, "Utility Accrual Dynamic Routing in Real-Time Parallel Systems", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 12, pp. 1822-1835, December 2010, doi:10.1109/TPDS.2010.50
REFERENCES
[1] G. Bernat, A. Burns, and A. Llamosi, "Weakly Hard Real-Time Systems," IEEE Trans. Computers, vol. 50, no. 4, pp. 308-321, Apr. 2001.
[2] K. Channakeshava, K. Phanse, L.A. DaSilva, B. Ravindran, S.F. Midkiff, and E.D. Jensen, "IP Quality of Service Support for Soft Real-Time Applications," Proc. Fourth Int'l Workshop Real-Time Networks (RTN), IEEE Euromicro Conf. Real-Time Systems, pp. 1-4, 2005.
[3] K. Channakeshava, B. Ravindran, and E.D. Jensen, "Utility Accrual Channel Establishment in Multihop Networks," IEEE Trans. Computers, vol. 55, no. 4, pp. 428-442, Apr. 2006.
[4] 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, 1996.
[5] H. Cho, B. Ravindran, and E.D. Jensen, "An Optimal Real-Time Scheduling Algorithm for Multiprocessors," Proc. IEEE Real-Time Systems Symp., pp. 101-110, 2006.
[6] H. Cho, H. Wu, B. Ravindran, and E.D. Jensen, "On Multiprocessor Utility Accrual Real-Time Scheduling with Statistical Timing Assurances," Proc. Int'l Conf. Embedded and Ubiquitous Computing, pp. 274-286, 2006.
[7] R.K. Clark, "Scheduling Dependent Real-Time Activities," PhD dissertation, Dept. of Computer Eng., Carnegie Mellon Univ., 1990.
[8] S. Dhakal, M.M. Hayat, J.E. Pezoa, C. Yang, and D.A. Bader, "Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 4, pp. 485-497, Apr. 2007.
[9] K. Han, B. Ravindran, and E.D. Jensen, "Probabilistic, Real-Time Scheduling of Distributable Threads under Dependencies in Mobile, Ad-Hoc Networks," Proc. IEEE Wireless Comm. and Networking Conf., pp. 4307-4312, 2007.
[10] A. Hordijk and G. Kook, "On the Optimality of the Generalized Shortest Queue Policy," J. Probability in the Eng. and Informational Sciences, vol. 4, pp. 477-487, 1990.
[11] J. Huang, X. Du, Z. Yang, and W. Cheng, "Available Bandwidth-Based Real-Time Multicast Routing Distributed Algorithm," Proc. Int'l Conf. Computer Networks and Mobile Computing, pp. 54-60, 2003.
[12] 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, 1985.
[13] 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, 1992.
[14] P. Li, "Utility Accrual Real-Time Scheduling: Models and Algorithms," PhD dissertation, Virginia Polytechnic Inst. and State Univ., Blacksburg, 2004.
[15] P. Li, H. Cho, B. Ravindran, and E.D. Jensen, "Stochastic, Utility Accrual Real-Time Scheduling with Task-Level and System-Level Timeliness Assurances," Proc. Eighth IEEE Int'l Symp. Object-Oriented Real-Time Distributed Computing, pp. 216-223, 2005.
[16] H.C. Lin and C.S. Raghavendra, "An Approximation Analysis of the Join the Shortest Queue (JSQ) Policy," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 301-307, Mar. 1996.
[17] 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.
[18] C.D. Locke, "Best-Effort Decision Making for Real-Time Scheduling," PhD dissertation, Dept. of Computer Eng., Carnegie Mellon Univ., 1986.
[19] J.C.S. Lui, R.R. Muntz, and D. Towsley, "Bounding the Mean Response Time of a Minimum Expected Delay Routing System: An Algorithmic Approach," IEEE Trans. Computers, vol. 44, no. 12, pp. 1371-1382, Dec. 1995.
[20] B. Melamed and D.D. Yao, "The ASTA Property," Frontiers in Queuing: Models, Methods and Problems, J. Dshalalow, ed., invited chapter, CRC Press, 1995.
[21] A. Movaghar, "Optimal Assignment of Impatient Customers to Parallel Queues with Blocking," Scientia Iranica, vol. 3, pp. 137-146, 1997.
[22] A. Movaghar, "On Dynamic Assignment of Impatient Customers to Parallel Queues," Proc. IEEE Int'l Conf. Dependable Systems and Networks, pp. 751-759, 2003.
[23] A. Movaghar, "Optimal Control of Parallel Queues with Impatient Customers," Performance Evaluation, vol. 60, nos. 1-4, pp. 327-343, 2005.
[24] A. Movaghar, "On Queueing with Customer Impatience Until the End of Service," J. Stochastic Models, vol. 22, pp. 149-173, 2006.
[25] R.D. Nelson and T.K. Philips, "An Approximation to the Response Time for Shortest Queue Routing," ACM SIGMETRICS Performance Evaluation Rev., vol. 17, no. 1, pp. 181-189, 1989.
[26] R.D. Nelson and T.K. Philips, "An Approximation for the Mean Response Time for Shortest Queue Routing with General Interarrival and Service Times," Performance Evaluation, vol. 17, pp. 123-139, 1993.
[27] B. Ravindran, E.D. Jensen, and P. Li, "On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management," Proc. Eighth IEEE Int'l Symp. Object-Oriented Real-Time Distributed Computing, pp. 55-60, 2005.
[28] E. Seo, J. Jeong, S. Park, and J. Lee, "Energy Efficient Scheduling of Real-Time Tasks on Multicore Processors," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 11, pp. 1540-1552, Nov. 2008.
[29] R. Shah, B. Veeravalli, and M. Misra, "On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 12, pp. 1675-1686, Dec. 2007.
[30] 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.
[31] W. Winston, "Optimality of the Shortest Line Discipline," J. Applied Probability, vol. 14, pp. 181-189, 1977.
[32] H. Wu, "Energy-Efficient, Utility Accrual Real-Time Scheduling," PhD dissertation, Virginia Polytechnic Inst. and State Univ., 2005.
[33] H. Wu, B. Ravindran, and E.D. Jensen, "Utility Accrual Scheduling under Joint Utility and Resource Constraints," Proc. IEEE Int'l Symp. Object-Oriented Real-Time Distributed Computing, pp. 307-314, 2004.
[34] H. Wu, B. Ravindran, E.D. Jensen, and U. Balli, "Utility Accrual Scheduling under Arbitrary Time/Utility Functions and Multiunit Resource Constraints," Proc. IEEE Int'l Conf. Real-Time Computing Systems and Applications, pp. 80-98, 2004.
[35] H. Wu, B. Ravindran, and E.D. Jensen, "Utility Accrual Real-Time Scheduling under the Unimodal Arbitrary Arrival Model with Energy Bounds," IEEE Trans. Computers, vol. 56, no. 10, pp. 1358-1371, Oct. 2007.
[36] H. Wu, B. Ravindran, E.D. Jensen, and P. Li, "CPU Scheduling for Statistically-Assured Real-Time Performance and Improved Energy Efficiency," Proc. Second IEEE/ACM/IFIP Int'l Conf. Hardware/Software Codesign and System Synthesis, pp. 110-115, 2004.
[37] H. Wu, B. Ravindran, E.D. Jensen, and P. Li, "Time/Utility Function Decomposition Techniques for Utility Accrual Scheduling Algorithms in Real-Time Distributed Systems," IEEE Trans. Computers, vol. 54, no. 9, pp. 1138-1153, Sept. 2005.
[38] T. Xie and X. Qin, "Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 5, pp. 682-697, May 2008.
[39] Q. Zhang, A. Riska, W. Sun, E. Smirni, and G. Ciardo, "Workload-Aware Load Balancing for Clustered Web Servers," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 3, pp. 219-233, Mar. 2005.
[40] W. Zhu, "An Approximate Analysis of the Shortest Queue Policy on Soft Real-Time Scheduling," ACM SIGMETRICS Performance Evaluation Rev., vol. 28, no. 3, pp. 3-10, 2000.
181 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool