An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique
CPU scheduling is the basic task within any time-shared operating system. One of the main goals of the researchers interested in CPU scheduling is minimizing time cost. Comparing between CPU scheduling algorithms is subject to some scheduling criteria (e.g., turnaround time, waiting time and number...
Uloženo v:
| Vydáno v: | Computers, materials & continua Ročník 66; číslo 3; s. 3253 - 3270 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Henderson
Tech Science Press
01.01.2021
|
| Témata: | |
| ISSN: | 1546-2226, 1546-2218, 1546-2226 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | CPU scheduling is the basic task within any time-shared operating system. One of the main goals of the researchers interested in CPU scheduling is minimizing time cost. Comparing between CPU scheduling algorithms is subject to some scheduling criteria (e.g., turnaround time, waiting time and number of context switches (NCS)). Scheduling policy is divided into preemptive and non-preemptive. Round Robin (RR) algorithm is the most common preemptive scheduling algorithm used in the time-shared operating systems. In this paper, the authors proposed a modified version of the RR algorithm, called dynamic time slice (DTS), to combine the advantageous of the low scheduling overhead of the RR and favor short process for the sake of minimizing time cost. Each process has a weight proportional to the weights of all processes. The process’s weight determines its time slice within the current period. The authors benefit from the clustering technique in grouping the processes that are similar in their attributes (e.g., CPU service time, weight, allowed time slice (ATS), proportional burst time (PBT) and NCS). Each process in a cluster is assigned the average of the processes’ time slices in this cluster. A comparative study of six popular scheduling algorithms and the proposed approach on nine groups of processes vary in their attributes was performed and the evaluation was measured in terms of waiting and turnaround times, and NCS. The experiments showed that the proposed algorithm gives better results. |
|---|---|
| AbstractList | CPU scheduling is the basic task within any time-shared operating system. One of the main goals of the researchers interested in CPU scheduling is minimizing time cost. Comparing between CPU scheduling algorithms is subject to some scheduling criteria (e.g., turnaround time, waiting time and number of context switches (NCS)). Scheduling policy is divided into preemptive and non-preemptive. Round Robin (RR) algorithm is the most common preemptive scheduling algorithm used in the time-shared operating systems. In this paper, the authors proposed a modified version of the RR algorithm, called dynamic time slice (DTS), to combine the advantageous of the low scheduling overhead of the RR and favor short process for the sake of minimizing time cost. Each process has a weight proportional to the weights of all processes. The process’s weight determines its time slice within the current period. The authors benefit from the clustering technique in grouping the processes that are similar in their attributes (e.g., CPU service time, weight, allowed time slice (ATS), proportional burst time (PBT) and NCS). Each process in a cluster is assigned the average of the processes’ time slices in this cluster. A comparative study of six popular scheduling algorithms and the proposed approach on nine groups of processes vary in their attributes was performed and the evaluation was measured in terms of waiting and turnaround times, and NCS. The experiments showed that the proposed algorithm gives better results. |
| Author | M. Mostafa, Samih Amano, Hirofumi |
| Author_xml | – sequence: 1 givenname: Samih surname: M. Mostafa fullname: M. Mostafa, Samih – sequence: 2 givenname: Hirofumi surname: Amano fullname: Amano, Hirofumi |
| BookMark | eNp1kE1LAzEQhoMo2FbvHgOet-Z7u8da_IKCINVrmGazbco2qUn24L83Wg8iOIeZObzPDDxjdOqDtwhdUTLlTBFxY_ZmygijU0KFquUJGlEpVMUYU6e_9nM0TmlHCFe8ISO0nHs8b3dDyrDuLX6D6MBnHDr8Egbflr52JdFvQnR5u8e3kGyLg8eLvjA2Or_BK2u23r0P9gKdddAne_kzJ-j1_m61eKyWzw9Pi_myMpzyXDWwFhYo46alogPSWdI2YMysaSRXopa2Fk0rOJ1JoLRTUtWMmkZaAEvETPEJuj7ePcRQ3qasd2GIvrzUTNRCElWqpNQxZWJIKdpOG5chu-BzBNdrSvS3OV3M6S9z-miugOQPeIhuD_Hjf-QTX2dxyQ |
| CitedBy_id | crossref_primary_10_32604_cmc_2022_021978 |
| Cites_doi | 10.1007/s40745-015-0040-1 10.1007/978-94-017-7236-5_17 10.5815/ijeme.2015.02.02 10.17781/P002491 10.52731/iee.v5.i1.353 10.4236/jcc.2015.34005 10.3390/app10155134 10.1016/j.procs.2020.01.037 10.1002/ece3.5774 10.34028/iajit/17/1/11 10.5539/mas.v11n9p151 10.4236/jcc.2016.44013 10.1007/978-3-319-19369-4_5 10.1016/S1383-7621(00)00065-5 |
| ContentType | Journal Article |
| Copyright | 2021. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2021. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION 7SC 7SR 8BQ 8FD ABUWG AFKRA AZQEC BENPR CCPQU DWQXO JG9 JQ2 L7M L~C L~D PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS |
| DOI | 10.32604/cmc.2021.014675 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Engineered Materials Abstracts METADEX Technology Research Database ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest One Community College ProQuest Central Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China |
| DatabaseTitle | CrossRef Publicly Available Content Database Materials Research Database Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China METADEX Computer and Information Systems Abstracts Professional ProQuest Central Engineered Materials Abstracts ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic Advanced Technologies Database with Aerospace ProQuest One Academic (New) |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1546-2226 |
| EndPage | 3270 |
| ExternalDocumentID | 10_32604_cmc_2021_014675 |
| GroupedDBID | AAFWJ AAYXX ACIWK ADMLS AFFHD AFKRA ALMA_UNASSIGNED_HOLDINGS BENPR CCPQU CITATION EBS EJD J9A OK1 P2P PHGZM PHGZT PIMPY RTS TUS 7SC 7SR 8BQ 8FD ABUWG AZQEC DWQXO JG9 JQ2 L7M L~C L~D PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c313t-9ab4ea123cd14fa0fe0d9acc899536475e749d43185a11f656721c95eaae04863 |
| IEDL.DBID | BENPR |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000604616100030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1546-2226 1546-2218 |
| IngestDate | Sun Nov 09 07:54:29 EST 2025 Sat Nov 29 05:53:47 EST 2025 Tue Nov 18 21:22:34 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c313t-9ab4ea123cd14fa0fe0d9acc899536475e749d43185a11f656721c95eaae04863 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://www.proquest.com/docview/2474506666?pq-origsite=%requestingapplication% |
| PQID | 2474506666 |
| PQPubID | 2048737 |
| PageCount | 18 |
| ParticipantIDs | proquest_journals_2474506666 crossref_citationtrail_10_32604_cmc_2021_014675 crossref_primary_10_32604_cmc_2021_014675 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-01-01 |
| PublicationDateYYYYMMDD | 2021-01-01 |
| PublicationDate_xml | – month: 01 year: 2021 text: 2021-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Henderson |
| PublicationPlace_xml | – name: Henderson |
| PublicationTitle | Computers, materials & continua |
| PublicationYear | 2021 |
| Publisher | Tech Science Press |
| Publisher_xml | – name: Tech Science Press |
| References | Pandey (ref26) 2016; 4 Starczewski (ref18) 2015; 9120 Farooq (ref9) 2017 Reddy (ref3) 2019 Inyang (ref16) 2017; 11 Sunil (ref5) 2018 Mostafa (ref13) 2019; 5 Xu (ref19) 2015; 2 Singh (ref8) 2015; 3 Datta (ref24) 2015; 5 Shafi (ref12) 2020; 17 Helmy (ref23) 2007 Wilmshurst (ref7) 2010 Elmougy (ref28) 2017; 6 Rajput (ref2) 2012; 1 Alsulami (ref10) 2019 Singh (ref11) 2010; 2 Wu (ref20) 2012 Lengyel (ref17) 2019; 9 Silberschatz (ref4) 2018 Zouaoui (ref25) 2019; 7 Mostafa (ref15) 2018; 8 Harwood (ref22) 2001; 47 Mostafa (ref14) 2010; 5 Srinivasu (ref27) 2015; 76 Liu (ref21) 2010 Chandiramani (ref1) 2019; 165 McGuire (ref6) 2015 Mostafa (ref29) 2020; 10 |
| References_xml | – start-page: 424 year: 2007 ident: ref23 article-title: Burst round robin as a proportional-share scheduling algorithm – start-page: 244 year: 2017 ident: ref9 article-title: An efficient dynamic round robin algorithm for CPU scheduling – start-page: 1 year: 2019 ident: ref10 article-title: Performance evaluation of dynamic round robin algorithms for CPU scheduling – volume: 2 start-page: 165 year: 2015 ident: ref19 article-title: A comprehensive survey of clustering algorithms publication-title: Annals of Data Science doi: 10.1007/s40745-015-0040-1 – year: 2018 ident: ref5 publication-title: Fundamentals of Operating Systems Concepts – start-page: 243 year: 2015 ident: ref6 publication-title: Transactions on Engineering Technologies doi: 10.1007/978-94-017-7236-5_17 – volume: 5 start-page: 10 year: 2015 ident: ref24 article-title: Efficient round robin scheduling algorithm with dynamic time slice publication-title: International Journal of Education and Management Engineering doi: 10.5815/ijeme.2015.02.02 – volume: 7 start-page: 190 year: 2019 ident: ref25 article-title: Improved time quantum length estimation for round robin scheduling algorithm using neural network publication-title: Indonesian Journal of Electrical Engineering and Informatics – volume: 6 start-page: 1 year: 2017 ident: ref28 article-title: A novel hybrid of shortest job first and round Robin with dynamic variable quantum time task scheduling technique publication-title: Journal of Cloud Computing – volume: 8 start-page: 142 year: 2018 ident: ref15 article-title: Proportional weighted round robin: A proportional share CPU scheduler in time sharing systems publication-title: International Journal of New Computer Architectures and their Applications doi: 10.17781/P002491 – volume: 5 start-page: 11 year: 2019 ident: ref13 article-title: An adjustable round robin scheduling algorithm in interactive systems publication-title: Information Engineering Express (IEE) doi: 10.52731/iee.v5.i1.353 – volume: 3 start-page: 40 year: 2015 ident: ref8 article-title: Varying response ratio priority: A preemptive CPU scheduling algorithm (VRRP) publication-title: Journal of Computer and Communications doi: 10.4236/jcc.2015.34005 – volume: 10 start-page: 1 year: 2020 ident: ref29 article-title: Dynamic round robin CPU scheduling algorithm based on K-means clustering technique publication-title: Applied Sciences doi: 10.3390/app10155134 – volume: 165 start-page: 363 year: 2019 ident: ref1 article-title: A modified priority preemptive algorithm for CPU scheduling publication-title: Procedia Computer Science doi: 10.1016/j.procs.2020.01.037 – volume: 2 start-page: 2383 year: 2010 ident: ref11 article-title: An optimized round robin scheduling algorithm for CPU scheduling publication-title: International Journal on Computer Science and Engineering – start-page: 1 year: 2012 ident: ref20 publication-title: Cluster Analysis and K-means Clustering: An Introduction, Advances in K-means Clustering – year: 2018 ident: ref4 publication-title: Operating System Concepts-10th – volume: 9 start-page: 13231 year: 2019 ident: ref17 article-title: Silhouette width using generalized mean–-A flexible method for assessing clustering efficiency publication-title: Ecology and Evolution doi: 10.1002/ece3.5774 – start-page: 255 year: 2019 ident: ref3 article-title: Comparative analysis of CPU scheduling algorithms and their optimal solutions – volume: 5 start-page: 64 year: 2010 ident: ref14 article-title: Finding time quantum of round robin CPU scheduling algorithm in general computing systems using integer programming publication-title: International Journal of New Computer Architectures and their Applications – volume: 17 start-page: 90 year: 2020 ident: ref12 article-title: A novel amended dynamic round robin scheduling algorithm for timeshared systems publication-title: International Arab Journal of Information Technology doi: 10.34028/iajit/17/1/11 – volume: 11 start-page: 151 year: 2017 ident: ref16 article-title: Unsupervised learning framework for customer requisition and behavioral pattern classification publication-title: Modern Applied Science doi: 10.5539/mas.v11n9p151 – year: 2010 ident: ref7 publication-title: Designing Embedded Systems with Pic Microcontrollers – volume: 4 start-page: 146 year: 2016 ident: ref26 article-title: Chronically evaluated highest instantaneous priority next: A novel algorithm for processor scheduling publication-title: Journal of Computer and Communications doi: 10.4236/jcc.2016.44013 – volume: 1 start-page: 1 year: 2012 ident: ref2 article-title: A priority based round robin CPU scheduling algorithm for real time systems publication-title: Journal of Advanced Engineering Technologies – volume: 9120 start-page: 49 year: 2015 ident: ref18 publication-title: Artificial Intelligence and Soft Computing, Lecture Notes in Computer Science doi: 10.1007/978-3-319-19369-4_5 – start-page: 911 year: 2010 ident: ref21 article-title: Understanding of Internal Clustering Validation Measures – volume: 76 start-page: 118 year: 2015 ident: ref27 article-title: An augmented dynamic round robin CPU publication-title: Journal of Theoretical and Applied Information Technology – volume: 47 start-page: 181 year: 2001 ident: ref22 article-title: Using fundamental electrical theory for varying time quantum uniprocessor scheduling publication-title: Journal of Systems Architecture doi: 10.1016/S1383-7621(00)00065-5 |
| SSID | ssj0036390 |
| Score | 2.237133 |
| Snippet | CPU scheduling is the basic task within any time-shared operating system. One of the main goals of the researchers interested in CPU scheduling is minimizing... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 3253 |
| SubjectTerms | Algorithms Clustering Comparative studies Design of experiments Operating systems Preempting Scheduling Switches Task scheduling Weight |
| Title | An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique |
| URI | https://www.proquest.com/docview/2474506666 |
| Volume | 66 |
| WOSCitedRecordID | wos000604616100030&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 | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: AUTh Library subscriptions: ProQuest Central customDbUrl: eissn: 1546-2226 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0036390 issn: 1546-2226 databaseCode: BENPR dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1546-2226 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0036390 issn: 1546-2226 databaseCode: PIMPY dateStart: 20040101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagZWChPEWhIA8sDKZ5OEkzobZqBRJUVVVQmSLHdnioTUub8vu5SxweCwtTpLzls--7s33fR8iFIyT3XWEzBXDBuJNIFgeJzXxPJY72YsEtkYtNBINBazIJh2bCbWW2VZY-MXfUai5xjrzp8IB7GGz714t3hqpRuLpqJDQ2SRWZyqCfVzu9wXBU-mIX8DcvifS4zxxAs2KhEkIWizflDCkMHfsK-VNwn-FPYPrtl3Ow6df--5u7ZMeEmbRd9Is9sqHTfVIrJRyoGdEH5K6d0rZ6wyqqeKrpI2TO0NR0ntAR6i3RvDyMtqfP8I3sZUY7AHqKzlPana6RYgGAj45LGthD8tDvjbs3zAgsMOnabsZCEXMtALuksnkirERbKhRSQg7mIa-8pwMeKo4F1sK2Ewj9IF-UoaeF0EjV5x6RSjpP9TGhAYSFsfAt5YaaK-63RGzHkgsn8CWcTuqkWbZuJA37OIpgTCPIQnJ7RGCPCO0RFfaok8uvJxYF88Yf9zZKa0RmDK6ib1Oc_H35lGzju4qJlQapZMu1PiNb8iN7XS3PTZeC4_D2fvj0CYHi1PM |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JbtswEB24ToHmEqcbsjgpD-2hB9YSRUnRIQjcLLDhBUbhFu5JpUgqaeHISayk6E_lGzujpW0uufnQqxYC1BvNmyE5bwDeCqVl4CmXG6QLLkWqeRKmLg98kwrrJ0o6qmg2EY7HB7NZNGnAfV0LQ8cqa59YOGqz0LRG3hEylD4F28HR1TWnrlG0u1q30CjNYmB__cSUbXnYP0F83wlxdjo97vGqqwDXnuvlPFKJtAodtjauTJWTWsdESmtMPHwSU_dtKCMjqapYuW6K8Q4mSTryrVKW9Ok8HPcJrEky9iasTfqjydfa93vI90UJpi8DLpA9y41RDJEc2dGXJJko3A-k10LnGv8lwoc8UJDbWet_-yybsFGF0axb2v1zaNjsBbTqFhWs8lgvYdjNWNf8oCqxZG7ZF4X_W5azRco-UT8pVpS_se78HOeUX1yyj0jqhi0ydjy_JQkJJHY2rWVuX8HnlczpNTSzRWa3gIUY9iYqcIwXWWlkcKASN9FSiTDQeDndhk6NZqwrdXVq8jGPMcsq8I8R_5jwj0v8t-H9nzeuSmWRR55t1-jHlY9Zxn-h33n89ht41puOhvGwPx7swjqNWy4itaGZ39zaPXiq7_Lvy5v9ypwZfFu1qfwGbIEvkg |
| 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=article&rft.atitle=An+Adjustable+Variant+of+Round+Robin+Algorithm+Based+on+Clustering+Technique&rft.jtitle=Computers%2C+materials+%26+continua&rft.au=Mostafa%2C+Samih+M&rft.au=Amano%2C+Hirofumi&rft.date=2021-01-01&rft.pub=Tech+Science+Press&rft.issn=1546-2218&rft.eissn=1546-2226&rft.volume=66&rft.issue=3&rft.spage=3253&rft_id=info:doi/10.32604%2Fcmc.2021.014675 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1546-2226&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1546-2226&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1546-2226&client=summon |