A Fuzzy-Based Scheduling Algorithm for Prediction of Next CPU-Burst Time to Implement Shortest Process Next

Abdolghader Pourali, A. Rahmani
{"title":"A Fuzzy-Based Scheduling Algorithm for Prediction of Next CPU-Burst Time to Implement Shortest Process Next","authors":"Abdolghader Pourali, A. Rahmani","doi":"10.1109/IACSIT-SC.2009.83","DOIUrl":null,"url":null,"abstract":"Practical use of SJF scheduling algorithm (SPN or Shortest Process Next), which is one of the best scheduling algorithms, always has some difficulties because when an operating system wants to execute a process, it does not know the execution time of it. After running, the exact execution time of that process would appear. Consequently, for calculating and estimating the execution time of a process before running, many algorithms were introduced. In this paper, a new algorithm with more efficiency is introduced. This algorithm is able to estimate the execution time (next CPU-burst time) of a process based on past behavior by using the intelligent fuzzy system.","PeriodicalId":286158,"journal":{"name":"2009 International Association of Computer Science and Information Technology - Spring Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Association of Computer Science and Information Technology - Spring Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IACSIT-SC.2009.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Practical use of SJF scheduling algorithm (SPN or Shortest Process Next), which is one of the best scheduling algorithms, always has some difficulties because when an operating system wants to execute a process, it does not know the execution time of it. After running, the exact execution time of that process would appear. Consequently, for calculating and estimating the execution time of a process before running, many algorithms were introduced. In this paper, a new algorithm with more efficiency is introduced. This algorithm is able to estimate the execution time (next CPU-burst time) of a process based on past behavior by using the intelligent fuzzy system.
一种预测下一次cpu突发时间的模糊调度算法,以实现下一个进程最短
SJF调度算法(SPN或最短进程Next)是最好的调度算法之一,在实际应用中总是遇到一些困难,因为当操作系统想要执行一个进程时,它不知道该进程的执行时间。运行后,将显示该进程的确切执行时间。因此,为了在运行前计算和估计进程的执行时间,引入了许多算法。本文提出了一种效率更高的新算法。该算法利用智能模糊系统,根据进程过去的行为来估计进程的执行时间(下一次cpu突发时间)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信