An Architecture for an Adaptive Run-time Prediction System

C. Glasner, J. Volkert
{"title":"An Architecture for an Adaptive Run-time Prediction System","authors":"C. Glasner, J. Volkert","doi":"10.1109/ISPDC.2008.34","DOIUrl":null,"url":null,"abstract":"This article describes a system for run-time prediction of applications in heterogeneous environments. To exploit the power of computational grids, scheduling systems need profound information about the job to be executed. The run-time of a job is - beside others - not only dependent of its kind and complexity but also of the adequacy and load of the remote host where it will be executed. Accounting and billing are additional aspects that have to be considered when creating a schedule. Currently predictions are achieved by using descriptive models of the applications or by applying statistical methods to former jobs mostly neglecting the behaviour of users. Motivated by this, we propose a method that is not only based on the characteristics of a job but also takes the behaviour of single users and groups of similar users respectively into account. The basic idea of our approach is to cluster users, hosts and jobs and apply multiple methods in order to detect similarities and create forecasts. This is achieved by tagging jobs with attributes and by deriving predictions for similar attributed jobs whereas the recent behaviour of a user determines which predictions are finally taken.","PeriodicalId":125975,"journal":{"name":"2008 International Symposium on Parallel and Distributed Computing","volume":"154 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2008.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

This article describes a system for run-time prediction of applications in heterogeneous environments. To exploit the power of computational grids, scheduling systems need profound information about the job to be executed. The run-time of a job is - beside others - not only dependent of its kind and complexity but also of the adequacy and load of the remote host where it will be executed. Accounting and billing are additional aspects that have to be considered when creating a schedule. Currently predictions are achieved by using descriptive models of the applications or by applying statistical methods to former jobs mostly neglecting the behaviour of users. Motivated by this, we propose a method that is not only based on the characteristics of a job but also takes the behaviour of single users and groups of similar users respectively into account. The basic idea of our approach is to cluster users, hosts and jobs and apply multiple methods in order to detect similarities and create forecasts. This is achieved by tagging jobs with attributes and by deriving predictions for similar attributed jobs whereas the recent behaviour of a user determines which predictions are finally taken.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
自适应运行时预测系统的体系结构
本文描述了一个用于异构环境中应用程序运行时预测的系统。为了利用计算网格的力量,调度系统需要关于要执行的任务的深刻信息。作业的运行时间不仅取决于作业的类型和复杂性,还取决于执行作业的远程主机的适当性和负载。会计和账单是创建计划时必须考虑的额外方面。目前的预测是通过使用应用程序的描述性模型或通过将统计方法应用于以前的工作来实现的,这些工作大多忽略了用户的行为。受此启发,我们提出了一种方法,该方法不仅基于工作的特征,而且还分别考虑了单个用户和相似用户群体的行为。我们的方法的基本思想是将用户、主机和作业聚类,并应用多种方法来检测相似性并创建预测。这是通过标记带有属性的作业,并通过对类似的属性作业进行预测来实现的,而用户最近的行为决定了最终采用哪些预测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Security Hardening of Scientific Demand-Driven and Pipelined Distributed Computing Systems A Runtime System Architecture for Ubiquitous Support of OpenMP Context Modeling for Urban Mobile Applications Derivation Control Environment as a Tool for an Efficient Distributed Graph Transformations Coordination Investigating a Dynamic Loop Scheduling with Reinforcement Learning Approach to Load Balancing in Scientific Applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1