Research on Optimal Path of Data Migration among Multisupercomputer Centers

Data collaboration between supercomputer centers requires a lot of data migration. In order to increase the efficiency of data migration, it is necessary to design optimal path of data transmission among multisupercomputer centers. Based on the situation that the target center which finished receiving data can be regarded as the new source center to migrate data to others, we present a parallel scheme for the data migration among multisupercomputer centers with different interconnection topologies using graph theory analysis and calculations. Finally, we verify that this method is effective via numeric simulation.

[1]  Peter Buchholz,et al.  PH-graphs for analyzing shortest path problems with correlated traveling times , 2015, Comput. Oper. Res..

[2]  Herbert Dawid,et al.  EURACE: A massively parallel agent-based model of the European economy , 2008, Appl. Math. Comput..

[3]  D. Lawrence,et al.  A new synoptic scale resolving global climate simulation using the Community Earth System Model , 2014 .

[4]  Kai Zheng,et al.  Finding Alternative Shortest Paths in Spatial Networks , 2012, TODS.

[5]  Christian Sommer,et al.  Shortest-path queries in static networks , 2014, ACM Comput. Surv..

[6]  V. Venkatakrishnan,et al.  On the role and challenges of CFD in the aerospace industry , 2016, The Aeronautical Journal.

[7]  Fabio Checconi,et al.  Massive data analytics: The Graph 500 on IBM Blue Gene/Q , 2013, IBM J. Res. Dev..

[8]  Charles B. Ward,et al.  Complexity results on labeled shortest path problems from wireless routing metrics , 2010, Comput. Networks.

[9]  Matthew J. Zekauskas,et al.  A One-way Delay Metric for IPPM , 1999, RFC.

[10]  J. Gondzio,et al.  Solving nonlinear financial planning problems with � , .

[11]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[12]  Yong Wang,et al.  Finding the Optimal Bus-Routes Based on Data Mining Method , 2013, ICIC.

[13]  Hideaki Sugawara,et al.  Introduction of Supercomputer System for DNA Data Bank of Japan , 2008 .

[14]  T. G. I. Fernando,et al.  Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem , 2015, Swarm Evol. Comput..

[15]  Albert G. Greenberg,et al.  The cost of a cloud: research problems in data center networks , 2008, CCRV.

[16]  Michael Sirivianos,et al.  Inter-datacenter bulk transfers with netstitcher , 2011, SIGCOMM.

[17]  Xiaoyuan Yang,et al.  Inter-datacenter bulk transfers with netstitcher , 2011 .

[18]  Dominique Lavenier,et al.  All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters , 2015, J. Parallel Distributed Comput..

[19]  M. Shibata,et al.  High resolution magnetohydrodynamic simulation of black hole-neutron star merger: Mass ejection and short gamma ray bursts , 2015, 1506.06811.

[20]  Kam-yiu Lam,et al.  Approximate path searching for supporting shortest path queries on road networks , 2015, Inf. Sci..

[21]  Matteo Pradella,et al.  Parallel parsing of operator precedence grammars , 2013, Inf. Process. Lett..