{"title":"Attitudinal data based server job scheduling using genetic algorithms: Client-centric job scheduling for single threaded servers","authors":"M. Chawla, Kriti Singh, C. Kumar","doi":"10.1109/IC3.2016.7880230","DOIUrl":null,"url":null,"abstract":"With the evolution of web applications towards real time setups, like web sockets, the need for more efficient and setup-specific scheduling techniques escalates. Thus, an effective task scheduling mechanism becomes the prime necessity for any server handling large number of requests concurrently. The existing task scheduling algorithms do not suffice this purpose due to their focus on being generic and minimizing the execution time, while failing to use the characteristics of the system architecture and job profiles with the associated user-agent utility. Additionally, the traditional setups also fail to exploit the knowledge derived from the job profiling, considering the fact they are designed to be more generic. In order to come up with a comprehensive and efficient mechanism, this paper focuses primarily on task scheduling for single threaded environments. Moreover, the proposed scheduling mechanism is driven by Genetic Algorithms (GA), while taking the profile(s) of requests to be served by the targeted server and then using the derived knowledge for enhancing the performance. The experimental results show that the performance of the target server (in terms of efficiency) improves, along with optimizing the client user-agent utility. Furthermore, the proposed model demonstrated significant improvement in user-agent utility while maintaining a viably constant time for computing the same under carefully designed test runs capable of being conclusive by providing enough coverage.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Ninth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2016.7880230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
With the evolution of web applications towards real time setups, like web sockets, the need for more efficient and setup-specific scheduling techniques escalates. Thus, an effective task scheduling mechanism becomes the prime necessity for any server handling large number of requests concurrently. The existing task scheduling algorithms do not suffice this purpose due to their focus on being generic and minimizing the execution time, while failing to use the characteristics of the system architecture and job profiles with the associated user-agent utility. Additionally, the traditional setups also fail to exploit the knowledge derived from the job profiling, considering the fact they are designed to be more generic. In order to come up with a comprehensive and efficient mechanism, this paper focuses primarily on task scheduling for single threaded environments. Moreover, the proposed scheduling mechanism is driven by Genetic Algorithms (GA), while taking the profile(s) of requests to be served by the targeted server and then using the derived knowledge for enhancing the performance. The experimental results show that the performance of the target server (in terms of efficiency) improves, along with optimizing the client user-agent utility. Furthermore, the proposed model demonstrated significant improvement in user-agent utility while maintaining a viably constant time for computing the same under carefully designed test runs capable of being conclusive by providing enough coverage.