Improved Round Robin CPU scheduling algorithm: Round Robin, Shortest Job First and priority algorithm coupled to increase throughput and decrease waiting time and turnaround time

In multitasking operating system, processes don't run simultaneously, but switch very expeditiously. Thus, all the processes share the CPU time. It is the job of the scheduler to select a process from the ready queue and place it into the memory based a particular strategy known as Scheduling A...

Full description

Saved in:
Bibliographic Details
Published in:ICGTSPICC 2016 : proceedings : International Conference on Global Trends in Signal Processing, Information Computing and Communication : 22-24 December 2016, Jalgaon, India pp. 184 - 187
Main Authors: Parekh, Harshal Bharatkumar, Chaudhari, Sheetal
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2016
Subjects:
Algorithm design and analysis
Context
Context Switch
CPU Scheduling
Heuristic algorithms
Priority
Round robin
Signal processing algorithms
SJF
Switches
Time Quantum
Turn Around Time
Waiting Time
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In multitasking operating system, processes don't run simultaneously, but switch very expeditiously. Thus, all the processes share the CPU time. It is the job of the scheduler to select a process from the ready queue and place it into the memory based a particular strategy known as Scheduling Algorithm. There exist many Scheduling Algorithms such as First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling, Multilevel Queue Scheduling (MLQ). This paper proposes a new strategy consolidating three of the existing scheduling algorithms to create a new strategy that reduces the time a process spends in waiting state. The proposed algorithm also reduces the number of context switches to provide a fair, efficient and methodical scheduling algorithm. The algorithm is an extended version of Round Robin Algorithm where each of the processes is given a priority level (low, medium or high) and based on the priority level, the Time Quantum for that process is decided and executed. The throughput of the algorithm is increased by executing processes with smaller burst time or smaller remaining burst time by allocating the process to the CPU as soon as it is ready but not pre-empting the running process.
AbstractList In multitasking operating system, processes don't run simultaneously, but switch very expeditiously. Thus, all the processes share the CPU time. It is the job of the scheduler to select a process from the ready queue and place it into the memory based a particular strategy known as Scheduling Algorithm. There exist many Scheduling Algorithms such as First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling, Multilevel Queue Scheduling (MLQ). This paper proposes a new strategy consolidating three of the existing scheduling algorithms to create a new strategy that reduces the time a process spends in waiting state. The proposed algorithm also reduces the number of context switches to provide a fair, efficient and methodical scheduling algorithm. The algorithm is an extended version of Round Robin Algorithm where each of the processes is given a priority level (low, medium or high) and based on the priority level, the Time Quantum for that process is decided and executed. The throughput of the algorithm is increased by executing processes with smaller burst time or smaller remaining burst time by allocating the process to the CPU as soon as it is ready but not pre-empting the running process.
Author Parekh, Harshal Bharatkumar
Chaudhari, Sheetal
Author_xml – sequence: 1
  givenname: Harshal Bharatkumar
  surname: Parekh
  fullname: Parekh, Harshal Bharatkumar
  email: harshalparekh@outlook.com
  organization: Sardar Patel Inst. of Technol., Mumbai, India
– sequence: 2
  givenname: Sheetal
  surname: Chaudhari
  fullname: Chaudhari, Sheetal
  email: sheetal_chaudhari@spit.ac.in
  organization: Sardar Patel Inst. of Technol., Mumbai, India
BookMark eNpNUO9KwzAQj6Cgzj2BIHkAV5OmTRu_SXGzMnC4-Xmk6XWNtE1JU2Wv5RPabgP9cnf8_tyPu2t03pgGELqjxKOUiIc0WWzWqzRJPJ9Q7kUiDH0RnKGpiGIaEkFIwCN-iaZd90kIoYLHfkCv0E9at9Z8QY7fTd-MNdMNTlYfuFMl5H2lmx2W1c5Y7cr68b_qHq9LYx10Dr-aDM-1HSY5sK3Vo3z_58PK9G01hDiDdaMsyA6wK63pd2XbH105nPBvqd2Y6nQNB8b1tpH2EDxiN-iikFUH01OfoM38eZO8zJZvizR5Ws60IG4mw4AqQYGyKKB-IVgxzGHhAwBhUS58piKmgkIpzgJOQXKIIeNF7KswznLCJuj2uFYPlu1wUy3tfnt6LPsFlKV2Jg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICGTSPICC.2016.7955294
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781509004676
150900467X
EndPage 187
ExternalDocumentID 7955294
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-a541c91e137412f93f1e15f2eee037d923c73c4fcc63461ea6e8eb6f82c58bd03
IEDL.DBID RIE
IngestDate Fri Mar 14 03:44:00 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-a541c91e137412f93f1e15f2eee037d923c73c4fcc63461ea6e8eb6f82c58bd03
PageCount 4
ParticipantIDs ieee_primary_7955294
PublicationCentury 2000
PublicationDate 2016-Dec.
PublicationDateYYYYMMDD 2016-12-01
PublicationDate_xml – month: 12
  year: 2016
  text: 2016-Dec.
PublicationDecade 2010
PublicationTitle ICGTSPICC 2016 : proceedings : International Conference on Global Trends in Signal Processing, Information Computing and Communication : 22-24 December 2016, Jalgaon, India
PublicationTitleAbbrev ICGTSPICC
PublicationYear 2016
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001968241
Score 1.6569844
Snippet In multitasking operating system, processes don't run simultaneously, but switch very expeditiously. Thus, all the processes share the CPU time. It is the job...
SourceID ieee
SourceType Publisher
StartPage 184
SubjectTerms Algorithm design and analysis
Context
Context Switch
CPU Scheduling
Heuristic algorithms
Priority
Round robin
Signal processing algorithms
SJF
Switches
Time Quantum
Turn Around Time
Waiting Time
Title Improved Round Robin CPU scheduling algorithm: Round Robin, Shortest Job First and priority algorithm coupled to increase throughput and decrease waiting time and turnaround time
URI https://ieeexplore.ieee.org/document/7955294
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA_b8EFf_NjEb_Lg47q1TdImvhanExnFTdjbSNPUFWZbulbx3_IvNGnLNsEX38Ilx8ElcNfr_e4HwK3lmjgMuGtEtq5WIUcaHDNqUMJDylRKwkU1Z_bZnUzofM78FuhvsDBSyqr5TA70svqXH6ai1KWyocsIsRlug7brOjVWa1tPYQ5V0agBAVsmG469h9nUH3uebuByBo3yLxaVKoiMDv9n_gj0tmg86G_izDFoyeQEHOwMEuyC77o2IEP4ommSYIXqgp7_CtXHqwomGnMO-eotzeNi-X63e6oPp0vdcLsu4FMawFGs0kHI1W6Wx_r411YPirTMVspIkcI40enmWsKG6Ccra61QNvJPHuuOaqjJ66udQj_avDKsZT0wG93PvEejYWMwYmYWBifYEsySFlI5iB0xFKk1iWzlJRO5ocoThYsEjoRwEHYsyR1JZeBE1BaEBqGJTkEnSRN5BiAmkjNTEDNEFEcEByzgFCFk2dyMSMDPQVc7f5HV8zYWjd8v_hZfgn19v3WLyRXoFHkpr8Ge-CjidX5TPZIf0CjCaw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dT8IwEG8QTdQXP8D4bR98ZNqt7db6uoigSIhgwhvpuk6WICNjaPy3_AtttwUw8cW35tpLm1uTu11_vzsArm0PkTAQnhU5JluFXWUJwpnFqAgZ1yGJkHmd2Y7X7bLhkPcqoLHkwiilcvCZujHD_C0_TOTCpMpuPU6pw8kG2KSEOKhga60yKtxl2h-VNGAb8du2_zDo99q-byBc7k2p_quPSu5Gmnv_O8A-qK_4eLC39DQHoKKmh2B3rZRgDXwX2QEVwhfTKAnmvC7o916h_n3V7sSwzqGYvCVpnI3f79ZXNWB_bCC38ww-JgFsxjoghELPztLYLP9a6UGZLGYTvUmWwHhqAs65gmWrn9mi0ApVKf8UscFUQ9O-Pp_JzLVN842NrA4GzfuB37LKfgxWzFFmCUpsyW1lYx2FOBHHkR7TyNFWQtgLdaQoPSxJJKWLiWsr4SqmAjdijqQsCBE-AtVpMlXHABKqBEeSohAzElES8EAwjLHtCBTRQJyAmjH-aFZU3BiVdj_9W3wFtluD586o0-4-nYEd860LwMk5qGbpQl2ALfmRxfP0Mr8wPw7-xbI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=ICGTSPICC+2016+%3A+proceedings+%3A+International+Conference+on+Global+Trends+in+Signal+Processing%2C+Information+Computing+and+Communication+%3A+22-24+December+2016%2C+Jalgaon%2C+India&rft.atitle=Improved+Round+Robin+CPU+scheduling+algorithm%3A+Round+Robin%2C+Shortest+Job+First+and+priority+algorithm+coupled+to+increase+throughput+and+decrease+waiting+time+and+turnaround+time&rft.au=Parekh%2C+Harshal+Bharatkumar&rft.au=Chaudhari%2C+Sheetal&rft.date=2016-12-01&rft.pub=IEEE&rft.spage=184&rft.epage=187&rft_id=info:doi/10.1109%2FICGTSPICC.2016.7955294&rft.externalDocID=7955294