Analyzing imbalance among homogeneous index servers in a web search system

作者:

Highlights:

摘要

The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the execution time of the slowest server to generate a partial ranked answer. Previous approaches investigate performance issues in this context using simulation, analytical modeling, experimentation, or a combination of them. Nevertheless, these approaches simply assume balanced execution times among homogeneous servers (by uniformly distributing the document collection among them, for instance)—a scenario that we did not observe in our experimentation. On the contrary, we found that even with a balanced distribution of the document collection among index servers, correlations between the frequency of a term in the query log and the size of its corresponding inverted list lead to imbalances in query execution times at these same servers, because these correlations affect disk caching behavior. Further, the relative sizes of the main memory at each server (with regard to disk space usage) and the number of servers participating in the parallel query processing also affect imbalance of local query execution times. These are relevant findings that have not been reported before and that, we understand, are of interest to the research community.

论文关键词:Parallel query processing,Imbalance,Search engines,Performance analysis

论文评审过程:Received 23 December 2005, Revised 28 April 2006, Accepted 8 September 2006, Available online 1 November 2006.

论文官网地址:https://doi.org/10.1016/j.ipm.2006.09.002