Modified Round Robin algorithm (MRR)

CPU Scheduling Algorithms form the basic and fundamental concepts of Operating Systems. A scheduling algorithm is used to produce effective switches between the processes present in the ready queue. Round Robin algorithm is one among the many CPU scheduling algorithms where every process executes fo...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI) s. 2832 - 2839
Hlavní autori: Singh, Montek, Agrawal, Rohit
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2017
Predmet:
Arithmetic Mean
Arrival queue (AQ)
Context switching (CS)
CPU scheduling
Execution Time (ET)
First Come First Serve (FCFS) scheduling
Harmonic Mean
Median
Priority Scheduling
Ready queue (RQ)
Response time (RT)
Round Robin (RR) CPU scheduling algorithm
Shortest Job Remaining (SJR)
Turnaround time (TAT)
Waiting queue (WQ)
Waiting time (WT)
ISBN:9781538608135, 1538608138
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract CPU Scheduling Algorithms form the basic and fundamental concepts of Operating Systems. A scheduling algorithm is used to produce effective switches between the processes present in the ready queue. Round Robin algorithm is one among the many CPU scheduling algorithms where every process executes for a given time quantum (TQ). Therefore the system efficiency and performance are completely dependent on the value of TQ. If this value is static in nature, then the CPU performance decreases. This paper uses the dynamic TQ to create an efficient Round Robin Algorithm. This goal was achieved by using the concept of median. The traditional RR algorithm does not take priority under the consideration, which further reduces the CPU performance. The proposed algorithm improves the efficiency of the traditional RR algorithm by considering all the factors like priority, burst time and arrival time of the processes to arrange them in the ready queue and generating TQ accordingly; which effectively reduces the Waiting time, Turn-around time, and the number of context switches. The paper also presents a detailed comparison between the proposed algorithm and existing algorithms.
AbstractList CPU Scheduling Algorithms form the basic and fundamental concepts of Operating Systems. A scheduling algorithm is used to produce effective switches between the processes present in the ready queue. Round Robin algorithm is one among the many CPU scheduling algorithms where every process executes for a given time quantum (TQ). Therefore the system efficiency and performance are completely dependent on the value of TQ. If this value is static in nature, then the CPU performance decreases. This paper uses the dynamic TQ to create an efficient Round Robin Algorithm. This goal was achieved by using the concept of median. The traditional RR algorithm does not take priority under the consideration, which further reduces the CPU performance. The proposed algorithm improves the efficiency of the traditional RR algorithm by considering all the factors like priority, burst time and arrival time of the processes to arrange them in the ready queue and generating TQ accordingly; which effectively reduces the Waiting time, Turn-around time, and the number of context switches. The paper also presents a detailed comparison between the proposed algorithm and existing algorithms.
Author Agrawal, Rohit
Singh, Montek
Author_xml – sequence: 1
  givenname: Montek
  surname: Singh
  fullname: Singh, Montek
  organization: Computer Science and Engineering VIT University Vellore, India
– sequence: 2
  givenname: Rohit
  surname: Agrawal
  fullname: Agrawal, Rohit
  organization: Computer Science and Engineering VIT University Vellore, India
BookMark eNpVj7lOw0AURQcBEiT4C9K4oIDC5r15nq1EFoulREEG6mg2w6DERnYo-HuESENzj05zpDtjJ_3QR8YWCCUimJumfqqfm5IDqlKT4Zz0EcuM0ihIS9BY8eN_TuKMZdP0AQBcakIjz9nlagipSzHk7fDV_65LfW63b8OY9u-7_GrVttcX7LSz2ylmB87Z6_3dS_1YLNcPTX27LBIqsS-Eq5xEDBychqCslT5QMJ1FclGiiM5Z7j15byqBRlQVD2BCRPBaKsNpzhZ_3RRj3HyOaWfH783hG_0ALQdCMA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICPCSI.2017.8392238
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/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781538608142
9781538608128
1538608146
153860812X
EndPage 2839
ExternalDocumentID 8392238
Genre orig-research
GroupedDBID 6IE
6IF
6IL
6IN
AAJGR
AAWTH
ABLEC
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i175t-5b4b611d20b80d7aa6cd3d9fa13be615ebba2cc3cc945195442d09de10c867923
IEDL.DBID RIE
ISBN 9781538608135
1538608138
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000464679902171&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:49:50 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-5b4b611d20b80d7aa6cd3d9fa13be615ebba2cc3cc945195442d09de10c867923
PageCount 8
ParticipantIDs ieee_primary_8392238
PublicationCentury 2000
PublicationDate 2017-Sept.
PublicationDateYYYYMMDD 2017-09-01
PublicationDate_xml – month: 09
  year: 2017
  text: 2017-Sept.
PublicationDecade 2010
PublicationTitle 2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI)
PublicationTitleAbbrev ICPCSI
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002683196
Score 1.6837329
Snippet CPU Scheduling Algorithms form the basic and fundamental concepts of Operating Systems. A scheduling algorithm is used to produce effective switches between...
SourceID ieee
SourceType Publisher
StartPage 2832
SubjectTerms Arithmetic Mean
Arrival queue (AQ)
Context switching (CS)
CPU scheduling
Execution Time (ET)
First Come First Serve (FCFS) scheduling
Harmonic Mean
Median
Priority Scheduling
Ready queue (RQ)
Response time (RT)
Round Robin (RR) CPU scheduling algorithm
Shortest Job Remaining (SJR)
Turnaround time (TAT)
Waiting queue (WQ)
Waiting time (WT)
Title Modified Round Robin algorithm (MRR)
URI https://ieeexplore.ieee.org/document/8392238
WOSCitedRecordID wos000464679902171&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB7a4kEvPlrxzR56UDDtbrKbbM7FYsGWUhV6K3mtLuiu1K2_3yRdq4IXb0kOIU--mWS-bwC62ok6ZVIgZlKOYkNixHmCkbXdjUxolobME4Xv2GSSzud82oDrDRfGGOODz0zPFf1fvi7Vyj2V9R2YW4hpQpMxuuZqbd5TME3daXLcLXuHqUU6ktaSTl_1pFYdikLeHw2mg_uRC-1ivbrbX_lVPLwMd_83sD3ofPP0gukGgfahYYoD2PkhMdiG7rjUeWbtzGDmEigFnu8ViJencplXz6_B5Xg2u-rA4_DmYXCL6swIKLdwX6FExpJGkcahTEPNhKBKE80zERFprI1ipBRYKaIU9_IxcYx1yLWJQuUE9jA5hFZRFuYIAm24EsxaQZJi57wIFVHFiQyptK5Oho-h7ea7eFuLXyzqqZ783XwK225J10FYZ9CqlitzDlvqo8rflxd-xz4Bk0OQaQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4gmqgXH2B8uwcOmrjQbXe72zORQARCEBNupK_VTZQ1uPj7bcuKmnjx1vbQ9Jlvpp3vG4CGsqJOqeB-rBPmh5qEPmMR9o3trkVE0wTFjijcj4fDZDplowrcrrkwWmsXfKabtuj-8lUul_aprGXB3EDMBmzazFklW2v9ooJpYs-TZW-ZW0wN1pGkFHX6qkel7lCAWKvXHrUfeja4K26WHf_KsOIAprP3v6HtQ_2bqeeN1hh0ABU9P4TdHyKDNWgMcpWlxtL0xjaFkucYXx5_ecoXWfH86l0PxuObOjx27ibtrl_mRvAzA_iFH4lQ0CBQGIkEqZhzKhVRLOUBEdpYKVoIjqUkUjInIBOGWCGmdICkldjD5Aiq83yuj8FTmkkeGztIUGzdFy4DKhkRiArj7KT4BGp2vrO3lfzFrJzq6d_NV7DdnQz6s35veH8GO3Z5VyFZ51AtFkt9AVvyo8jeF5du9z4BUzqTsg
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=2017+IEEE+International+Conference+on+Power%2C+Control%2C+Signals+and+Instrumentation+Engineering+%28ICPCSI%29&rft.atitle=Modified+Round+Robin+algorithm+%28MRR%29&rft.au=Singh%2C+Montek&rft.au=Agrawal%2C+Rohit&rft.date=2017-09-01&rft.pub=IEEE&rft.isbn=9781538608135&rft.spage=2832&rft.epage=2839&rft_id=info:doi/10.1109%2FICPCSI.2017.8392238&rft.externalDocID=8392238
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781538608135/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781538608135/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781538608135/sc.gif&client=summon&freeimage=true