Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2016, Article ID 5018213, 8 pages
Research Article

Research on Optimal Path of Data Migration among Multisupercomputer Centers

1Department of Management Science and Engineering, Harbin Institute of Technology, No. 92, Xidazhi Street, Nangang, Harbin, Heilongjiang 150001, China
2Shandong Provincial Key Laboratory of Computer Networks, Shandong Computer Science Center (National Supercomputer Center in Jinan), Jinan, China

Received 28 January 2016; Revised 1 April 2016; Accepted 18 May 2016

Academic Editor: Dantong Yu

Copyright © 2016 Gang Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Supplementary Material

Result shows that shortest path is 28.8 and data migration path is {C → D → B, C → E → A}. By comparison, the simulation result is the same as the result of enumeration, so the correctness of the algorithm is verified.

  1. Supplementary Figures