Service Deployment Algorithms for Vertical Search Engines

V. Gil-Costa, Alonso Inostrosa-Psijas, Mauricio Marín, E. Feuerstein
{"title":"Service Deployment Algorithms for Vertical Search Engines","authors":"V. Gil-Costa, Alonso Inostrosa-Psijas, Mauricio Marín, E. Feuerstein","doi":"10.1109/PDP.2013.28","DOIUrl":null,"url":null,"abstract":"Web search engines are systems devised to cope with highly dynamic and demanding query rates. These systems are composed by several services, each one dedicated to execute a single operation required to solve a query. Services are allocated into thousand of multi-core processors organized in racks. Some services communicate more than others, so it is desirable to put them in the same rack. In this work, we present and evaluate deployment algorithms for a web search engine. In particular, we focus on vertical search engines with specific on-line content which may include shopping, advertisement, etc.. Our goal is to improve the performance of a search engine by reducing communication time. Communication among services is performed by means of a fast and complex network supporting parallel sending and receiving of messages. We propose a communication-graph-based method, in which processors are the nodes of the graph and communication between them is represented as weighted arcs. Results show that our proposal method is able to reduce maximum query response time.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDP.2013.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Web search engines are systems devised to cope with highly dynamic and demanding query rates. These systems are composed by several services, each one dedicated to execute a single operation required to solve a query. Services are allocated into thousand of multi-core processors organized in racks. Some services communicate more than others, so it is desirable to put them in the same rack. In this work, we present and evaluate deployment algorithms for a web search engine. In particular, we focus on vertical search engines with specific on-line content which may include shopping, advertisement, etc.. Our goal is to improve the performance of a search engine by reducing communication time. Communication among services is performed by means of a fast and complex network supporting parallel sending and receiving of messages. We propose a communication-graph-based method, in which processors are the nodes of the graph and communication between them is represented as weighted arcs. Results show that our proposal method is able to reduce maximum query response time.
垂直搜索引擎的服务部署算法
Web搜索引擎是为处理高动态和高要求的查询率而设计的系统。这些系统由多个服务组成,每个服务专门执行解决查询所需的单个操作。服务被分配到数千个多核处理器中,这些处理器组织在机架中。有些服务比其他服务通信更多,因此最好将它们放在同一个机架中。在这项工作中,我们提出并评估了一个web搜索引擎的部署算法。特别是,我们专注于垂直搜索引擎与特定的在线内容,可能包括购物,广告等。我们的目标是通过减少交流时间来提高搜索引擎的性能。服务之间的通信是通过支持消息并行发送和接收的快速和复杂的网络来执行的。我们提出了一种基于通信图的方法,其中处理器是图的节点,它们之间的通信用加权弧线表示。结果表明,该方法能够有效地缩短最大查询响应时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信