We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Time Quantum based CPU Scheduling Algorithm

by Mayank Parashar, Amit Chugh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 98 - Number 3
Year of Publication: 2014
Authors: Mayank Parashar, Amit Chugh
10.5120/17167-7235

Mayank Parashar, Amit Chugh . Time Quantum based CPU Scheduling Algorithm. International Journal of Computer Applications. 98, 3 ( July 2014), 45-48. DOI=10.5120/17167-7235

@article{ 10.5120/17167-7235,
author = { Mayank Parashar, Amit Chugh },
title = { Time Quantum based CPU Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { July 2014 },
volume = { 98 },
number = { 3 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 45-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume98/number3/17167-7235/ },
doi = { 10.5120/17167-7235 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:25:17.910442+05:30
%A Mayank Parashar
%A Amit Chugh
%T Time Quantum based CPU Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 98
%N 3
%P 45-48
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The objective of this paper is to introduce a new CPU Scheduling Algorithm called time quantum based CPU Scheduling Algorithm which acts as preemptive based on the arrival time. The algorithm helps to improve the average waiting time of Round Robin algorithm in real time uni-processor-multi programming operating system. CPU Scheduling is the basis of multi-programmed operating system. The scheduler is responsible for multiplexing processes on the CPU. There are many scheduling algorithms available for a multi-programmed operating system like FCFS, SJF, Priority, Round Robin etc. The proposed algorithm is based on Round robin scheduling . In this paper, the results of the existing Round Robin algorithm is compared with the proposed algorithm

References
  1. . Rakesh Patel,Mrs Milli Patel Shortest Job Round Robin Cpu Scheduling Algorithm International Journal of Engineering and Computer Science Volume 2 December 2013.
  2. . Aashna Bisht ,MD. Abdul Azad, SielVie Sharma, Enhanced Round Robin for Process scheduling using varying Quantum Decision IRAJ International Conference Proceedings December 2013.
  3. . Abbas Noon,Ali KalaKech, Seifedine Kadry A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average International Journal of computer science Volume 8 May 2013.
  4. . Hemant M. Chaskar Upamanyu Madhow, Senior Member, IEEE A Fair scheduling with tuneable Latency:A Rond Robin Approach IEEE Transcations August 2003
  5. . P. SurendraVerma Improved Shortest Remaining Burst Round Robin (ISRBRR) Using RMS as its time Quantum International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)Volume 1, Issue 8, October 2012.
  6. . SAROJ HIRANWAL "Adaptive Round Robin Scheduling using Shortest Burst ApproachBased on Smart Time Slice" International Journal of Data Engineering (IJDE), Volume 2, Issue 3 MaY 2013.
  7. Krithi Ramamaritham John A Stankovic Senior Member IEEE And Perg Fersiah Efficient Scheduling Algorithms for Real time Multiprocessor Systems Transctions on Parallel and Distributed systems Vol. 2 No 1 ,April 1990
  8. Bashir Alam, Fuzzy Round Robin Cpu Scheduling Algorithm, Journal of Computer Science, 9(8):1079-1085,2013 Science Publications.
  9. Superiya Raheja, Reena Dhadich, Smita Rajpal, An Optimum Time Quantum Using Linguistic Synthesis for Round Robin Cpu Scheduling Algorithm, International Journal on Soft Computing(IJSC) Vol. 3 No. 1 Feburary 2012.
  10. C. Yashuwanth and R. Ramesh,: A new Scheduling Algorithm For Real Time System , International Journal of Computer and Electrical Engineering(IJCEE)Vol 2 No. 6,pp 1104-1106, December,2010.
  11. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, "Operating System Concepts", Sixth Edition.
  12. Milan Milenkovic, "Operating Systems Concepts and Design", McGRAM-HILL, Computer Science Series, second edition.
  13. P. Balakrishna Prasad, "Operating Systems" Second Edition.
  14. A. Dhore "Opeating Systems", Technical Publications.
  15. M. Dietel, "Operating Systems", Pearson Education, Second Edition.
  16. M Gary Nutt, "Operating systems – A Modern Perspective, Second Edition, Pearson Education, 2000.
Index Terms

Computer Science
Information Sciences

Keywords

Round Robin Scheduling Waiting Time Turn Around time Average waiting Time Average Turn Around time Context Switches.

Powered by PhDFocusTM