DMCA
Data Placement in Widely Distributed Systems (2005)
Cached
Download Links
| Citations: | 8 - 4 self |
BibTeX
@TECHREPORT{Kosar05dataplacement,
author = {Tevfik Kosar},
title = {Data Placement in Widely Distributed Systems},
institution = {},
year = {2005}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The unbounded increase in the computation and data requirements of scientific applica-tions has necessitated the use of widely distributed compute and storage resources to meet the demand. In such an environment, data is no more locally accessible and has thus to be remotely retrieved and stored. Efficient and reliable access to data sources and archiving destinations in a widely distributed environment brings new challenges. Placing data on temporary local storage devices offers many advantages, but such “data placements ” also require careful management of storage resources and data movement, i.e. allocating storage space, staging-in of input data, staging-out of generated data, and de-allocation of local storage after the data is safely stored at the destination. Existing systems closely couple data placement and computation, and consider data placement as a side effect of computation. Data placement is either embedded in the com-putation and causes the computation to delay, or performed as simple scripts which do not have the privileges of a job. In this dissertation, we propose a framework that de-couples computation and data placement, allows asynchronous execution of each, and treats data
Keyphrases
data placement widely distributed system storage resource scientific applica-tions simple script reliable access new challenge input data data requirement storage space unbounded increase couple data placement treat data many advantage data movement temporary local storage device de-couples computation local storage asynchronous execution side effect careful management
