Investigating a Benchmark Cloud Media Resource Allocation and Optimization - TI Journals

M. Nosrati, Ronak Karimi
{"title":"Investigating a Benchmark Cloud Media Resource Allocation and Optimization - TI Journals","authors":"M. Nosrati, Ronak Karimi","doi":"10.21828/wap-06-01-002","DOIUrl":null,"url":null,"abstract":"Abstract: The essence of high performance computing systems emerged with the extension of big data issues and it entailed to cloud and other HPC systems to come into existence. A challenging issue in designing such systems is resource allocation, which explicitly affects the total efficiency of system by involving factors like the number of nodes, geographical distance, communication latencies, etc. \nIn this study, authors will take a look at resource allocation issue in HPCs especially in clouds. Due to it, after a short introduction, different challenges are investigated. Then, one of the most common methods of resource allocation through resource broker is probes. Resource broker is an entity that allocates the resources to the applicants based on the policies of the system. For instance, it might allocate the resources with the lowest price to the applicants with the highest budgets. Prices and budgets are also calculated according to the policies of the system, e.g. based on the media resource’s computing ability, media resource’s lowest and highest prices, etc. For this purpose, resource broker constructs probability matrix P and do the resource allocation based on it. Also, the way of optimizing the matrix P is explained. Results of this method will be the balancing the workload of resource nodes with the number of applicants.","PeriodicalId":185476,"journal":{"name":"World Applied Programming","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Applied Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21828/wap-06-01-002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Abstract: The essence of high performance computing systems emerged with the extension of big data issues and it entailed to cloud and other HPC systems to come into existence. A challenging issue in designing such systems is resource allocation, which explicitly affects the total efficiency of system by involving factors like the number of nodes, geographical distance, communication latencies, etc. In this study, authors will take a look at resource allocation issue in HPCs especially in clouds. Due to it, after a short introduction, different challenges are investigated. Then, one of the most common methods of resource allocation through resource broker is probes. Resource broker is an entity that allocates the resources to the applicants based on the policies of the system. For instance, it might allocate the resources with the lowest price to the applicants with the highest budgets. Prices and budgets are also calculated according to the policies of the system, e.g. based on the media resource’s computing ability, media resource’s lowest and highest prices, etc. For this purpose, resource broker constructs probability matrix P and do the resource allocation based on it. Also, the way of optimizing the matrix P is explained. Results of this method will be the balancing the workload of resource nodes with the number of applicants.
调查基准云媒体资源分配和优化- TI期刊
摘要:高性能计算系统的本质是随着大数据问题的扩展而出现的,它需要云和其他高性能计算系统的出现。在设计此类系统时,一个具有挑战性的问题是资源分配,它涉及到节点数量、地理距离、通信延迟等因素,从而明显影响系统的总效率。在本研究中,作者将着眼于高性能计算中的资源分配问题,特别是在云环境中。因此,在简短的介绍之后,研究了不同的挑战。然后,通过资源代理进行资源分配的最常用方法之一是探测。资源代理是一个实体,它根据系统的策略将资源分配给申请人。例如,它可能会将价格最低的资源分配给预算最高的申请人。价格和预算也根据系统的政策进行计算,例如根据媒体资源的计算能力,媒体资源的最低和最高价格等。为此,资源代理构造概率矩阵P,并以此为基础进行资源分配。并给出了优化矩阵P的方法。这种方法的结果将是平衡资源节点的工作负载与申请人的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书