Research on the Key Technologies of Resource Dynamic Management in Cloud Computing Environment

Abstract:

For the "hot spots" problem caused by the number of replica could not satisfy the soaring request from users, we present a Cloud Computing storage resource replica dynamic scheduling scheme based on HDFS. There are two sub algorithms which is the number of replica dynamic adjustment algorithm and replica placement algorithm. This scheme could improve system stability and file access through put. The experiment result shows this optimized scheme lower the access delay obviously than the original scheme with some cost of storage resource and network workload. For the problem of metadata management, this paper introduced a distributed metadata management scheme. This scheme distributed metadata into several name node according to their ability, and provides an efficient inquiry algorithm for metadata to improve system availability and reliability. The experiment result shows the multi-name nodes system with this metadata management scheme could improve the performance than the original system facing the huge metadata operation requests.

• Periodical: Advanced Materials Research (Volumes 926-930)
• Pages: 2618-2621
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.926-930.2618
• Online since: May 2014
• Authors: Jian Ji Xiang*
• Keywords: Cloud Computing, Distribution, Dynamic, Management, Resource

References

[1] Abraham, Peter B. Galvin, Greg Gagne. Operating System Concepts (8th Ed. ). John Wiley & Sons (Asia). 2010. Page: 194.

[2] Ian Foster, Yong Zhao, et al. Cloud Computing and Grid Computing 360-Degree Compared. Grid Computing Environments Workshop, GCE '08, (2008).

DOI: 10.1109/gce.2008.4738445

[3] Y. Yang, K. Liu, J. J Chen, et al. An algorithm in SwinDeW-C for scheduling transaction-intensive cost-constrained cloud workflows. In: Proceedings of the IEEE 4thInternational Conference on Science, IEEE Press. Dec 2008. Pages: 374-375.

DOI: 10.1109/escience.2008.93

[4] Raman R, Solomon M. Mach-making: Distributed Resource Management for High throughout Computing. In: Proceedings of the 7th IEEE International Symposium on High-Performance Distributed Computing (HPDC-7), Chicago: IEEE Computer Society Press. (1998).

DOI: 10.1109/hpdc.2005.1520921

[5] Philippe Nain, Don Towsley. Comparison of Hybrid Minimum Laxity/First-In-First-Out Scheduling Policies for Real-Time Multiprocessors. IEEE Transactions on Computers, vol. 41, Issue 10. 1992. Pages: 1271-1278.

DOI: 10.1109/12.166604

[6] M. Zaharias, J. S. Sarema, et al. Job scheduling for multi-user map-reduce clusters. EECS Department, University of California, Berkeley, Technical Report, Apr (2009).