An Improved Hierarchal Agglomerative Grouping Process and Bi-Objective Fusion Optimization Process for Optimum Source Detection

D. Srinivas, J. N, T. Raghavendra Gupta, G. Shivakanth, N. Samanvita
{"title":"An Improved Hierarchal Agglomerative Grouping Process and Bi-Objective Fusion Optimization Process for Optimum Source Detection","authors":"D. Srinivas, J. N, T. Raghavendra Gupta, G. Shivakanth, N. Samanvita","doi":"10.1109/ICICACS57338.2023.10099663","DOIUrl":null,"url":null,"abstract":"Computing in the cloud refers to a model that offers inexpensive, scalable computing resources like CPU, storage, and network bandwidth. Allows users to access a shared pool of resources via the internet on an as-needed, pay-per-use basis. In order to organize tools, this chapter suggests using the Hierarchical Agglomerative clustering algorithm. The time spent searching through a pool of available resources can be minimized by categorizing them. Thanks to the categorization of resources, the one needed to fulfill a request can be found and assigned in a flash. The following outline is used for this section. The paper explains the rationale behind the proposed approach and details the resource discovery method that underpins it. Describes and evaluates the proposed system's performance by utilizing a hybrid of the artificial bee colony (ABC) algorithm and the cuckoo search (CS) algorithm to allocate resources to requests. There are many issues with efficient resource allocation that cannot be solved using current methods. The existing research work identified and tackled the problem of optimizing the parameters (make span, execution time, deadline, execution cost, etc.) using optimization algorithms. However, most existing algorithms require more time to allocate resources because of the vast number of resources available in the cloud. The process also depends on the efficiency of the underlying optimization algorithm.","PeriodicalId":274807,"journal":{"name":"2023 IEEE International Conference on Integrated Circuits and Communication Systems (ICICACS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE International Conference on Integrated Circuits and Communication Systems (ICICACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICACS57338.2023.10099663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Computing in the cloud refers to a model that offers inexpensive, scalable computing resources like CPU, storage, and network bandwidth. Allows users to access a shared pool of resources via the internet on an as-needed, pay-per-use basis. In order to organize tools, this chapter suggests using the Hierarchical Agglomerative clustering algorithm. The time spent searching through a pool of available resources can be minimized by categorizing them. Thanks to the categorization of resources, the one needed to fulfill a request can be found and assigned in a flash. The following outline is used for this section. The paper explains the rationale behind the proposed approach and details the resource discovery method that underpins it. Describes and evaluates the proposed system's performance by utilizing a hybrid of the artificial bee colony (ABC) algorithm and the cuckoo search (CS) algorithm to allocate resources to requests. There are many issues with efficient resource allocation that cannot be solved using current methods. The existing research work identified and tackled the problem of optimizing the parameters (make span, execution time, deadline, execution cost, etc.) using optimization algorithms. However, most existing algorithms require more time to allocate resources because of the vast number of resources available in the cloud. The process also depends on the efficiency of the underlying optimization algorithm.
一种改进的层次聚集分组过程和双目标融合优化过程用于最优源检测
云计算指的是一种提供廉价、可扩展的计算资源(如CPU、存储和网络带宽)的模型。允许用户在按需、按使用付费的基础上通过internet访问共享资源池。为了组织工具,本章建议使用分层凝聚聚类算法。通过对可用资源进行分类,可以最大限度地减少在可用资源池中搜索所花费的时间。由于对资源进行了分类,可以在一瞬间找到并分配完成请求所需的资源。本节使用以下大纲。本文解释了提出的方法背后的基本原理,并详细说明了支持它的资源发现方法。利用人工蜂群(ABC)算法和布谷鸟搜索(CS)算法的混合算法来为请求分配资源,描述和评估所提出的系统性能。在资源的有效分配方面,有许多问题是现有方法无法解决的。现有的研究工作确定并解决了使用优化算法优化参数(制作跨度、执行时间、截止日期、执行成本等)的问题。然而,由于云中有大量可用的资源,大多数现有算法需要更多的时间来分配资源。这个过程还取决于底层优化算法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信