Simulation of an Optimum Multilevel Dynamic Round Robin Scheduling Algorithm
CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in time shared systems, but it performs more number of context switches, larger waiting time and larger response time. In order to simulate the behavior of var...
Gespeichert in:
| Veröffentlicht in: | arXiv.org |
|---|---|
| Hauptverfasser: | , |
| Format: | Paper |
| Sprache: | Englisch |
| Veröffentlicht: |
Ithaca
Cornell University Library, arXiv.org
12.09.2013
|
| Schlagworte: | |
| ISSN: | 2331-8422 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in time shared systems, but it performs more number of context switches, larger waiting time and larger response time. In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, in this paper we produce the implementation of new CPU scheduling algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling (OMDRRS), which calculates intelligent time slice and warps after every round of execution. The results display the robustness of this software, especially for academic, research and experimental use, as well as proving the desirability and efficiency of the probabilistic algorithm over the other existing techniques and it is observed that this OMDRRS projects good performance as compared to the other existing CPU scheduling algorithms. |
|---|---|
| AbstractList | CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in time shared systems, but it performs more number of context switches, larger waiting time and larger response time. In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, in this paper we produce the implementation of new CPU scheduling algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling (OMDRRS), which calculates intelligent time slice and warps after every round of execution. The results display the robustness of this software, especially for academic, research and experimental use, as well as proving the desirability and efficiency of the probabilistic algorithm over the other existing techniques and it is observed that this OMDRRS projects good performance as compared to the other existing CPU scheduling algorithms. |
| Author | Goel, Neetu Garg, R B |
| Author_xml | – sequence: 1 givenname: Neetu surname: Goel fullname: Goel, Neetu – sequence: 2 givenname: R surname: Garg middlename: B fullname: Garg, R B |
| BookMark | eNotjUtLAzEYRYMoWGv3LgOupyZfJmmyLFWrMFKw3ZdMHm1KJqnzKPrvHdDFvQfu4tw7dJ1ycgg9UDIvJefkSbff4TKnjKj5GHGFJsAYLWQJcItmXXcihIBYAOdsgqptaIao-5ATzh7rhDfnfpwa_DHEPkR3cRE__yTdBIM_85Ds2HVIeGuOzg4xpANexkNuQ39s7tGN17Fzs39O0e71Zbd6K6rN-n21rArNKRTaeEpoacE5SZQHUzLtuHWKUiGl4oJKXi8UBctpWS547UVtLHgjFDPcejZFj3_ac5u_Btf1-1Me2jQ-7oFIEAoEB_YLSshQqA |
| ContentType | Paper |
| Copyright | 2013. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.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: 2013. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.1309.3096 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central Technology collection ProQuest One Community College ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| 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 | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a512-acf1014d2ee809f2c43ae5de911688956185b7912d514475bf6bcd2fc693c5df3 |
| IEDL.DBID | M7S |
| IngestDate | Mon Jun 30 09:30:04 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a512-acf1014d2ee809f2c43ae5de911688956185b7912d514475bf6bcd2fc693c5df3 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2082692652?pq-origsite=%requestingapplication% |
| PQID | 2082692652 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2082692652 |
| PublicationCentury | 2000 |
| PublicationDate | 20130912 |
| PublicationDateYYYYMMDD | 2013-09-12 |
| PublicationDate_xml | – month: 09 year: 2013 text: 20130912 day: 12 |
| PublicationDecade | 2010 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2013 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.5175421 |
| SecondaryResourceType | preprint |
| Snippet | CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in time shared... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Algorithms Computer simulation Design of experiments Optimization Response time (computers) Scheduling Scheduling algorithms Switches |
| Title | Simulation of an Optimum Multilevel Dynamic Round Robin Scheduling Algorithm |
| URI | https://www.proquest.com/docview/2082692652 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ3NT8IwGMYbBU08-R0_kPTgtcq6rVtPxg-IJogLEIMn0k8kYQM3IP75tmXowcSLhx2WHba0y9P3ffu8_QFwqSjlkY4EYh6lKCCBRFzFIfJiYfINGnDPtY-9tqNOJx4MaFIW3IrSVrnWRCfUcipsjdwk6SYQppiE-Gb2gSw1yu6ulgiNTVC1pyR4zrrX-66xYBKZiNlf7U66o7uuWf45XloEMr0yF_mlwG5Zae3-94P2QDVhM5Xvgw2VHYBtZ-cUxSFo98ZpyeWCUw1ZBl-MNKSLFLqG24l1CsGHFYwedi1ZCbpGMNgzcyitOX0Ebycj87r5e3oE-q1m__4RldwExMzyjZjQFsArsVJxg2osAp-pUCojaySObSNrHPKIeliaYCmIQq4JFxJrQagvQqn9Y1DJppk6ATA0uTP1GSeRy1NsNCEx4w0sfKK0z05BbT02w_LfL4Y_A3P29-NzsIMdXMICGWqgMs8X6gJsieV8XOR1UL1rdpJu3U2puUuenpO3L_79q70 |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT8IwGH6DoNGT3_EDtQc9TqHbuvVgjBEJBkQixHAjXdvhEjaQL-VH-R9tC9ODiTcOHnZasqx537593vZ5-gCcS0oDL_S4xYqUWg5xhBVI37WKPlf9BnWCopGPvdS8et1vt2kjA5-pFkbTKtOaaAq16HO9R66adAWEKSYuvhm8Wdo1Sp-uphYa87Soytm7atlG1w8lFd8LjMv3rbuKtXAVsJha3CzGQ21PK7CUfoGGmDs2k66QatIT39cyT98NPFrEQkEJx3ODkARc4JATanNXhLb67ArkFIrABcMUbH5v6WDiKYBuzw9DzU1hV2z4EU214zK9VA_5VfDNKlbe_Gfj34Jcgw3kcBsyMtmBNUNW5aNdqDWjeOE6hvohYgl6UoUvnsTIyIl7mgeFSrOExRFHz9o3ChmZG2qqDBWaet9Ft72uGt34Nd6D1jL-fx-yST-RB4BcQgvUZgHxTBemsZLALChgbhMZ2uwQ8mkoOouZPer8xOHo79dnsF5pPdY6tYd69Rg2sLHR0NYTeciOhxN5Aqt8Oo5Gw1OTRQg6S47aF58vA9M |
| 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=Simulation+of+an+Optimum+Multilevel+Dynamic+Round+Robin+Scheduling+Algorithm&rft.jtitle=arXiv.org&rft.au=Goel%2C+Neetu&rft.au=Garg%2C+R+B&rft.date=2013-09-12&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1309.3096 |