The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2008 vol.57)
pp: 188-199
Xiao Qin , IEEE
Tao Xie , IEEE
ABSTRACT
<p><b>Abstract</b>—High availability is a key requirement in the design and development of heterogeneous systems, where processors operate at different speeds and are not continuously available for computation. Most existing scheduling algorithms designed for heterogeneous systems do not factor in availability requirements imposed by multiclass applications. To remedy this shortcoming, we investigate in this paper the scheduling problem for multiclass applications running in heterogeneous systems with availability constraints. In an effort to explore this issue, we model each node in a heterogeneous system using the node?s computing capability and availability. Multiple classes of tasks are characterized by their execution times and availability requirements. To incorporate availability and heterogeneity into scheduling, we define new metrics to quantify system availability and heterogeneity for multi-class tasks. We then propose a scheduling algorithm to improve availability of heterogeneous systems while maintaining good performance in response time of tasks. Experimental results show that our algorithm achieves a good trade-off between availability and responsiveness.</p>
INDEX TERMS
Availability constraints, heterogeneous systems, multiclass applications, scheduling, resource allocation
CITATION
Xiao Qin, Tao Xie, "An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems", IEEE Transactions on Computers, vol.57, no. 2, pp. 188-199, February 2008, doi:10.1109/TC.2007.70738
REFERENCES
[1] I. Adiri, J. Bruno, E. Frostig, and A.H.G. Rinnooy Kan, “Single Machine Flow-Time Scheduling with a Single Breakdown,” Acta Informatica, vol. 26, pp. 679-696, 1989.
[2] A. Apon and L. Wilbur, “AmpNet—A Highly Available Cluster Interconnection Network,” Proc. IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '03), Apr. 2003.
[3] F. Bonomi and A. Kumar, “Adaptive Optimal Load Balancing in a Nonhomogeneous Multiserver System with a Central Job Scheduler,” IEEE Trans. Computers, vol. 39, no. 10, pp. 199-234, Oct. 1990.
[4] S.C. Borst, “Optimal Probabilistic Allocation of Customer Types to Servers,” Proc. ACM Conf. Measurement and Modeling Computer Systems (SIGMETRICS '95), pp. 116-125, 1995.
[5] T.D. Braun et al., “A Comparison Study of Static Mapping Heuristics for a Class of Meta-Tasks on Heterogeneous Computing Systems,” Proc. Eighth Heterogeneous Computing Workshop (HCW '99), pp. 15-29, Apr. 1999.
[6] T.L. Casavant and J.G. Kuhl, “A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems,” IEEE Trans. Software Eng., vol. 14, no. 2, pp. 141-154, Feb. 1988.
[7] M.E. Crovella, M. Harchol-Balter, and C. Murta, “Task Assignment in Distributed Systems: Improving Performance by Unbalancing Load,” Proc. ACM Conf. Measurement and Modeling Computer Systems (SIGMETRICS '98), pp. 268-269, 1998.
[8] A. Dogan and F. Özgüner, “Reliable Matching and Scheduling of Precedence-Constrained Tasks in Heterogeneous Distributed Computing,” Proc. 29th Int'l Conf. Parallel Processing (ICPP '00), pp. 307-314, 2000.
[9] A. Dogan and F. Özgüner, “LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems,” Proc. 31st Int'l Conf. Parallel Processing (ICPP '02), pp. 352-359, 2002.
[10] G. Hunt, G. Goldszmidt, R. King, and R. Mukherjee, “Network Dispatcher: A Connection Router for Scalable Internet Services,” Proc. Seventh Int'l World Wide Web Conf. (WWW '98), Apr. 1998.
[11] Y. Jiang, C.-K. Tham, and C.-C. Ko, “An Approximation for Waiting Time Tail Probabilities in Multiclass Systems,” IEEE Comm. Letters, vol. 5, no. 4, pp. 175-177, 2001.
[12] A.M. Johnson and M. Malek, “Survey of Software Tools for Evaluating Reliability, Availability, and Serviceability,” ACM Computing Surveys, vol. 20, no. 4, pp. 227-269, Dec. 1988.
[13] I. Kacem, C. Sadfi, and A. El-Kamel, “Branch and Bound and Dynamic Programming to Minimize the Total Completion Times on a Single Machine with Availability Constraints,” Proc. IEEE Int'l Conf. Systems, Man, and Cybernetics (SMC '05), vol. 2, pp. 1657-1662, Oct. 2005.
[14] H.C. Lau and C. Zhang, “Job Scheduling with Unfixed Availability Constraints,” Proc. 35th Ann. Meeting Decision Sciences Inst. (DSI '04), pp. 4401-4406, Nov. 2004.
[15] C.-Y. Lee, “Two-Machine Flowshop Scheduling with Availability Constraints,” European J. Operational Research, vol. 114, no. 2, pp.420-429, Apr. 1999.
[16] G. Mosheiov, “Minimizing the Sum of Job Completion Times on Capacitated Parallel Machines,” Math. and Computer Modelling, vol. 20, pp. 91-99, 1994.
[17] D.-T. Peng and K.G. Shin, “Optimal Scheduling of Cooperative Tasks in a Distributed System Using an Enumerative Method,” IEEE Trans. Software Eng., vol. 19, no. 3, pp. 253-267, Mar. 1993.
[18] X. Qi, T. Chen, and F. Tu, “Scheduling the Maintenance on a Single Machine,” J. Operational Research, vol. 50, pp. 1071-1078, 1999.
[19] X. Qin and H. Jiang, “A Dynamic and Reliability-Driven Scheduling Algorithm for Parallel Real-Time Jobs on Heterogeneous Clusters,” J. Parallel and Distributed Computing, vol. 65, no. 8, pp. 885-900, Aug. 2005.
[20] S. Ranaweera and D.P. Agrawal, “Scheduling of Periodic Time Critical Applications for Pipelined Execution on Heterogeneous Systems,” Proc. 30th Int'l Conf. Parallel Processing (ICPP '01), pp.131-138, Sept. 2001.
[21] C. Sadfi and Y. Ouarda, “Parallel Machines Scheduling Problem with Availability Constraints,” Proc. Ninth Int'l Workshop Project Management and Scheduling (PMS '04), 2004.
[22] E. Sanlaville and G. Schmidt, “Machine Scheduling with Availability Constraints,” Acta Informatica, vol. 35, no. 9, pp. 795-811, Sept. 1998.
[23] G. Schmidt, “Scheduling with Limited Machine Availability,” European J. Operational Research, vol. 121, pp. 1-15, 2000.
[24] J. Sethuraman and M.S. Squillante, “Optimal Stochastic Scheduling in Multiclass Parallel Queues,” Proc. ACM SIGMETRICS Conf., May 1999.
[25] S.M. Shatz, J.P. Wang, and M. Goto, “Task Allocation for Maximizing Reliability of Distributed Computer Systems,” IEEE Trans. Computers, vol. 41, no. 9, pp. 1156-1168, Sept. 1992.
[26] S.P. Smith, “An Efficient Method to Maintain Resource Availability Information for Scheduling Applications,” Proc. IEEE Int'l Conf. Robotics and Automation (ICRA '92), vol. 2, pp. 1214-1219, May 1992.
[27] W.E. Smith, “Various Optimizers for Single-Stage Production,” Naval Research and Logistics Quarterly, pp. 59-66, 1954.
[28] S.-S. Song, K. Hwang, and Y.-K. Kwok, “Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling,” IEEE Trans. Computers, vol. 55, no. 6, pp. 703-719, June 2006.
[29] S. Srinivasan and N.K. Jha, “Safety and Reliability Driven Task Allocation in Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 238-251, Mar. 1999.
[30] H. Topcuoglu, S. Hariri, and M.-Y. Wu, “Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, Mar. 2002.
[31] T. Xie and X. Qin, “Scheduling Security-Critical Real-Time Applications on Clusters,” IEEE Trans. Computers, vol. 55, no. 7, pp. 864-879, July 2006.
[32] T. Xie and X. Qin, “Improving Security for Periodic Tasks in Embedded Systems through Scheduling,” ACM Trans. Embedded Computing Systems, vol. 6, no. 1, 2007.
[33] T. Xie and X. Qin, “A New Allocation Scheme for Parallel Applications with Deadline and Security Constraints on Clusters,” Proc. IEEE Int'l Conf. Cluster Computing (Cluster '05), Sept. 2005.
[34] T. Xie and X. Qin, “Enhancing Security of Real-Time Applications on Grids through Dynamic Scheduling,” Proc. 11th Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '05), June 2005.
[35] T. Xie and X. Qin, “A Security-Oriented Task Scheduler for Heterogeneous Distributed Systems,” Proc. 13th IEEE Int'l Conf. High Performance Computing (HiPC '06), Dec. 2006.
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool