A novel algorithm for process scheduling in multi processor systems

A. Bagherinia, A. Joharpour, S. Hojatkhah, A. Bemana
{"title":"A novel algorithm for process scheduling in multi processor systems","authors":"A. Bagherinia, A. Joharpour, S. Hojatkhah, A. Bemana","doi":"10.1109/ICEELI.2012.6360583","DOIUrl":null,"url":null,"abstract":"Ever process scheduling in single and multi processors systems is one of the most focused research problem. In this paper we propose an approach for process scheduling based on back tracking technique. This approach considered TFT (Total Finish Time) as a main parameter. We limited load of each processor that not greater than ideal measure. Proposed approach always is resulted to optimized solution. Simulation shows that its results are better than LPT (Longest processing time), SPT (Shortest processing time) and PSO (Particle swarm optimization) algorithms.","PeriodicalId":398065,"journal":{"name":"International Conference on Education and e-Learning Innovations","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Education and e-Learning Innovations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEELI.2012.6360583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Ever process scheduling in single and multi processors systems is one of the most focused research problem. In this paper we propose an approach for process scheduling based on back tracking technique. This approach considered TFT (Total Finish Time) as a main parameter. We limited load of each processor that not greater than ideal measure. Proposed approach always is resulted to optimized solution. Simulation shows that its results are better than LPT (Longest processing time), SPT (Shortest processing time) and PSO (Particle swarm optimization) algorithms.
一种新的多处理机系统进程调度算法
单处理机和多处理机系统中的任意进程调度是目前研究的热点问题之一。本文提出了一种基于回溯技术的工艺调度方法。这种方法将TFT(总完成时间)作为主要参数。我们限制了每个处理器的负载,使其不超过理想的度量。所提出的方法总是得到最优解。仿真结果表明,该算法优于LPT (Longest processing time)、SPT (Shortest processing time)和PSO (Particle swarm optimization)算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信