首页> 外文会议>Computer Science and Information Technology - Spring Conference, 2009. IACSITSC '09 >A Fuzzy-Based Scheduling Algorithm for Prediction of Next CPU-Burst Time to Implement Shortest Process Next
【24h】

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

机译:基于模糊的调度算法预测下一个最短进程的下一个CPU突发时间

获取原文

摘要

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.
机译:作为最佳调度算法之一的SJF调度算法(SPN或最短进程下一步)的实际使用始终会遇到一些困难,因为当操作系统要执行某个进程时,它不知道其执行时间。运行后,将显示该进程的确切执行时间。因此,为了计算和估计进程在运行之前的执行时间,引入了许多算法。本文介绍了一种效率更高的新算法。通过使用智能模糊系统,该算法能够根据过去的行为来估计进程的执行时间(下一个CPU突发时间)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号