Share Email Print
cover

Proceedings Paper

Scheduling and routing algorithm for aggregating large data files from distributed databases to super-computers on lambda grid
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 19 November 2008
PDF: 10 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71372D (19 November 2008); doi: 10.1117/12.803604
Show Author Affiliations
Shen Sun, Shanghai Jiaotong Univ. (China)
Wei Guo, Shanghai Jiaotong Univ. (China)
Weiqiang Sun, Shanghai Jiaotong Univ. (China)
Yaohui Jin, Shanghai Jiaotong Univ. (China)
Weisheng Hu, Shanghai Jiaotong Univ. (China)


Published in SPIE Proceedings Vol. 7137:
Network Architectures, Management, and Applications VI
Weisheng Hu; Shoa-Kai Liu; Ken-ichi Sato; Lena Wosinska, Editor(s)

© SPIE. Terms of Use
Back to Top