自重构对象的自适应调度

Mahdillah Mahdillah, Shinya Nakayama, Qian Zhao, Takaichi Yoshida
{"title":"自重构对象的自适应调度","authors":"Mahdillah Mahdillah, Shinya Nakayama, Qian Zhao, Takaichi Yoshida","doi":"10.1109/CANDARW.2018.00068","DOIUrl":null,"url":null,"abstract":"The execution environment of a real-world distributed system can change dramatically in terms of CPU workload, memory utilization, network traffic, etc. Therefore, an object-oriented distributed environment called Juice was developed in our previous research. Applications developed with Juice have the capability of reconfiguring itself during runtime in order to adapt changes of the execution environment. In this work, we propose a base level adaptable scheduling for the execution of self-reconfigurable objects in Juice. The adaptable scheduler can dynamically change the scheduling policy to meet the user's performance target when the execution environment changed. Evaluation results show that in a low CPU workload environment, FCFS (First Come First Serve) policy has a similar performance with SJF (Shortest Job First) policy and LJF (Longest Job First) policy with lower scheduling overhead. However, when the CPU workload becomes heavy, SJF or LJF has a better response time depending on the ratio of long jobs and the number of worker threads of Juice.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Adaptable Scheduling for Self-Reconfigurable Objects\",\"authors\":\"Mahdillah Mahdillah, Shinya Nakayama, Qian Zhao, Takaichi Yoshida\",\"doi\":\"10.1109/CANDARW.2018.00068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The execution environment of a real-world distributed system can change dramatically in terms of CPU workload, memory utilization, network traffic, etc. Therefore, an object-oriented distributed environment called Juice was developed in our previous research. Applications developed with Juice have the capability of reconfiguring itself during runtime in order to adapt changes of the execution environment. In this work, we propose a base level adaptable scheduling for the execution of self-reconfigurable objects in Juice. The adaptable scheduler can dynamically change the scheduling policy to meet the user's performance target when the execution environment changed. Evaluation results show that in a low CPU workload environment, FCFS (First Come First Serve) policy has a similar performance with SJF (Shortest Job First) policy and LJF (Longest Job First) policy with lower scheduling overhead. However, when the CPU workload becomes heavy, SJF or LJF has a better response time depending on the ratio of long jobs and the number of worker threads of Juice.\",\"PeriodicalId\":329439,\"journal\":{\"name\":\"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CANDARW.2018.00068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDARW.2018.00068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

真实的分布式系统的执行环境可能在CPU工作负载、内存利用率、网络流量等方面发生巨大变化。因此,我们在之前的研究中开发了一个名为Juice的面向对象分布式环境。使用Juice开发的应用程序能够在运行时重新配置自身,以适应执行环境的变化。在这项工作中,我们提出了一种基本级别的自适应调度,用于Juice中自重构对象的执行。适应性调度器可以在执行环境发生变化时动态更改调度策略,以满足用户的性能目标。评估结果表明,在低CPU负载环境下,FCFS(先到先服务)策略与SJF(最短作业优先)策略和LJF(最长作业优先)策略具有相似的性能,并且调度开销更低。但是,当CPU工作负载变得繁重时,SJF或LJF的响应时间会更好,这取决于长作业的比例和Juice的工作线程数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Adaptable Scheduling for Self-Reconfigurable Objects
The execution environment of a real-world distributed system can change dramatically in terms of CPU workload, memory utilization, network traffic, etc. Therefore, an object-oriented distributed environment called Juice was developed in our previous research. Applications developed with Juice have the capability of reconfiguring itself during runtime in order to adapt changes of the execution environment. In this work, we propose a base level adaptable scheduling for the execution of self-reconfigurable objects in Juice. The adaptable scheduler can dynamically change the scheduling policy to meet the user's performance target when the execution environment changed. Evaluation results show that in a low CPU workload environment, FCFS (First Come First Serve) policy has a similar performance with SJF (Shortest Job First) policy and LJF (Longest Job First) policy with lower scheduling overhead. However, when the CPU workload becomes heavy, SJF or LJF has a better response time depending on the ratio of long jobs and the number of worker threads of Juice.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Improving Data Transfer Efficiency for Accelerators Using Hardware Compression Tile Art Image Generation Using Conditional Generative Adversarial Networks A New Higher Order Differential of FeW Non-volatile Memory Driver for Applying Automated Tiered Storage with Fast Memory and Slow Flash Storage DHT Clustering for Load Balancing Considering Blockchain Data Size
×
引用
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