Queuing theory-based latency/power tradeoff models for replicated search engines

Freire, A., Macdonald, C., Tonellotto, N., Ounis, I. and Cacheda, F. (2015) Queuing theory-based latency/power tradeoff models for replicated search engines. Journal of Universal Computer Science, 21(13), pp. 1790-1809. (doi:10.3217/jucs-021-13-1790)

[img]
Preview
Text
135013.pdf - Published Version

172kB

Publisher's URL: http://www.jucs.org/doi?doi=10.3217/jucs-021-13-1790

Abstract

Large-scale search engines are built upon huge infrastructures involving thousands of computers in order to achieve fast response times. In contrast, the energy consumed (and hence the financial cost) is also high, leading to environmental damage. This paper proposes new approaches to increase energy and financial savings in large-scale search engines, while maintaining good query response times. We aim to improve current state-of-the-art models used for balancing power and latency, by integrating new advanced features. On one hand, we propose to improve the power savings by completely powering down the query servers that are not necessary when the load of the system is low. Besides, we consider energy rates into the model formulation. On the other hand, we focus on how to accurately estimate the latency of the whole system by means of Queueing Theory. Experiments using actual query logs attest the high energy (and financial) savings regarding current baselines. To the best of our knowledge, this is the first paper in successfully applying stationary Queueing Theory models to estimate the latency in a large-scale search engine.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Macdonald, Dr Craig and Ounis, Professor Iadh
Authors: Freire, A., Macdonald, C., Tonellotto, N., Ounis, I., and Cacheda, F.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Journal of Universal Computer Science
Publisher:Graz University of Technology, Institut für Informationssysteme und Computer Medien
ISSN:0948-695X
ISSN (Online):0948-6968

University Staff: Request a correction | Enlighten Editors: Update this record