Giggle A Framework for Constructing Scalable Replica Location.pdfVIP

Giggle: A Framework for Constructing Scalable Replica Location Services Ann Chervenak1 Ewa Deelman1 Ian Foster2,3 Leanne Guy4 Wolfgang Hoschek4 Adriana Iamnitchi2 Carl Kesselman1 Peter Kunszt4 Matei Ripeanu2 Bob Schwartzkopf1 Heinz Stockinger4 Kurt Stockinger4 Brian Tierney5 1 Information Sciences Institute, University of Southern California, Marina del Rey, CA 90292 2 Department of Computer Science, University of Chicago, Chicago, IL 60637 3 Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439 4 CERN, European Organization for Nuclear Research, CH-1211 Geneva 23, Switzerland 5 Lawrence Berkeley National Laboratory Abstract In wide area computing systems, it is often desirable to create remote read-only copies (replicas) of files. Replication can be used to reduce access latency, improve data locality, and/or increase robustness, scalability and performance for distributed applications. We define a replica location service (RLS) as a system that maintains and provides access to information about the physical locations of copies. An RLS typically functions as one component of a data grid architecture. This paper makes the following contributions. First, we characterize RLS requirements. Next, we describe a parameterized architectural framework, which we name Giggle (for GIGa-scale Global Location Engine), within which a wide range of RLSs can be defined. We define several concrete instantiations of this framework with different performance characteristics. Finally, we present initial performance results for an RLS prototype, demonstrating that