Determination of Optimal Thread Pool for Cloud Based Concurrent Enhanced No-Escape Search

Harshit Gujral, Abhinav Sharma, S. Mittal
{"title":"Determination of Optimal Thread Pool for Cloud Based Concurrent Enhanced No-Escape Search","authors":"Harshit Gujral, Abhinav Sharma, S. Mittal","doi":"10.1109/IC3.2018.8530645","DOIUrl":null,"url":null,"abstract":"In this era of high demand for cloud-computing, concurrent and high-performance processing is the viable option to enhance performance and use available resources efficiently. Thread pool architecture is widely implemented in order to improve resource utilization and enhance performance. Studies in this field suggest that Thread pool size is mostly determined by heuristics, trials, or practical experience. This process lacks precision and theoretical justification. In this paper, a novel Hyperbola-based Thread-Pool Analysis (HTA) technique for determining optimal Thread Pool size by considering available bandwidth (upload/download speed) and workload (file-size) has been proposed for any cloud-based concurrent process. Here, HTA has been developed in the context of No-Escape Search (NES), a cloud-based content indexing and search system, proposed by authors in an earlier work. Results of HTA indicate an accuracy of 97.63% in estimation of optimal thread pool size. Incorporating HTA with No-Escape Search resulted a significant decrease in insertion time by 2236 folds and retrieval time by 1747 folds. Additionally, this paper also presents design of enhanced NES with features like pictorial representation of files for the visual summary, more efficient deletion algorithm using lazy delete and duplicate files detection in order to ensure efficient indexing.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2018.8530645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this era of high demand for cloud-computing, concurrent and high-performance processing is the viable option to enhance performance and use available resources efficiently. Thread pool architecture is widely implemented in order to improve resource utilization and enhance performance. Studies in this field suggest that Thread pool size is mostly determined by heuristics, trials, or practical experience. This process lacks precision and theoretical justification. In this paper, a novel Hyperbola-based Thread-Pool Analysis (HTA) technique for determining optimal Thread Pool size by considering available bandwidth (upload/download speed) and workload (file-size) has been proposed for any cloud-based concurrent process. Here, HTA has been developed in the context of No-Escape Search (NES), a cloud-based content indexing and search system, proposed by authors in an earlier work. Results of HTA indicate an accuracy of 97.63% in estimation of optimal thread pool size. Incorporating HTA with No-Escape Search resulted a significant decrease in insertion time by 2236 folds and retrieval time by 1747 folds. Additionally, this paper also presents design of enhanced NES with features like pictorial representation of files for the visual summary, more efficient deletion algorithm using lazy delete and duplicate files detection in order to ensure efficient indexing.
基于云的并发增强无escape搜索的最优线程池确定
在这个对云计算有高需求的时代,并发和高性能处理是提高性能和有效利用可用资源的可行选择。线程池架构是为了提高资源利用率和提高性能而广泛实现的。该领域的研究表明,线程池大小主要由启发式、试验或实际经验决定。这一过程缺乏精确性和理论依据。本文提出了一种新的基于双曲线的线程池分析(HTA)技术,该技术通过考虑可用带宽(上传/下载速度)和工作负载(文件大小)来确定任何基于云的并发进程的最佳线程池大小。在这里,HTA是在无逃逸搜索(NES)的背景下开发的,这是一种基于云的内容索引和搜索系统,由作者在早期的工作中提出。HTA结果表明,估计最佳线程池大小的准确率为97.63%。将HTA与No-Escape Search结合后,插入时间和检索时间分别减少2236倍和1747倍。此外,本文还提出了增强型网元的设计,包括文件的图形化表示,用于可视化摘要,更有效的删除算法,使用延迟删除和重复文件检测,以确保有效的索引。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信