Load balancing distributed inverted files: Query ranking

Carlos Gomez-Pantoja, Mauricio Marin

Resultado de la investigación: Contribución a los tipos de informe/libroContribución a la conferenciarevisión exhaustiva

Resumen

Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computers and queries are received by a broker machine and scheduled for solution in the cluster. The broker must use a scheduling algorithm to assign queries to processors since the computations associated with the ranking of documents that form part of the solutions to queries can take a significant fraction of the total running time. The cost of this task can be highly variable and depends on the particular user preferences for words when formulating queries in a given period of time. Thus the scheduling algorithm must be able to cope efficiently with a highly dynamic and very large amount of jobs being assigned in an on-line manner to the processors. In this paper we evaluate a number of scheduling algorithms proposed in the literature in the context of scheduling queries on a search engine.

Idioma originalInglés
Título de la publicación alojadaProceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing, PDP 2008
Páginas329-333
Número de páginas5
DOI
EstadoPublicada - 22 jul 2008
Evento16th Euromicro Conference on Parallel, Distributed and Network-Based Processing, PDP 2008 - Toulouse, Francia
Duración: 13 feb 200815 feb 2008

Serie de la publicación

NombreProceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing, PDP 2008

Conferencia

Conferencia16th Euromicro Conference on Parallel, Distributed and Network-Based Processing, PDP 2008
País/TerritorioFrancia
CiudadToulouse
Período13/02/0815/02/08

Áreas temáticas de ASJC Scopus

  • Informática (todo)
  • Redes de ordenadores y comunicaciones

Huella

Profundice en los temas de investigación de 'Load balancing distributed inverted files: Query ranking'. En conjunto forman una huella única.

Citar esto