Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  analyze the combination advantages and disadvantages of virtualization technology of MapReduce cluster.  also analyze the communication model for both of them and build a communication costs model. Then,  propose a novel algorithm of minimum-ight spanning tree to construct a lor communication costs virtual MapReduce cluster. With the help of constructing minimum-ight spanning tree,  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
['Yang Yang', 'Xiang Long', 'Biaobiao Shi']
I am writing a research paper on a idea Spanning Tree Method for Minimum Communication Costs In Grouped Virtual MapReduce Cluster
[{"from": "human", "value": "I am writing a research paper on a idea Spanning Tree Method for Minimum Communication Costs In Grouped Virtual MapReduce Cluster"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  analyze the combination advantages and disadvantages of virtualization technology of MapReduce cluster.  also analyze the communication model for both of them and build a communication costs model. Then,  propose a novel algorithm of minimum-ight spanning tree to construct a lor communication costs virtual MapReduce cluster. With the help of constructing minimum-ight spanning tree,  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"}]