Performance and Scalability of a Replica Location Service

  • Authors:
  • Ann L. Chervenak;Naveen Palavalli;Shishir Bharathi;Carl Kesselman;Robert Schwartzkopf

  • Affiliations:
  • University of Southern California Information Sciences Institute;University of Southern California Information Sciences Institute;University of Southern California Information Sciences Institute;University of Southern California Information Sciences Institute;University of Southern California Information Sciences Institute

  • Venue:
  • HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.