@article {402,
	title = {Spanning tree method for minimum communication costs in grouped virtual mapreduce cluster},
	journal = {Journal of Digital Information Management},
	volume = {11},
	year = {2013},
	note = {Export Date: 10 July 2014},
	month = {2013},
	pages = {213 - 219},
	abstract = {Today, MapReduce and virtual cluster are sharp swords for this big data and cloud computing era. To combine these two emerging technologies, it brings feasible-scalability, easy-management, fast-deployment and high-efficiency with the system. As every sword has two sides, the I/O bottleneck of virtualization technologies may seriously impacts on the performance of MapReduce cluster which deals with I/O-intensive applications. In this paper, we analyze the combination advantages and disadvantages of virtualization technology of MapReduce cluster. We also analyze the communication model for both of them and build a communication costs model. Then, we propose a novel algorithm of minimum-weight spanning tree to construct a lower communication costs virtual MapReduce cluster. With the help of constructing minimum-weight spanning tree, we find out a method to select local-master and group the cluster. Theoretical simulation and experiment results demonstrate that our method can greatly reduce communication costs. The performance improvement is up to ~40.4\% respectively.},
	keywords = {Cloud computing, Mapreduce, Spanning tree, Virtual machine},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880774380\&partnerID=40\&md5=a8db5f920e0bbee748a4977aecbefdf2},
	author = {Yang, Y. and Long, X. and Shi, B.}
}
