ATS: A Novel Time-Sharing CPU Scheduling Algorithm Based on Features Similarities
Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who interested in CPU scheduling algorithms. Waiting time, turnaround time, and number of context switches are the most time cost criteria used to com...
Uložené v:
| Vydané v: | Computers, materials & continua Ročník 70; číslo 3; s. 6271 - 6288 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Henderson
Tech Science Press
2022
|
| Predmet: | |
| ISSN: | 1546-2226, 1546-2218, 1546-2226 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who interested in CPU scheduling algorithms. Waiting time, turnaround time, and number of context switches are the most time cost criteria used to compare between CPU scheduling algorithms. CPU scheduling algorithms are divided into non-preemptive and preemptive. Round Robin (RR) algorithm is the most famous as it is the basis for all the algorithms used in time-sharing. In this paper, the authors proposed a novel CPU scheduling algorithm based on RR. The proposed algorithm is called Adjustable Time Slice (ATS). It reduces the time cost by taking the advantage of the low overhead of RR algorithm. In addition, ATS favors short processes allowing them to run longer time than given to long processes. The specific characteristics of each process are; its CPU execution time, weight, time slice, and number of context switches. ATS clusters the processes in groups depending on these characteristics. The traditional RR assigns fixed time slice for each process. On the other hand, dynamic variants of RR assign time slice for each process differs from other processes. The essential difference between ATS and the other methods is that it gives a set of processes a specific time based on their similarities within the same cluster. The authors compared between ATS with five popular scheduling algorithms on nine datasets of processes. The datasets used in the comparison vary in their features. The evaluation was measured in term of time cost and the experiments showed that the proposed algorithm reduces the time cost. |
|---|---|
| AbstractList | Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who interested in CPU scheduling algorithms. Waiting time, turnaround time, and number of context switches are the most time cost criteria used to compare between CPU scheduling algorithms. CPU scheduling algorithms are divided into non-preemptive and preemptive. Round Robin (RR) algorithm is the most famous as it is the basis for all the algorithms used in time-sharing. In this paper, the authors proposed a novel CPU scheduling algorithm based on RR. The proposed algorithm is called Adjustable Time Slice (ATS). It reduces the time cost by taking the advantage of the low overhead of RR algorithm. In addition, ATS favors short processes allowing them to run longer time than given to long processes. The specific characteristics of each process are; its CPU execution time, weight, time slice, and number of context switches. ATS clusters the processes in groups depending on these characteristics. The traditional RR assigns fixed time slice for each process. On the other hand, dynamic variants of RR assign time slice for each process differs from other processes. The essential difference between ATS and the other methods is that it gives a set of processes a specific time based on their similarities within the same cluster. The authors compared between ATS with five popular scheduling algorithms on nine datasets of processes. The datasets used in the comparison vary in their features. The evaluation was measured in term of time cost and the experiments showed that the proposed algorithm reduces the time cost. |
| Author | M. Mostafa, Samih Ahmed Idris, Sahar Kaur, Manjit |
| Author_xml | – sequence: 1 givenname: Samih surname: M. Mostafa fullname: M. Mostafa, Samih – sequence: 2 givenname: Sahar surname: Ahmed Idris fullname: Ahmed Idris, Sahar – sequence: 3 givenname: Manjit surname: Kaur fullname: Kaur, Manjit |
| BookMark | eNp1kF1LwzAUhoNMcJveexnwujMfbdJ4N4dTQfyg23VI03TLaJuZpIL_3s55IYJX5z3wPufAMwGjznUGgEuMZpQwlF7rVs8IImSGCBY8PwFjnKUsIYSw0a98BiYh7BCijAo0Bm_zVXED5_DZfZgGrmxrkmKrvO02cPG6hoXemqpvDuu82Thv47aFtyqYCroOLo2KvTcBFra1zUBFa8I5OK1VE8zFz5yC9fJutXhInl7uHxfzp0RTTGNCqKJMYZMqXmW6IkrlKuO5EYrWDGNiOOYix2lNSapzXuY1Fao0uqxxJUqd0Sm4Ot7de_femxDlzvW-G15KkgnEKeGCDS10bGnvQvCmlntvW-U_JUbyW5wcxMmDOHkUNyDsD6JtVNG6Lnplm__BLyNfc4g |
| CitedBy_id | crossref_primary_10_1109_JSAC_2025_3574613 |
| Cites_doi | 10.17781/P002491 10.5121/ijcsea.2014.4401 10.32604/cmc.2021.014675 10.2298/CSIS180601007L 10.34028/iajit/17/1/11 10.1016/j.procs.2020.01.037 10.1016/S1383-7621(00)00065-5 10.1007/s40745-015-0040-1 10.1007/0-387-25465-X_15 10.52731/iee.v5.i1.353 10.3390/app10155134 10.5539/mas.v11n9p151 10.1007/978-94-017-7236-5_17 10.5815/ijeme.2015.02.02 |
| ContentType | Journal Article |
| Copyright | 2022. 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: 2022. 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.2022.021978 |
| 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) ProQuest - 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 | 6288 |
| ExternalDocumentID | 10_32604_cmc_2022_021978 |
| 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-23a36a1e4a7d5cd2aa8a578e9a3f6112e7179814f324c87b8f39abecbf1d9bc53 |
| IEDL.DBID | BENPR |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000707364500002&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 30 05:19:43 EST 2025 Tue Nov 18 20:37:29 EST 2025 Sat Nov 29 03:13:20 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c313t-23a36a1e4a7d5cd2aa8a578e9a3f6112e7179814f324c87b8f39abecbf1d9bc53 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://www.proquest.com/docview/2590732796?pq-origsite=%requestingapplication% |
| PQID | 2590732796 |
| PQPubID | 2048737 |
| PageCount | 18 |
| ParticipantIDs | proquest_journals_2590732796 crossref_primary_10_32604_cmc_2022_021978 crossref_citationtrail_10_32604_cmc_2022_021978 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-00-00 20220101 |
| PublicationDateYYYYMMDD | 2022-01-01 |
| PublicationDate_xml | – year: 2022 text: 2022-00-00 |
| PublicationDecade | 2020 |
| PublicationPlace | Henderson |
| PublicationPlace_xml | – name: Henderson |
| PublicationTitle | Computers, materials & continua |
| PublicationYear | 2022 |
| Publisher | Tech Science Press |
| Publisher_xml | – name: Tech Science Press |
| References | Wu (ref11) 2012 Elmougy (ref20) 2017; 6 Liu (ref13) 2010 Reddy (ref3) 2019 Mostafa (ref16) 2010; 5 Mishra (ref17) 2014; 4 Somula (ref4) 2019; 105 McGuire (ref19) 2015 Rajput (ref2) 2012; 1 Datta (ref18) 2015; 5 Harwood (ref14) 2001; 47 Mostafa (ref24) 2020; 66 Silberschatz (ref5) 2018 Shafi (ref23) 2020; 17 ref25 Mostafa (ref21) 2018; 8 Berkhin (ref9) 2006 Mostafa (ref22) 2019; 5 Inyang (ref12) 2017; 11 Lasek (ref6) 2019; 16 Helmy (ref15) 2007 Mostafa (ref7) 2020; 10 Rokach (ref8) 2005 Chandiramani (ref1) 2019; 165 Xu (ref10) 2015; 2 |
| References_xml | – volume: 105 start-page: 375 year: 2019 ident: ref4 publication-title: Systems and Technologies – volume: 8 start-page: 142 year: 2018 ident: ref21 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 – start-page: 1 year: 2012 ident: ref11 publication-title: Advances in K-Means Clustering – volume: 4 start-page: 1 year: 2014 ident: ref17 article-title: An improved round robin CPU scheduling algorithm with varying time quantum publication-title: International Journal of Computer Science, Engineering and Applications doi: 10.5121/ijcsea.2014.4401 – ident: ref25 – start-page: 424 year: 2007 ident: ref15 article-title: Burst round robin as a proportional-share scheduling algorithm – volume: 66 start-page: 3253 year: 2020 ident: ref24 article-title: An adjustable variant of round robin algorithm based on clustering technique publication-title: Computers, Materials & Continua doi: 10.32604/cmc.2021.014675 – volume: 16 start-page: 469 year: 2019 ident: ref6 article-title: Density-based clustering with constraints publication-title: Computer Science and Information Systems doi: 10.2298/CSIS180601007L – volume: 17 start-page: 90 year: 2020 ident: ref23 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 – year: 2018 ident: ref5 publication-title: Operating System Concepts-10th – 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: 47 start-page: 181 year: 2001 ident: ref14 article-title: Using fundamental electrical theory for varying time quantum uni-processor scheduling publication-title: Journal of Systems Architecture doi: 10.1016/S1383-7621(00)00065-5 – volume: 2 start-page: 165 year: 2015 ident: ref10 article-title: A comprehensive survey of clustering algorithms publication-title: Annals of Data Science doi: 10.1007/s40745-015-0040-1 – start-page: 321 year: 2005 ident: ref8 publication-title: The Data Mining and Knowledge Discovery Handbook doi: 10.1007/0-387-25465-X_15 – volume: 5 start-page: 11 year: 2019 ident: ref22 article-title: An adjustable round robin scheduling algorithm in interactive systems publication-title: Information Engineering Express (IEE doi: 10.52731/iee.v5.i1.353 – start-page: 911 year: 2010 ident: ref13 article-title: Understanding of internal clustering validation measures – 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: International Journal of Innovations in Engineering and Technology – start-page: 255 year: 2019 ident: ref3 article-title: Comparative analysis of CPU scheduling algorithms and their optimal solutions – volume: 10 start-page: 5134 year: 2020 ident: ref7 article-title: Dynamic round robin CPU scheduling algorithm based on K-means clustering technique publication-title: Applied Sciences doi: 10.3390/app10155134 – volume: 5 start-page: 64 year: 2010 ident: ref16 article-title: Finding time quantum of round robin CPU scheduling algorithm in general computing systems using integer programming publication-title: International Journal of Research and Reviews in Applied Sciences (IJRRAS) – volume: 11 start-page: 151 year: 2017 ident: ref12 article-title: Unsupervised learning framework for customer requisition and behavioral pattern classification publication-title: Modern Applied Science doi: 10.5539/mas.v11n9p151 – volume: 6 start-page: 1 year: 2017 ident: ref20 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 – start-page: 243 year: 2015 ident: ref19 article-title: The adaptive80 round robin scheduling algorithm publication-title: Transactions on Engineering Technologies doi: 10.1007/978-94-017-7236-5_17 – start-page: 321 year: 2006 ident: ref9 publication-title: Grouping Multidimensional Data. Springer – volume: 5 start-page: 10 year: 2015 ident: ref18 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 |
| SSID | ssj0036390 |
| Score | 2.253984 |
| Snippet | Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 6271 |
| SubjectTerms | Algorithms Context Datasets Preempting Scheduling Similarity Switches Time sharing |
| Title | ATS: A Novel Time-Sharing CPU Scheduling Algorithm Based on Features Similarities |
| URI | https://www.proquest.com/docview/2590732796 |
| Volume | 70 |
| WOSCitedRecordID | wos000707364500002&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: 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/eLvHCXMwpV1LT8JAEN4oePAiPiOKZg9ePKxAt3RbLwYIRA-SKpDgqdlXhQQo8vr9zrZbHxcvnnro9pF-M_PN7HbnQ-hGeUy4fsyIoIwS1xGSCFdJQgVwtQb-FiJOxSZYr-ePRkFoJ9xW9rfKPCamgVol0syRVyFNB2t0WOA9LD6IUY0yq6tWQmMXFU2nMrDzYqvTC1_zWEyBf9MtkQ3XIw6wWbZQCSlLza3KmWlh6Dh3QHOpzNpPYvodl1Oy6Zb--5qH6MCmmbiZ2cUR2tHzY1TKJRyw9egT9NIc9O9xE_eSrZ5isx-EmBbOwGe4HQ5h3BioyOxYx83pOzxnPZ7hFhCfwskcm_RxA-U67k9mE6iQ0-asp2jY7Qzaj8SqLBBJ63RNHMqpx-va5Uw1pHI49zm4sQ44jT3IxjQzPc3qbgypl_SZ8GMacEBexHUVCNmgZ6gwT-b6HGFR06xh1hkVhSrF4cbFY84D4akalb4qo2r-iSNpW5AbJYxpBKVICkoEoEQGlCgDpYxuv65YZO03_hhbySGJrCOuom88Lv4-fYn2zb2y2ZUKKqyXG32F9uR2PVktr61dwTF8eg7fPgGa3Naa |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTsMwEB2hggQXdsSOD3DgYNraaZwgIVQ2UQFVEUWCU_AWqNQF2gLip_hGxllYLtw4cI5jaeKn98Z2Zh7ApvGF8oJYUMUFpx5TmirPaMoVarVF_VYqTswmRL0e3NyEjRF4z2th3G-VOScmRG162p2RFzFNRzQyEfr7j0_UuUa529XcQiOFxZl9e8Ut22CvdoTru8XYyXHz8JRmrgJU8zIfUsYl92XZelKYijZMykAibG0oeexj9mGF6-FV9mJMNXQgVBDzUGKkKi6bUGnnEoGUP-oh2EsFGG3ULhq3Ofdz1PukBLPi-ZSheqYXo5gilbyi7riWiYztoKwmtm7fhfCnDiTidjL13z7LNExmaTSpprifgRHbnYWp3KKCZIw1B5fV5tUuqZJ678W2iat3oa5FNeo1OWxc47gHlFpXkU-q7XuMa_jQIQco7Ib0usSlx899OyBXrU6rLftJ89l5uP6TwBag0O117SIQVbKi4u5RDcddGJOOwmIpQ-WbEteBWYJivqSRzlqsO6ePdoRbrQQEEYIgciCIUhAswfbnG49pe5Ffxq7mEIgyohlEX-u__PvjDRg_bV6cR-e1-tkKTLh505OkVSgM-892Dcb0y7A16K9nmCZw99d4-QBinDNm |
| 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=ATS%3A+A+Novel+Time-Sharing+CPU+Scheduling+Algorithm+Based+on+Features+Similarities&rft.jtitle=Computers%2C+materials+%26+continua&rft.au=M.+Mostafa%2C+Samih&rft.au=Ahmed+Idris%2C+Sahar&rft.au=Kaur%2C+Manjit&rft.date=2022&rft.issn=1546-2226&rft.volume=70&rft.issue=3&rft.spage=6271&rft.epage=6288&rft_id=info:doi/10.32604%2Fcmc.2022.021978&rft.externalDBID=n%2Fa&rft.externalDocID=10_32604_cmc_2022_021978 |
| 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 |