Performance and scalability of a replica location service
Published 13 November 2004
Ann Chervenak, Naveen Palavalli, S. Bharathi, Carl Kesselman, R. Schwartzkopf
Citations83
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We describe the implementation and evaluate the performance of a replica location service that is part of the Globus Toolkit Version 3.0. A replica location service (RLS) provides a mechanism for registering the existence of replicas and discovering them. Features of our implementation include the use of soft state update protocols to populate a distributed index and optional Bloom filter compression to reduce the size of these updates. Our results demonstrate that RLS performance scales well for individual servers with millions of entries and up to 100 requesting threads. We also show that the distributed RLS index scales well when using Bloom filter compression for wide area updates.
Keywords
Computer Science
Chord
9,645 Citations2001Ion Stoica, Robert Morris +3 more
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Communications of the ACMSpace/time trade-offs in hash coding with allowable errors
7,507 Citations1970Burton H. Bloom
Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
IEEE/ACM Transactions on NetworkingSummary cache: a scalable wide-area Web cache sharing protocol
1,799 Citations2000Fan Li, Pei Cao +2 more
This paper demonstrates the benefits of cache sharing, measures the overhead of the existing protocols, and proposes a new protocol called "summary cache", which reduces the number of intercache protocol messages, reduces the bandwidth consumption, and eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same cache hit ratios as ICP.
IEEE Journal on Selected Areas in CommunicationsTapestry: A Resilient Global-Scale Overlay for Service Deployment
1,726 Citations2004Bi Zhao, Ling Huang +4 more
Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers, illustrating its utility as a deployment infrastructure.
The SDSC storage resource broker
557 Citations2010Chaitanya Baru, Reagan Moore +2 more
The architecture and various features of the SDSC SRB are described, which provides applications a uniform API to access heterogeneous distributed storage resources including, filesystems, database systems, and archival storage systems.
Journal of Grid ComputingMapping Abstract Complex Workflows onto Grid Environments
484 Citations2003Ewa Deelman, James Blythe +9 more
The current ACWG based on AI planning technologies is described and it is outlined how these technologies can play a crucial role in developing complex application workflows in Grid environments.
IEEE Internet ComputingProtecting free expression online with Freenet
402 Citations2002Ian Clarke, S.G. Miller +3 more
Freenet is a distributed information storage system designed to address information privacy and survivability concerns and implements strategies to protect data integrity and prevent privacy leaks, and provide for graceful degradation and redundant data availability in the latter.
Giggle: A Framework for Constructing Scalable Replica Location Services
205 Citations2002Ann Chervenak, Ewa Deelman +11 more
A parameterized architectural framework is described, which is name Giggle (for GIGa-scale Global Location Engine), within which a wide range of RLSs can be defined, and initial performance results for an RLS prototype are presented, demonstrating that RLS systems can be constructed that meet performance goals.
GriPhyN and LIGO, building a virtual data Grid for gravitational wave scientists
138 Citations2003Ewa Deelman, Carl Kesselman +8 more
The initial design and prototype of a virtual data Grid for LIGO, which is being built to observe the gravitational waves predicted by general relativity, is described.
Replica Management in Data Grids
106 Citations2002L. P. Guy, Peter Kunszt +3 more
The architecture and design of a Replica Management System, called Reptor, is described within the context of the EU Data Grid project, and a prototype implementation is currently under development.
Data replication in Mariposa
77 Citations2002Jeff Sidell, Paul M. Aoki +4 more
It is shown how the replica control mechanism can be used to provide consistent, although potentially stale, views of data across many machines without expensive per-transaction synchronization.
Replication in Ficus distributed file systems
59 Citations2002Gerald J. Popek, Richard G. Guy +2 more
Ficus is a replicated general filing environment for Unix intended to scale to very large (nationwide) networks in which conflicting updates to the file system's directory information are automatically reconciled, while conflicting file updates are reliably detected and reported.
Pegasus: Planning for Execution in Grids
58 Citations2002Ewa Deelman, James M. Blythe +2 more
Motivation Grid computing has made great progress in the last few years, but it is becoming increasingly necessary to develop higher level services which can automate the process and provide an adequate level of performance and reliability.
The Case for Non-transparent Replication: Examples from Bayou.
55 Citations1998Douglas B. Terry, Karin Anna Petersen +2 more
This paper looks at two Bayou applications, a calendar manager and a mail reader, and illustrates ways in which they utilize Bayou’s features to manage their data in an application-specific manner.
arXiv (Cornell University)Worldwide Fast File Replication on Grid Datafarm
15 Citations2003Osamu Tatebe, Satoshi Sekiguchi +3 more
This paper discusses and evaluates several techniques to support long-distance fast file replication using rate-controlled HighSpeed TCP with network striping.