ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
The Livny and Plank-Beck Problems: Studies in Data Movement on the Computational Grid
Full text PdfPdf (481 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 2003 ACM/IEEE conference on Supercomputing table of contents
Page: 43  
Year of Publication: 2003
ISBN:1-58113-695-1
Authors
Matthew S. Allen  University of California, Santa Barbara
Rich Wolski  University of California, Santa Barbara
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 7
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Over the last few years the Grid Computing research community has become interested in developing data intensive applications for the Grid. These applications face significant challenges because their widely distributed nature makes it difficult to access data with reasonable speed. In order to address this problem, we feel that the Grid community needs to develop and explore data movement challenges that represent problems encountered in these applications. In this paper, we will identify two such problems that we have dubbed the Livny Problem and the Plank-Beck Problem. We will also present data movement scheduling techniques that we have developed to address these problems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[1] CERN homepage. http://public.web.cern.ch/ public/.
 
2
[2] Dr. James Plank's homepage. http://www.cs.utk. edu/~plank/.
 
3
[3] Dr. Micah Beck's homepage. http://www.cs.utk. edu/~mbeck/.
 
4
[4] Dr. Miron Livny's homepage. http://www.cs.wisc. edu/~miron/.
 
5
[5] European Data Grid Project homepage. http:// eu-datagrid.web.cern.ch/eu-datagrid/.
 
6
[6] Globus Data Grid homepage. http://www.globus. org/datagrid/.
 
7
[7] GrADS Project homepage. http://hipersoft.cs. rice.edu/grads/.
 
8
 
9
 
10
 
11
[11] C. Baru, R. Moore, A. Rajasekar, and M. Wan. The sdsc storage resource broker, 1998.
 
12
 
13
[13] M. Beynon, R. Ferreira, T. M. Kurc, A. Sussman, and J. H. Saltz. Datacutter: Middleware for filtering very large scientific datasets on archival storage systems. In IEEE Symposium on Mass Storage Systems, pages 119-134, 2000.
 
14
[14] A. Chervenak, I. Foster, C. Kesselman, C. Salisbury, and S. Tuecke. The data grid: Towards an architecture for the distributed management and analysis of large scientific datasets, 1999.
 
15
[15] Condor home page - http://www.cs.wisc.edu/condor/.
 
16
 
17
 
18
[18] J. Plank, M. Beck, W. Elwasif, T. Moore, M. Swany, and R. Wolski. The internet backplane protocol: Storage in the network, 1999.
 
19
[19] J. S. Plank, S. Atchley, Y. Ding, and M. Beck. Algorithms for high performance, wide-area, distributed file downloads. Technical Report UT-CS-02-485, Department of Computer Science, University of Tennessee, October 2002.
 
20
[20] A. Shoshani, L. M. Bernardo, H. Nordberg, D. Rotem, and A. Sim. Storage managementfor high energy physics applications. In Computing in High Energy Physics, 1998.
 
21
[21] T. Tannenbaum and M. Litzkow. The condor distributed processing system. Dr. Dobbs Journal, February 1995.
 
22
 
23
[23] R. F. V. D. Wijngaart and M. Frumkin. Nas grid benchmarks version 1.0. Technical Report NAS-02-005, NASA Advanced Supercomputing, July 2002.
 
24
25
 
26

CITED BY  7
Collaborative Colleagues:
Matthew S. Allen: colleagues
Rich Wolski: colleagues