Estimating job execution time and handling missing job requirements using rough set in grid scheduling

S. Thamarai Selvi, M. Sheeba Santha Kumari, K. Prabavathi, G. Kannan
{"title":"Estimating job execution time and handling missing job requirements using rough set in grid scheduling","authors":"S. Thamarai Selvi, M. Sheeba Santha Kumari, K. Prabavathi, G. Kannan","doi":"10.1109/ICCDA.2010.5541135","DOIUrl":null,"url":null,"abstract":"Efficient scheduling of jobs in grid environment is a challenging task. To perform better resource utilization and proper resource allocation, the factor job runtime is essential. Accurate estimation of runtime helps to reserve resources in advance, provide user level QoS. But it is difficult to estimate the runtime of data intensive applications. Users are required to provide the runtime estimate of the job, but the user given estimates are inaccurate leading to poor scheduling. In this paper, we have used rough set techniques to analyse the history of jobs and estimate the runtime of the job. This requires maintaining a history of jobs that have executed along with their respective runtime. Our proposed rough set engine groups similar jobs and identifies the group to which the newly submitted job belongs. Based on this similar group identified, the runtime is estimated. Mostly users are not aware of resources, submitting incomplete job requirements. These missing job requirements affect data analysis. Those missing values should be accurately predicted. Missing value handler designed using rough sets fills the most probable value for missing attributes and then the runtime is estimated.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference On Computer Design and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCDA.2010.5541135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Efficient scheduling of jobs in grid environment is a challenging task. To perform better resource utilization and proper resource allocation, the factor job runtime is essential. Accurate estimation of runtime helps to reserve resources in advance, provide user level QoS. But it is difficult to estimate the runtime of data intensive applications. Users are required to provide the runtime estimate of the job, but the user given estimates are inaccurate leading to poor scheduling. In this paper, we have used rough set techniques to analyse the history of jobs and estimate the runtime of the job. This requires maintaining a history of jobs that have executed along with their respective runtime. Our proposed rough set engine groups similar jobs and identifies the group to which the newly submitted job belongs. Based on this similar group identified, the runtime is estimated. Mostly users are not aware of resources, submitting incomplete job requirements. These missing job requirements affect data analysis. Those missing values should be accurately predicted. Missing value handler designed using rough sets fills the most probable value for missing attributes and then the runtime is estimated.
网格调度中使用粗糙集估计作业执行时间和处理缺失作业需求
网格环境下作业的高效调度是一个具有挑战性的课题。要执行更好的资源利用和适当的资源分配,因子作业运行时是必不可少的。准确估计运行时间有助于提前预留资源,提供用户级QoS。但是数据密集型应用程序的运行时间很难估计。用户需要提供作业的运行时估计,但是用户给出的估计是不准确的,会导致糟糕的调度。在本文中,我们使用粗糙集技术来分析作业的历史并估计作业的运行时间。这需要维护已执行的作业的历史记录及其各自的运行时。我们建议的粗糙集引擎对相似的作业进行分组,并标识新提交的作业所属的组。基于所识别的相似组,估计运行时。大多数用户不知道资源,提交不完整的作业需求。这些缺失的工作要求影响了数据分析。应该准确地预测那些缺失的值。使用粗糙集设计的缺失值处理程序填充缺失属性的最可能值,然后估计运行时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信