Attitudinal data based server job scheduling using genetic algorithms: Client-centric job scheduling for single threaded servers

M. Chawla, Kriti Singh, C. Kumar
{"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.
使用遗传算法的基于态度数据的服务器作业调度:单线程服务器的以客户机为中心的作业调度
随着web应用程序向实时设置(如web套接字)的发展,对更高效和特定于设置的调度技术的需求不断升级。因此,对于任何并发处理大量请求的服务器来说,有效的任务调度机制都是必不可少的。现有的任务调度算法不能满足这一目的,因为它们关注的是通用和最小化执行时间,而没有将系统架构和作业配置文件的特征与相关的用户代理实用程序结合起来。此外,传统的设置也不能利用从工作概况中获得的知识,考虑到它们被设计得更通用。为了提出一种全面高效的任务调度机制,本文主要研究单线程环境下的任务调度问题。此外,所提出的调度机制由遗传算法驱动,同时获取目标服务器需要服务的请求的概要信息,然后使用派生的知识来提高性能。实验结果表明,目标服务器的性能(在效率方面)得到了提高,同时优化了客户机用户代理实用程序。此外,所提出的模型在用户代理实用程序方面有了显著的改进,同时在精心设计的测试运行中保持了计算相同的可行常数时间,通过提供足够的覆盖率可以得出结论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信