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}
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.