Subscribe

Issue No.03 - March (2011 vol.23)

pp: 388-401

Wenxuan Zhang , Rutgers University, Piscataway

Guofei Jiang , NEC Laboratories America, Inc., Princeton

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.121

ABSTRACT

This paper proposes a new strategy, the experience transfer, to facilitate the management of large-scale computing systems. It deals with the utilization of management experiences in one system (or previous systems) to benefit the same management task in other systems (or current systems). We use the system configuration tuning as a case application to demonstrate all procedures involved in the experience transfer including the experience representation, experience extraction, and experience embedding. The dependencies between system configuration parameters are treated as transferable experiences in the configuration tuning for two reasons: 1) because such knowledge is helpful to the efficiency of the optimal configuration search, and 2) because the parameter dependencies are typically unchanged between two similar systems. We use the Bayesian network to model configuration dependencies and present a configuration tuning algorithm based on the Bayesian network construction and sampling. As a result, after the configuration tuning is completed in the original system, we can obtain a Bayesian network as the by-product which records the dependencies between system configuration parameters. Such a network is then embedded into the tuning process in other similar systems as transferred experiences to improve the configuration search efficiency. Experimental results in a web-based system show that with the help of transferred experiences, the configuration tuning process can be significantly accelerated.

INDEX TERMS

Distributed systems, knowledge acquisition, knowledge reuse, configuration tuning, active sampling.

CITATION

Wenxuan Zhang, Guofei Jiang, "Experience Transfer for the Configuration Tuning in Large-Scale Computing Systems",

*IEEE Transactions on Knowledge & Data Engineering*, vol.23, no. 3, pp. 388-401, March 2011, doi:10.1109/TKDE.2010.121REFERENCES

- [1] H.G. Beyer,
The Theory of Evolution Strategies. Springer, 2001.- [2] L. Breiman, J. Friedman, R. Olshen, and C. Stone,
Classification and Regression Trees. Wadsworth and Brooks, 1984.- [3] G. Casella and R.L. Berger,
Statistical Inference. Duxbury, 2002.- [4] N. Friedman, M. Goldszmidt, and T.J. Lee, "Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting,"
Proc. 15th Int'l Conf. Machine Learning (ICML '98). pp. 179-187, 1998.- [5] D. Heckerman and D. Geiger, "Learning Bayesian Networks: A Unification for Discrete and Gaussian Domains,"
Proc. 11th Conf. Uncertainty in Artificial Intelligence (UAI '95), pp. 274-284, 1995.- [6] D. Heckerman, D. Geiger, and D.M. Chickering, "Learning Bayesian Networks: The Combination of Knowledge and Statistical Data,"
Machine Learning, vol. 20, pp. 197-243, 1995.- [7] G. Jiang, H. Chen, and K. Yoshihira, "Modeling and Tracking of Transaction Flow Dynamics for Fault Detection in Complex Systems,"
IEEE Trans. Dependable and Secure Computing, vol. 3, no. 4, pp. 312-326, Oct.-Dec. 2006.- [8] S. Kounev, B. Weis, and A. Buchmann, "Performance Tuning and Optimization of J2EE Applications on the JBoss Platform,"
J. Computer Resource Management, vol. 113, pp. 40-49, 2004.- [9] A. Mas-Colell, M.D. Whinston, and J.R. Green,
Microeconomic Theory. Oxford Univ. Press, 1995.- [10] M.D. McKay, W.J. Conover, and R.J. Beckman, "A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code,"
Technometrics, vol. 21, pp. 239-245, 1979.- [11] R.E. Neapolitan,
Learning Bayesian Networks. Prentice Hall, Apr. 2003.- [12] J.A. Nelder and R. Mead, "A Simplex Method for Function Minimization,"
Computer Journal, vol. 7, pp. 308-313, 1965.- [13] J. Ocenasek and J. Schwarz, "Estimation Distribution Algorithm for Mixed Continuous-Discrete Optimization Problems,"
Proc. Second Euro-Int'l Symp. Computational Intelligence, pp. 227-232, 2002.- [14] T. Osogami and T. Itoko, "Finding Probably Better System Configurations Quickly,"
Proc. ACM SIGMETRICS, pp. 264-275, 2006.- [15] T. Osogami and S. Kato, "Optimizing System Configurations Quickly by Guessing at the Performance,"
Proc. ACM SIGMETRICS, pp. 145-156, 2007.- [16] D.A. Patterson et al., "Recovery-Oriented Computing (ROC): Motivation, Definition, Techniques, and Case Studies," Technical Report UCB//CSD-02-1175, UC Berkeley Computer Science, http:/roc.cs.berkley.edu, 2002.
- [17] M. Pelikan, D.E. Goldberg, and E.C. Paz, "BOA: The Bayesian Optimization Algorithm,"
Proc. Genetic and Evolutionary Computation Conf. (GECCO '99), vol. 1, pp. 525-532, 1999.- [18] A. Saboori, G. Jiang, and H. Chen, "Autotuning Configurations in Distributed Systems for Performance Improvements Using Evolutionary Strategies,"
Proc. 28th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '08), 2008.- [19] C. Tapus, I. Chung, and J. Hollingsworth, "Active Harmony : Towards Automated Performance Tuning,"
Proc. High Performance Networking and Computing (SC '02), 2002.- [20] M.P. Wand and M.C. Jones,
Kernel Smoothing. Chapman & Hall, 1995.- [21] B. Xi, Z. Liu, M. Raghavachari, C.H. Xia, and L. Zhang, "A Smart Hill-Climbing Algorithm for Application Server Configuration,"
Proc. 13th Int'l Conf. World Wide Web (WWW '04), pp. 287-296, 2004.- [22] T. Ye and S. Kalyanaraman, "A Recursive Random Search Algorithm for Large-Scale Network Parameter Configuration,"
Proc. ACM SIGMETRICS, pp. 196-205, 2003.- [23] W. Zheng, R. Bianchini, and T.D. Nguyen, "Automatic Configuration of Internet Services,"
Proc. Conf. EuroSys (EuroSys '07,) pp. 219-229, 2007. |