CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Improvised Round Robin (CPU) Scheduling Algorithm

by Abhishek Sirohi, Aseem Pratap, Mayank Aggarwal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 99 - Number 18
Year of Publication: 2014
Authors: Abhishek Sirohi, Aseem Pratap, Mayank Aggarwal
10.5120/17475-8361

Abhishek Sirohi, Aseem Pratap, Mayank Aggarwal . Improvised Round Robin (CPU) Scheduling Algorithm. International Journal of Computer Applications. 99, 18 ( August 2014), 40-43. DOI=10.5120/17475-8361

@article{ 10.5120/17475-8361,
author = { Abhishek Sirohi, Aseem Pratap, Mayank Aggarwal },
title = { Improvised Round Robin (CPU) Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 99 },
number = { 18 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 40-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume99/number18/17475-8361/ },
doi = { 10.5120/17475-8361 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:28:33.874399+05:30
%A Abhishek Sirohi
%A Aseem Pratap
%A Mayank Aggarwal
%T Improvised Round Robin (CPU) Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 99
%N 18
%P 40-43
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

CPU is a primary computer resource. So, its scheduling is central to operating system design. To improve both utilization and the speed of CPU we need to keep several processes in memory at a time that means we use the sharing and multiprogramming concepts. CPU scheduling determines which process run when there are multiple runnable processes CPU scheduling is necessary because it has a big effect on resources utilization and overall performance of the system. In this paper, we are giving an improved CPU Scheduling algorithm.

References
  1. http://en. wikipedia. org/wiki/Scheduling_(computing)
  2. Sindhu M, Rajkamal R, Vigneshwaran P. An Optimum Multilevel CPU Scheduling Algorithm. 2010 International Conference on Advances in Computer Engineering
  3. Wei Zhao, John A. Stankovic. Performance Analysis of FCFS and Improved FCFS Scheduling Algorithms for Dynamic Real-Time Computer Systems. IEEE 1989.
  4. Davender Babbar, Phillip Krueger. A Performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors. IEEE 1994.
  5. Umar Saleem and Muhammad Younus Javed. Simulation Of CPU Scheduling Algorithms. IEEE 2000.
  6. Snehal Kamalapur, Neeta Deshpande. Efficient CPU Scheduling: A Genetic Algorithm based Approach. IEEE 2006.
  7. Nikolaos D. Doulamis, Anastasios D. Doulamis, Emmanouel A. Varvarigos, and Theodora A. Varvarigou. Fair Scheduling Algorithms in Grids. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 18, NO. 11, NOVEMBER 2007.
  8. Xiao-jing Zhu, Hong-bo Zeng, Kun Huang, Ge Zhang. Round-robin based scheduling algorithms for FIFO IQ switch. IEEE 2008.
  9. Apurva Shah, Ketan Kotecha. Efficient Scheduling Algorithms for Real-Time Distributed Systems. 2010 1st International Conference on Parallel, Distributed and Grid Computing
  10. Devendra Thakor, Apurva Shah. D_EDF: An efficient Scheduling Algorithm for Real-Time Multiprocessor System. IEEE 2011.
  11. Tong Li, Dan Baumberger, Scott Hahn. Efficient and Scalable Multiprocessor Fair Scheduling Using Distributed Weighted Round-Robin. ACM 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Scheduling Time Quantum

Powered by PhDFocusTM