A fault-tolerant cache service for web search engines: RADIC evaluation

Carlos Gómez-Pantoja, Dolores Rexachs, Mauricio Marin, Emilio Luque

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

Large Web search engines are constructed as a collection of services that are deployed on dedicated clusters of distributed-memory processors. In particular, efficient query throughput heavily relies on using result cache services devoted to maintaining the answers to most frequent queries. Load balancing and fault tolerance are critical to this service. A previous paper [7] described the design of a result cache service based on consistent hashing and a strategy for enabling fault tolerance. This paper goes further into implementation details and experiments related to the basic scheme to support fault-tolerance which is critical for overall performance. To this end, we evaluate the performance of the RADIC scheme [14] for fault-tolerance under demanding scenarios imposed in the caching service.

Original languageEnglish
Title of host publicationParallel Processing - 18th International Conference, Euro-Par 2012, Proceedings
Pages298-310
Number of pages13
DOIs
Publication statusPublished - 24 Oct 2012
Event18th International Conference on Parallel Processing, Euro-Par 2012 - Rhodes Island, Greece
Duration: 27 Aug 201231 Aug 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7484 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Parallel Processing, Euro-Par 2012
Country/TerritoryGreece
CityRhodes Island
Period27/08/1231/08/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'A fault-tolerant cache service for web search engines: RADIC evaluation'. Together they form a unique fingerprint.

Cite this