Automatic Data Placement and Replication in Grids

被引：0

作者：

Ding, Ying ^{[1
]}

Lu, Ying ^{[1
]}

机构：

[1] Univ Nebraska, Dept Comp Sci & Engn, Lincoln, NE 68588 USA

来源：

16TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), PROCEEDINGS | 2009年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Data grids provide geographically distributed storage and computing resources for large data-intensive applications. To support fast data access and processing, effective data management is essential. In this paper, we propose two novel algorithms on data placement and data replication. We evaluate the algorithms through intensive simulations. Results show that the new algorithms achieve significant improvement in facilitating load balancing, reducing job response time, and saving network bandwidth.

引用

页码：30 / 39

页数：10

共 27 条

[1] Abawajy JH, 2004, LECT NOTES COMPUT SC, V3038, P66
[2] BELL WH, 2003, IEEE ACM INT S CLUST, P661
[3] Buyya R., 2000, Grid Computing - GRID 2000. First IEEE/ACM International Workshop. Proceedings (Lecture Notes in Computer Science Vol.1971), P18
[4] Buyya R, 2000, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, P402
[5] CAPOZZA L, 2002, INT WORKSH GRID COMP, P46
[6] CHERVENAK A, 2007, SUPERCOMPUTING, P63
[7] OPTIMAL FILE ALLOCATION IN A MULTIPLE COMPUTER SYSTEM
CHU, WW
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (10) : 885 - &
[8] DING Y, 2008, THESIS U NEBRASKA LI
[9] DOWDY L, 1982, ACM COMPUTING SURVEY, V14
[10] Eswaran K.P., 1974, PROC IFIPS C, P304

← 1 2 3 →