资源消耗估算和规划

G. Grabarnik, Lev Kozakov, V. Lemberg, I. Rish, L. Shwartz
{"title":"资源消耗估算和规划","authors":"G. Grabarnik, Lev Kozakov, V. Lemberg, I. Rish, L. Shwartz","doi":"10.1109/CONIELECOMP.2007.78","DOIUrl":null,"url":null,"abstract":"An estimation of task resource demands is an important area of research in Grid computing. Efficiency of managing and planning resources and tasks in heterogeneous computer systems depends heavily on the accuracy of estimating each task resource demands. In this paper we explain how building the task work path for one fixed background loading and approximating the task resource consumption is applied to the resource consumption estimate for the tasks running in the GRID environment. In addition we address dimensional blowout by approximating the CWG matrix based on Markov clustering. This technique allows us to essentially reduce the resources and experiment time which are required for invariant generating and to make application of the method to the GRID scheduling and planning a reality.","PeriodicalId":288478,"journal":{"name":"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"GRID Resource Consumption Estimates and Planning\",\"authors\":\"G. Grabarnik, Lev Kozakov, V. Lemberg, I. Rish, L. Shwartz\",\"doi\":\"10.1109/CONIELECOMP.2007.78\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An estimation of task resource demands is an important area of research in Grid computing. Efficiency of managing and planning resources and tasks in heterogeneous computer systems depends heavily on the accuracy of estimating each task resource demands. In this paper we explain how building the task work path for one fixed background loading and approximating the task resource consumption is applied to the resource consumption estimate for the tasks running in the GRID environment. In addition we address dimensional blowout by approximating the CWG matrix based on Markov clustering. This technique allows us to essentially reduce the resources and experiment time which are required for invariant generating and to make application of the method to the GRID scheduling and planning a reality.\",\"PeriodicalId\":288478,\"journal\":{\"name\":\"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIELECOMP.2007.78\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIELECOMP.2007.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

任务资源需求估计是网格计算中的一个重要研究领域。在异构计算机系统中,管理和规划资源和任务的效率在很大程度上取决于对每个任务资源需求的估计的准确性。在本文中,我们解释了如何为一个固定的后台负载构建任务工作路径并近似任务资源消耗应用于GRID环境中运行的任务的资源消耗估计。此外,我们通过基于马尔可夫聚类的近似CWG矩阵来解决维度井喷问题。该技术使我们能够从根本上减少不变量生成所需的资源和实验时间,并使该方法应用于GRID调度和规划成为现实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GRID Resource Consumption Estimates and Planning
An estimation of task resource demands is an important area of research in Grid computing. Efficiency of managing and planning resources and tasks in heterogeneous computer systems depends heavily on the accuracy of estimating each task resource demands. In this paper we explain how building the task work path for one fixed background loading and approximating the task resource consumption is applied to the resource consumption estimate for the tasks running in the GRID environment. In addition we address dimensional blowout by approximating the CWG matrix based on Markov clustering. This technique allows us to essentially reduce the resources and experiment time which are required for invariant generating and to make application of the method to the GRID scheduling and planning a reality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信