Performance Evaluation of Dynamic Round Robin Algorithms for CPU Scheduling
The performance of an operating system (OS) is affected by the algorithm policy that is used by a CPU to schedule the running processes. Thus, a better CPU scheduling algorithm results in faster OS performance using minimal resources over small amounts of time [11]. For that reason, many algorithms...
Gespeichert in:
| Veröffentlicht in: | Proceedings of IEEE Southeastcon S. 1 - 5 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.04.2019
|
| Schlagworte: | |
| ISSN: | 1558-058X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The performance of an operating system (OS) is affected by the algorithm policy that is used by a CPU to schedule the running processes. Thus, a better CPU scheduling algorithm results in faster OS performance using minimal resources over small amounts of time [11]. For that reason, many algorithms were proposed and implemented to enhance the performance of CPU scheduling. Round Robin is considered an efficient and fair algorithm because all processes are given the same amount of time quantum. However, its efficiency depends on the selected time quantum. In this paper, we present a comparative study of four different Round Robin algorithms namely: Adaptive Round Robin Algorithm, Best Time Quantum Round Robin CPU Scheduling, Optimal Round Robin Scheduling Using Manhattan Distance Algorithm, and Improved Round Robin Scheduling Algorithm. We compare these algorithms in terms of four performance factors including: Average Waiting Time (AWT), Average Turnaround Time (ATT), Average Response Time (ART) and Number of Contexts Switching (NCS). The simulation results show that both Adaptive Round Robin and Optimal Round Robin Scheduling Using Manhattan Distance algorithms are more efficient to be adopted as they recorded the minimum values of performance factors. |
|---|---|
| AbstractList | The performance of an operating system (OS) is affected by the algorithm policy that is used by a CPU to schedule the running processes. Thus, a better CPU scheduling algorithm results in faster OS performance using minimal resources over small amounts of time [11]. For that reason, many algorithms were proposed and implemented to enhance the performance of CPU scheduling. Round Robin is considered an efficient and fair algorithm because all processes are given the same amount of time quantum. However, its efficiency depends on the selected time quantum. In this paper, we present a comparative study of four different Round Robin algorithms namely: Adaptive Round Robin Algorithm, Best Time Quantum Round Robin CPU Scheduling, Optimal Round Robin Scheduling Using Manhattan Distance Algorithm, and Improved Round Robin Scheduling Algorithm. We compare these algorithms in terms of four performance factors including: Average Waiting Time (AWT), Average Turnaround Time (ATT), Average Response Time (ART) and Number of Contexts Switching (NCS). The simulation results show that both Adaptive Round Robin and Optimal Round Robin Scheduling Using Manhattan Distance algorithms are more efficient to be adopted as they recorded the minimum values of performance factors. |
| Author | Al-Haija, Qasem Abu Alsulami, Abdulaziz A. Mao, Qian Thanoon, Mohammed I. |
| Author_xml | – sequence: 1 givenname: Abdulaziz A. surname: Alsulami fullname: Alsulami, Abdulaziz A. organization: Tennessee State University 3500 John A. Merritt Boulevard,Department of Computer Information and Systems Engineering,Nashville,TN,USA,37209 – sequence: 2 givenname: Qasem Abu surname: Al-Haija fullname: Al-Haija, Qasem Abu organization: Tennessee State University 3500 John A. Merritt Boulevard,Department of Computer Information and Systems Engineering,Nashville,TN,USA,37209 – sequence: 3 givenname: Mohammed I. surname: Thanoon fullname: Thanoon, Mohammed I. organization: Tennessee State University 3500 John A. Merritt Boulevard,Department of Computer Information and Systems Engineering,Nashville,TN,USA,37209 – sequence: 4 givenname: Qian surname: Mao fullname: Mao, Qian organization: Tennessee State University 3500 John A. Merritt Boulevard,Department of Computer Information and Systems Engineering,Nashville,TN,USA,37209 |
| BookMark | eNotj01LAzEYhKMo2FZ_gZecvG3NmzRucizrJxYs1oK38m72TRvZTWQ_hP57K_Yyc5hnBmbMzmKKxNgNiCmAsLerNPQ7wq4vUpxJBTCVAuzUCilmyp6wMeTSgACV21M2Aq1NJrT5vGDjrvsSfxToEXtdUutT22B0xB9-sB6wDyny5Pn9PmITHH9PQ6wOWobI5_U2taHfNR0_tHixXPOV21E11CFuL9m5x7qjq6NP2Prx4aN4zhZvTy_FfJEFKVSfWSuNkvnM575SFpWzRufGC4OAd4eghAorKIkcSJ0rY8iRLh0pVGVVolcTdv2_G4ho892GBtv95nhc_QIIH1PC |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/SoutheastCon42311.2019.9020439 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore Digital Library IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore Digital Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 1728101379 9781728101378 |
| EISSN | 1558-058X |
| EndPage | 5 |
| ExternalDocumentID | 9020439 |
| Genre | orig-research |
| GroupedDBID | 29O 6IE 6IF 6IH 6IK 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-i203t-99283274f7fd39a3c98578f08a1a6327b1dad1beec1257388ece5bce3a3bdbaf3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000568970200098&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:44:15 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i203t-99283274f7fd39a3c98578f08a1a6327b1dad1beec1257388ece5bce3a3bdbaf3 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_9020439 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-April |
| PublicationDateYYYYMMDD | 2019-04-01 |
| PublicationDate_xml | – month: 04 year: 2019 text: 2019-April |
| PublicationDecade | 2010 |
| PublicationTitle | Proceedings of IEEE Southeastcon |
| PublicationTitleAbbrev | SECON |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0020415 |
| Score | 2.1384645 |
| Snippet | The performance of an operating system (OS) is affected by the algorithm policy that is used by a CPU to schedule the running processes. Thus, a better CPU... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Adaptive Scheduling Central Processing Unit CPU Scheduling Dynamic scheduling Dynamic Time Quantum Heuristic algorithms Manhattan Distance Round robin Round Robin (RR) Subspace constraints |
| Title | Performance Evaluation of Dynamic Round Robin Algorithms for CPU Scheduling |
| URI | https://ieeexplore.ieee.org/document/9020439 |
| WOSCitedRecordID | wos000568970200098&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/eLvHCXMwlV1LSwMxEB5qEdGLj1Z8k4N4ctumWTebo9QWQSiLWuitbJJJLeiutFt_v0l22Sp48RYSMoRJwswk880HcO0ORoSGBVRRDEKuVJDS1MY80vrKyvQ4MunJJvh4HE-nImnAbY2FQUSffIYd1_R_-TpXa_dU1hUlknMLtjiPSqxWHVw5qPkO3FQ1NLuegM6x3wzyzHoM1IWCVHQqCb-oVLwlGe3_bw0H0N5A8khSG5tDaGB2BHs_qgm24CnZgADIsK7iTXJDHkreefLsSJSIx3yR-_d5vlwUbx8rYmeRQTIhL3YHtUtNn7dhMhq-Dh6DiishWPR7rAiEcJxDPDTcaCZSpkRs76LpxVbzkR2QVKeaSkRlPRrO4hgV3kmFLGVSy9SwY2hmeYYnQDSLtbQCpAxVyEVkPTx7NaVQoq_dv-MptJxaZp9lOYxZpZGzv7vPYddpvkx2uYBmsVzjJWyrr2KxWl75PfwGKZueoA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3fT8IwEMcviMYfL_4A42_7YHxywOhk66NBCAYki0LCG1nbK5LoZmD499t2y9DEF9-WLWuWuza9W-97H4AbMzFaqKjjChcdzxfCidxI5zxcx8pCNXyk3MIm_OEwmExYWIK7QguDiLb4DGvm0p7ly0SszK-yOsuUnBuwachZuVqrSK-M2HwbbvMumnWLoDP8m3YS65jBNcmgy2r5GL9gKnYv6e7_7ysOoLoW5ZGw2G4OoYTxEez96CdYgX64lgGQTtHHmySKPGbkefJiMErEqr7Iw_ssWczTt48l0W-Rdjgmr9qH0hSnz6ow7nZG7Z6T0xKcebNBU4cxQx3yPeUrSVlEBQv0alSNQNu-pR9wV0bS5YhCxzQ-DQIUeM8F0ohyySNFj6EcJzGeAJE0kFwPwLknPJ-1dIynFydngjWlOXk8hYoxy_Qza4gxzS1y9vfta9jpjZ4H08HTsH8Ou8YLWenLBZTTxQovYUt8pfPl4sr68xubrqHp |
| 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%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+of+IEEE+Southeastcon&rft.atitle=Performance+Evaluation+of+Dynamic+Round+Robin+Algorithms+for+CPU+Scheduling&rft.au=Alsulami%2C+Abdulaziz+A.&rft.au=Al-Haija%2C+Qasem+Abu&rft.au=Thanoon%2C+Mohammed+I.&rft.au=Mao%2C+Qian&rft.date=2019-04-01&rft.pub=IEEE&rft.eissn=1558-058X&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FSoutheastCon42311.2019.9020439&rft.externalDocID=9020439 |