STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Web caching with consistent hashing
WWW '99 Proceedings of the eighth international conference on World Wide Web
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Distributed caching with memcached
Linux Journal
ACM Computing Surveys (CSUR)
ACM Transactions on Information Systems (TOIS)
Load balancing in dynamic structured peer-to-peer systems
Performance Evaluation - P2P computing systems
The impact of caching on search engines
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Providing Non-stop Service for Message-Passing Based Parallel Applications with RADIC
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Improved techniques for result caching in web search engines
Proceedings of the 18th international conference on World wide web
ROAR: increasing the flexibility and performance of distributed search
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
New caching techniques for web search engines
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Dynamic load balancing in distributed hash tables
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A Fault-Tolerant Cache Service for Web Search Engines
ISPA '12 Proceedings of the 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications
| Hi-index | 0.00 |
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.