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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Self-Regulated Priority based Round Robin Scheduling Algorithm

Published on December 2013 by Md.gulzar, K. Ravindra Babu, A.vinaya Babu, S.udaya Kumar
journal_cover_thumbnail

Futuristic Areas in Computer Engineering and Technology 2013
Foundation of Computer Science USA
FACET - Number 1
December 2013
Authors: Md.gulzar, K. Ravindra Babu, A.vinaya Babu, S.udaya Kumar
051cb481-162e-4b2a-863e-cc345ed5edc0

Md.gulzar, K. Ravindra Babu, A.vinaya Babu, S.udaya Kumar . Self-Regulated Priority based Round Robin Scheduling Algorithm. Futuristic Areas in Computer Engineering and Technology 2013. FACET, 1 (December 2013), 24-29.

@article{
author = { Md.gulzar, K. Ravindra Babu, A.vinaya Babu, S.udaya Kumar },
title = { Self-Regulated Priority based Round Robin Scheduling Algorithm },
journal = { Futuristic Areas in Computer Engineering and Technology 2013 },
issue_date = { December 2013 },
volume = { FACET },
number = { 1 },
month = { December },
year = { 2013 },
issn = 0975-8887,
pages = { 24-29 },
numpages = 6,
url = { /proceedings/facet/number1/14691-1322/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 Futuristic Areas in Computer Engineering and Technology 2013
%A Md.gulzar
%A K. Ravindra Babu
%A A.vinaya Babu
%A S.udaya Kumar
%T Self-Regulated Priority based Round Robin Scheduling Algorithm
%J Futuristic Areas in Computer Engineering and Technology 2013
%@ 0975-8887
%V FACET
%N 1
%P 24-29
%D 2013
%I International Journal of Computer Applications
Abstract

The main aim of this paper is to present a new scheduling algorithm even thoughthere exists good scheduling algorithms. Each scheduling algorithm is having its own merits and demerits. The proposed algorithm overcomes the demerits of existing scheduling algorithms like high average waiting time, high average turnaround time, low throughput, high number of context switches. The proposed algorithm is a preemptive algorithm which takes a time quantum to execute the processes like round robin scheduling algorithm. But the time quantum is calculated automatically depending up on the average of all burst times. And to avoid the problem of starvation high priority should be assigned for short process.

References
  1. M. Ramakrishna. "Efficient Round Robin CPU Scheduling Algorithm For Operating Systems",International JournalOf Innovative Technology And Research (2320 –5547), Volume No. 1, Issue No. 1,Page No. 103-109, December-January 2013.
  2. Amit Kumar Sain. "Dynamical Modified R. R. CPU Scheduling Algorithm", International Journal of Computer Trends and Technology(2231-2803), Volume No. 4, Issue No. 2, Page No. 90-93,2013.
  3. Ankur Bhardwaj. "Comparative Study of Scheduling Algorithms in Operating System", International Journal of Computers and Distributed Systems (2278-5183),Volume. No. 3, Issue No. 1,Page No. 5-7 April-May 2013.
  4. Ajit Singh. "An Optimized Round Robin Scheduling Algorithm for CPU Scheduling", International Journal on Computer Science and Engineering (0975-3397), Vol. 02, Paper No. 07, Page No. 2383-2385, May 2010.
  5. H. S. Behera. "A New Proposed Dynamic Quantum with Re-AdjustedRound Robin Scheduling Algorithm and Its PerformanceAnalysis", International Journal of Computer Applications (0975 – 8887), Volume 5, Paper No. 5, Page No. 10-15, August2010.
  6. A. Silberschatz, P. B. Galvin and G. Gagne. "Operating System Principles",John Wiley and Sons (978-81-265-0962-1), 7th Edition, India, Page No: 153, 154, 2008.
  7. Milan Milenkoviv. "Operating System Concepts and Design",Tata McGraw hill (0-07-463272-8), 2nd edition,New Delhi. , Page No-82, 1998.
  8. Ishwari Singh Rajput. "A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems" International Journal of Innovations in Engineering and Technology(2319 – 1058), Volume No. 1, Issue No. 3, October 2012.
  9. Abbas Noon. "A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average",International Journal of Computer Science Issues (1694-0814),Volume No. 8, Issue No. 3, No. 1, Page No. 224-229, May 2011.
  10. Vishnu Kumar Dhakad. "Performance Analysis Of Round Robin Scheduling Using Adaptive Approach Based On Smart Time Slice and Comparison With Srr",International Journal of Advances in Engineering & Technology(2231-1963), Volume No. 3, Issue No. 2, Page No. 333-339,May 2012.
  11. Abdulla Shaik. "Shortest Time Quantum Scheduling Algorithm",International Journal of Modern Engineering Research, (2249-6645), Volume No. 2, Issue No. 4, Page No. 1548-1551,July-Aug 2012.
  12. Rami J. Matarne. "Self-Adjustment Time Quantum in Round Robin Algorithm Depending onBurst Time of the Now Running Processes", American Journal of Applied Sciences(1546-9239), Volume No. 6, Paper No. 10, Page No. 1831-1837, June 2009.
  13. Sukumar Babu Bandarupalli. "A Novel CPU Scheduling Algorithm–Preemptive & Non-Preemptive", International Journal of Modern Engineering Research (2249-6645), Volume No. 2, Issue No. 10, Page No. 4484-4490, Nov-Dec. 2012.
Index Terms

Computer Science
Information Sciences

Keywords

Average Waiting Time Average Turnaround Time Context Switches.