• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Power, Control, Signals and Instrumentation Engineering >Modified Round Robin algorithm (MRR)
【24h】

Modified Round Robin algorithm (MRR)

机译：修正的循环算法（MRR）

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

CPU Scheduling Algorithms form the basic and fundamental concepts of Operating Systems. A scheduling algorithm is used to produce effective switches between the processes present in the ready queue. Round Robin algorithm is one among the many CPU scheduling algorithms where every process executes for a given time quantum (TQ). Therefore the system efficiency and performance are completely dependent on the value of TQ. If this value is static in nature, then the CPU performance decreases. This paper uses the dynamic TQ to create an efficient Round Robin Algorithm. This goal was achieved by using the concept of median. The traditional RR algorithm does not take priority under the consideration, which further reduces the CPU performance. The proposed algorithm improves the efficiency of the traditional RR algorithm by considering all the factors like priority, burst time and arrival time of the processes to arrange them in the ready queue and generating TQ accordingly; which effectively reduces the Waiting time, Turn-around time, and the number of context switches. The paper also presents a detailed comparison between the proposed algorithm and existing algorithms.
机译：CPU调度算法构成了操作系统的基本概念。调度算法用于在就绪队列中存在的进程之间产生有效的切换。循环算法是众多CPU调度算法中的一种，其中每个进程都在给定的时间范围（TQ）内执行。因此，系统效率和性能完全取决于TQ的值。如果此值本质上是静态的，则CPU性能会降低。本文使用动态TQ来创建有效的Round Robin算法。通过使用中位数的概念实现了这一目标。考虑到传统的RR算法没有优先考虑，这进一步降低了CPU性能。该算法考虑了优先级，突发时间和进程到达时间等所有因素，将它们安排在就绪队列中并相应地生成TQ，从而提高了传统RR算法的效率。这有效地减少了等待时间，周转时间和上下文切换次数。本文还提出了所提出的算法与现有算法的详细比较。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号