Scheduling and routing algorithm for aggregating large data files from distributed databases to super-computers on lambda grid

Sun Shen, Wei Guo, Weiqiang Sun, Yaohui Jin, Weisheng Hu · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2008

These days while the traditional Internet cannot meet the requirement of data-intensive communications in large scale escience grid applications, Optical network which is also referred to as Lambda Grid provide a simple means of achieving guaranteed high bandwidth, guaranteed latency and deterministic connection. Lots of e-science applications like e-VLBI and GTL require aggregating several hundred GB data files from distributed databases to super-computers frequently at real time. Thus minimizing the aggregation time can improve the overall system performance. We consider the problem of aggregating large data files from distributed databases to distributed computational resources on lambda grid. We modify the model of Time-Path Scheduling Problem (TPSP) which has been proposed and propose a new N-destination TPSP (NDTPSP) model. We present the proof of NDTPSP's NP-completeness. We also propose a list scheduling algorithm and a modified list scheduling algorithm for our problem. The performance of different algorithms will be compared and analyzed by simulations.

Read the paper · More papers on PaperTik