首页    期刊浏览 2025年06月20日 星期五
登录注册

文章基本信息

  • 标题:Finding Best Time Quantum for Round Robin Scheduling Algorithm to avoid Frequent Context Switch
  • 本地全文:下载
  • 作者:D Praveen Kumar ; T. Sreenivasula Reddy ; A. Yugandhar Reddy
  • 期刊名称:International Journal of Computer Science and Information Technologies
  • 电子版ISSN:0975-9646
  • 出版年度:2014
  • 卷号:5
  • 期号:5
  • 页码:6750-6754
  • 出版社:TechScience Publications
  • 摘要:In Round Robin scheduling, the time quantum is fastened then processes area unit scheduled specified no process get CPU time quite only once quantum in one go. If time quantum is simply too massive, the time interval of the processes is too much which cannot be tolerated in interactive atmosphere. If time quantum is simply too little, it causes unnecessarily frequent context switch resulting in more overheads leading to less throughput. During this paper, a technique using integer programming has been projected to resolve equations that decide a price that’s neither too large nor too little such that each method has affordable time interval and the throughput of the system isn’t attenuated as a result of unnecessarily context switches
  • 关键词:Round Robin; Time Slice; Throughput; context;switch; integer programming
国家哲学社会科学文献中心版权所有