Abstract
A notable requirement of clusters is to maximize its processing performance. Lots of work in this area has been done to optimize the system performance by improving certain metric such as reliability, availability, security and so on. However, most of them assumes that the system is running without interruption and seldom considers the system’s intrinsic characteristics, such as failure rate, repair rate and lifetime. In this paper, we study how to achieve high availability based on residual lifetime analysis for the repairable heterogeneous clusters with makespan constraints. First, we provide an availability model based on addressing the cluster’s residual lifetime model. Second, we give an objective function about the model and develop a heuristic scheduling algorithm to maximize the availability the makespan constraint. At last, we demonstrate these advantages through the extensive simulated experiments.
This work is supported by the National Natural Science Foundation of China (No.90412012, 60473086 and 60673184) and the National Grand Fundamental Research 973 Program of China (2006CB708301).
Chapter PDF
References
Alhamdan, A.A.: Scheduling Methods for Efficient Utilization of Clusters Computing Environments. PhD thesis, University of Connecticut (2003)
Chu, W., Holloway, L., Lan, M.T., Efe, K.: Task allocation in distributed data processing. IEEE Mag. Computer 13, 57–69 (1980)
Shatz, S.M., Wang, J.P., Goto, M.: Task allocation for maximizing reliability of distributed computer systems. IEEE Trans. Comput. 41(9), 1156–1168 (1992)
Xie, T., Qin, X.: Stochastic scheduling with availability constraints in heterogeneous clusters. IEEE Proc. Cluster Computing 9, 1–10 (2006)
Schmidt, G.: Scheduling with limited machine availability. International Computer Science Institute Technical Report (TR-98-036) (1998)
Ali, S., Maciejewski, A.A., Siegel, H.J., Kim, J.K.: Measuring the robustness of a resource allocation. IEEE Trans. Parallel Distrib. Syst. 15(7), 630–641 (2004)
Shestak, V., Smith, J., Siegel, H.J., Maciejewski, A.A.: A stochastic approach to measuring the robustness of resource allocations in distributed systems. In: ICPP 2006. Proceedings of the 2006 International Conference on Parallel Processing, Washington, DC, USA, pp. 459–470. IEEE Computer Society Press, Los Alamitos (2006)
Dogan, A., Özgüner, F.: Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing. In: ICPP 2000. Proceedings of the 2000 International Conference on Parallel Processing, Washington, DC, USA, p. 307. IEEE Computer Society Press, Los Alamitos (2000)
Topcuouglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260–274 (2002)
Hariri, S., Raghavendra, C.S.: Distributed functions allocation for reliability and delay optimization. In: ACM 1986. Proceedings of 1986 ACM Fall joint computer conference, Los Alamitos, CA, USA, pp. 344–352. IEEE Computer Society Press, Los Alamitos (1986)
Srinivasan, S., Jha, N.K.: Safety and reliability driven task allocation in distributed systems. IEEE Trans. Parallel Distrib. Syst. 10(3), 238–251 (1999)
Aven, T., Jensen, U.: Stochastic Models in Reliability. Stochastic Modelling and Applied Probability. Springer, Heidelberg (1999)
Kallenberg, O.: Foundations of Modern Probability. Springer, Heidelberg (2001)
Papadimitriou, C.H.: Comuputational Complexity. Addison-Wesley, Reading (1993)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Jiang, X., Lin, C., Yin, H., Hu, Y. (2007). A Scheduling Model for Maximizing Availability with Makespan Constraint Based on Residual Lifetime in Heterogeneous Clusters. In: Li, K., Jesshope, C., Jin, H., Gaudiot, JL. (eds) Network and Parallel Computing. NPC 2007. Lecture Notes in Computer Science, vol 4672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74784-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-74784-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74783-3
Online ISBN: 978-3-540-74784-0
eBook Packages: Computer ScienceComputer Science (R0)