Network-based resource allocation for Grid Computing within an SLA context

D. Quan, D. Hsu
{"title":"Network-based resource allocation for Grid Computing within an SLA context","authors":"D. Quan, D. Hsu","doi":"10.1109/GCC.2006.67","DOIUrl":null,"url":null,"abstract":"Service level agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for supporting of SLA-aware grid jobs, the SLA mapping mechanism receives important positions. It is responsible for assigning sub-jobs of the workflow to grid resource in a way that meet the user's deadline and as cheap as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within SLA context defines an unfamiliar problem and need a specific method to be solved. This paper presents the mapping algorithm, which can cope with the problem. Performance measurements deliver evaluation results on the quality and efficiency of the method","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCC.2006.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Service level agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for supporting of SLA-aware grid jobs, the SLA mapping mechanism receives important positions. It is responsible for assigning sub-jobs of the workflow to grid resource in a way that meet the user's deadline and as cheap as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within SLA context defines an unfamiliar problem and need a specific method to be solved. This paper presents the mapping algorithm, which can cope with the problem. Performance measurements deliver evaluation results on the quality and efficiency of the method
SLA上下文中网格计算的基于网络的资源分配
服务水平协议(sla)是当前网格计算领域的主要研究课题之一。在支持SLA感知网格作业的众多系统组件中,SLA映射机制占有重要地位。它负责将工作流的子作业分配给网格资源,以满足用户的最后期限和尽可能便宜的方式。有了不同的工作负载和资源特征,在SLA上下文中映射繁重的通信工作流定义了一个不熟悉的问题,需要一个特定的方法来解决。本文提出了一种可以解决这一问题的映射算法。性能度量提供对方法的质量和效率的评估结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信