01753nas a2200205   4500008004100000245009400041210006900135260000900204300001400213490000700227520108600234653002001320653001401340653001801354653002001372100001301392700001301405700001201418856011701430       2013                        eng d00aSpanning tree method for minimum communication costs in grouped virtual mapreduce cluster0 aSpanning tree method for minimum communication costs in grouped   c2013  a213 - 2190 v113 aToday, 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.10aCloud computing10aMapreduce10aSpanning tree10aVirtual machine1 aYang, Y.1 aLong, X.1 aShi, B.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880774380&partnerID=40&md5=a8db5f920e0bbee748a4977aecbefdf2