A Genetic Algorithm for Task Scheduling Based on User Overall Satisfaction

Xiaoguang Wang
{"title":"A Genetic Algorithm for Task Scheduling Based on User Overall Satisfaction","authors":"Xiaoguang Wang","doi":"10.1109/CyberC.2012.97","DOIUrl":null,"url":null,"abstract":"In traditional research on task scheduling algorithms based on user satisfaction, all users can only have the same satisfaction function that means system assumes all users have the same scheduling motivation. But in real distributed system, different users usually have different motivations. To solve this problem, in this paper, we propose a genetic scheduling algorithm based on user overall satisfaction, which is the sum of the value of every user satisfaction. This algorithm supports different satisfaction functions for different users, which meets the requirements of real distributed environment well.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2012.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In traditional research on task scheduling algorithms based on user satisfaction, all users can only have the same satisfaction function that means system assumes all users have the same scheduling motivation. But in real distributed system, different users usually have different motivations. To solve this problem, in this paper, we propose a genetic scheduling algorithm based on user overall satisfaction, which is the sum of the value of every user satisfaction. This algorithm supports different satisfaction functions for different users, which meets the requirements of real distributed environment well.
基于用户总体满意度的任务调度遗传算法
在传统的基于用户满意度的任务调度算法研究中,所有用户只能具有相同的满意函数,即系统假设所有用户具有相同的调度动机。但在真实的分布式系统中,不同的用户通常有不同的动机。为了解决这一问题,本文提出了一种基于用户总体满意度的遗传调度算法,用户总体满意度是每个用户满意度值的总和。该算法支持不同用户的不同满意函数,很好地满足了真实分布式环境的要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信