Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique

Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU sc...

Full description

Saved in:

Bibliographic Details
Published in:	Applied sciences Vol. 10; no. 15; p. 5134
Main Authors:	Mostafa, Samih M., Amano, Hirofumi
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.08.2020
Subjects:	Algorithms Classification Clustering CPU scheduling Datasets K-means Operating systems round robin Scheduling Timesharing turnaround time waiting time
ISSN:	2076-3417, 2076-3417
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The authors performed comparative study of the proposed approach and popular scheduling algorithms on nine groups of processes vary in their attributes. The evaluation was measured in terms of waiting time, turnaround time, and NCS. The experiments showed that the proposed approach gives better results.
AbstractList	Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The authors performed comparative study of the proposed approach and popular scheduling algorithms on nine groups of processes vary in their attributes. The evaluation was measured in terms of waiting time, turnaround time, and NCS. The experiments showed that the proposed approach gives better results.
Author	Amano, Hirofumi Mostafa, Samih M.
Author_xml	– sequence: 1 givenname: Samih M. orcidid: 0000-0001-9234-5898 surname: Mostafa fullname: Mostafa, Samih M. – sequence: 2 givenname: Hirofumi surname: Amano fullname: Amano, Hirofumi
BookMark	eNptUctKBDEQDKLg8-QPDHiU0SSdnZkcdX2iovg4h85jd7PMJmsyc9i_d3QVROxDd9NUFdXULtkMMThCDhk9AZD0FJdLRtloxEBskB1O66oEwerNX_s2Och5ToeSDBpGd8jzxSrgwpviOfbBDl37UIyf3ooXM3O2b32YFmftNCbfzRbFOWZnixiKu_LBYcjFuO1z59In6tWZWfDvvdsnWxNsszv4nnvk7erydXxT3j9e347P7ksjgHalbiyikVRL11iwzlROSD6yskZdS7BMV9bWIBBYhYwazhxYpMC0qaDhNeyR27WujThXy-QXmFYqoldfh5imClPnTeuUrB0KVgnb2EaMGNWV5FzopuFSTyQ1g9bRWmuZ4vBC7tQ89ikM9hUXXAKIGuiAYmuUSTHn5CbK-A47H0OX0LeKUfWZhPqVxMA5_sP5cfof-gN5IomJ
CitedBy_id	crossref_primary_10_1109_ACCESS_2025_3534031 crossref_primary_10_3233_JIFS_201077 crossref_primary_10_3390_computation10120223 crossref_primary_10_1007_s12530_025_09723_8 crossref_primary_10_1145_3529096 crossref_primary_10_7717_peerj_cs_2531 crossref_primary_10_32604_cmc_2021_014675 crossref_primary_10_32604_cmc_2022_021978 crossref_primary_10_1177_1461348420979480 crossref_primary_10_3390_fi15030104
Cites_doi	10.4236/jcc.2016.44013 10.1186/1687-1499-2014-226 10.1007/978-3-319-19369-4_5 10.1007/978-3-642-29807-3_1 10.1109/SoutheastCon42311.2019.9020439 10.1016/j.procs.2020.01.037 10.1109/ICCMC.2019.8819679 10.1007/s40745-015-0040-1 10.1109/C-CODE.2017.7918936 10.1007/978-94-017-7236-5_17 10.1016/j.swevo.2018.09.008 10.3390/j2020016 10.1108/MBE-12-2019-0128 10.1109/ICDM.2010.35 10.5539/mas.v11n9p151 10.1016/S1383-7621(00)00065-5 10.2298/CSIS180601007L 10.4236/jcc.2015.34005 10.1002/ece3.5774
ContentType	Journal Article
Copyright	2020. This work is licensed under http://creativecommons.org/licenses/by/3.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: 2020. This work is licensed under http://creativecommons.org/licenses/by/3.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 ABUWG AFKRA AZQEC BENPR CCPQU DWQXO PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS DOA
DOI	10.3390/app10155134
DatabaseName	CrossRef ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central ProQuest One ProQuest Central Korea 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 DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New)
DatabaseTitleList	Publicly Available Content Database CrossRef
Database_xml	– sequence: 1 dbid: DOA name: DOAJ: Directory of Open Access Journal (DOAJ) url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Sciences (General)
EISSN	2076-3417
ExternalDocumentID	oai_doaj_org_article_97ea4164d8d84510b69224b8829bf90c 10_3390_app10155134
GroupedDBID	.4S 2XV 5VS 7XC 8CJ 8FE 8FG 8FH AADQD AAFWJ AAYXX ADBBV ADMLS AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS APEBS ARCSS BCNDV BENPR CCPQU CITATION CZ9 D1I D1J D1K GROUPED_DOAJ IAO IGS ITC K6- K6V KC. KQ8 L6V LK5 LK8 M7R MODMG M~E OK1 P62 PHGZM PHGZT PIMPY PROAC TUS ABUWG AZQEC DWQXO PKEHL PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c430t-b8daac90b9e8d3dec6e4925d97ab793d1b6dd734a316a10c21e3da031bc638273
IEDL.DBID	PIMPY
ISICitedReferencesCount	12
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000559193100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2076-3417
IngestDate	Tue Oct 14 18:56:31 EDT 2025 Mon Oct 20 03:02:29 EDT 2025 Tue Nov 18 20:54:08 EST 2025 Sat Nov 29 07:20:18 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	15
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c430t-b8daac90b9e8d3dec6e4925d97ab793d1b6dd734a316a10c21e3da031bc638273
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-9234-5898
OpenAccessLink	https://www.proquest.com/publiccontent/docview/2429334730?pq-origsite=%requestingapplication%
PQID	2429334730
PQPubID	2032433
ParticipantIDs	doaj_primary_oai_doaj_org_article_97ea4164d8d84510b69224b8829bf90c proquest_journals_2429334730 crossref_citationtrail_10_3390_app10155134 crossref_primary_10_3390_app10155134
PublicationCentury	2000
PublicationDate	2020-08-01
PublicationDateYYYYMMDD	2020-08-01
PublicationDate_xml	– month: 08 year: 2020 text: 2020-08-01 day: 01
PublicationDecade	2020
PublicationPlace	Basel
PublicationPlace_xml	– name: Basel
PublicationTitle	Applied sciences
PublicationYear	2020
Publisher	MDPI AG
Publisher_xml	– name: MDPI AG
References	Chandiramani (ref_1) 2019; 165 ref_14 Starczewski (ref_22) 2015; Volume 9120 Singh (ref_9) 2015; 3 ref_11 ref_33 ref_10 ref_31 Guan (ref_27) 2019; 44 Tajwar (ref_15) 2017; 13 ref_16 ref_37 Singh (ref_12) 2010; 2 Mostafa (ref_28) 2019; 97 Mostafa (ref_19) 2018; 8 Lasek (ref_20) 2019; 16 Shafi (ref_13) 2019; 17 ref_25 Harwood (ref_32) 2001; 47 Mostafa (ref_17) 2019; 5 ref_23 Sarhan (ref_38) 2017; 6 ref_3 ref_29 Rajput (ref_2) 2012; 1 Zouaoui (ref_35) 2019; 7 ref_26 Datta (ref_34) 2015; 5 Mostafa (ref_18) 2010; 5 Pandey (ref_36) 2016; 4 ref_8 Xu (ref_24) 2015; 2 ref_5 Lengyel (ref_21) 2019; 9 ref_4 ref_7 Inyang (ref_30) 2017; 11 ref_6
References_xml	– volume: 6 start-page: 1 year: 2017 ident: ref_38 article-title: A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique publication-title: J. Cloud Comput. – volume: 17 start-page: 90 year: 2019 ident: ref_13 article-title: A Novel Amended Dynamic Round Robin Scheduling Algorithm for Timeshared Systems publication-title: Int. Arab. J. Inf. Technol. – ident: ref_5 – volume: 13 start-page: 941 year: 2017 ident: ref_15 article-title: CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice publication-title: J. Inf. Process. Syst. – volume: 97 start-page: 2973 year: 2019 ident: ref_28 article-title: Effect of clustering data in improving machine learning model accuracy publication-title: J. Theor. Appl. Inf. Technol. – volume: 5 start-page: 10 year: 2015 ident: ref_34 article-title: Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice publication-title: Int. J. Educ. Manag. Eng. – volume: 8 start-page: 142 year: 2018 ident: ref_19 article-title: Proportional Weighted Round Robin: A Proportional Share CPU Scheduler in Time Sharing Systems publication-title: Int. J. New Comput. Arch. Appl. – volume: 4 start-page: 146 year: 2016 ident: ref_36 article-title: Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling publication-title: J. Comput. Commun. doi: 10.4236/jcc.2016.44013 – ident: ref_16 doi: 10.1186/1687-1499-2014-226 – volume: Volume 9120 start-page: 49 year: 2015 ident: ref_22 article-title: Performance Evaluation of the Silhouette Index BT publication-title: Artificial Intelligence and Soft Computing doi: 10.1007/978-3-319-19369-4_5 – ident: ref_37 – ident: ref_14 – ident: ref_25 doi: 10.1007/978-3-642-29807-3_1 – ident: ref_11 doi: 10.1109/SoutheastCon42311.2019.9020439 – volume: 7 start-page: 190 year: 2019 ident: ref_35 article-title: Improved time quantum length estimation for round robin scheduling algorithm using neural network publication-title: Indones. J. Electr. Eng. Inform. – volume: 165 start-page: 363 year: 2019 ident: ref_1 article-title: A Modified Priority Preemptive Algorithm for CPU Scheduling publication-title: Procedia Comput. Sci. doi: 10.1016/j.procs.2020.01.037 – ident: ref_3 doi: 10.1109/ICCMC.2019.8819679 – ident: ref_6 – ident: ref_8 – volume: 2 start-page: 165 year: 2015 ident: ref_24 article-title: A Comprehensive Survey of Clustering Algorithms publication-title: Ann. Data Sci. doi: 10.1007/s40745-015-0040-1 – ident: ref_10 doi: 10.1109/C-CODE.2017.7918936 – ident: ref_4 – ident: ref_29 – ident: ref_33 – ident: ref_7 doi: 10.1007/978-94-017-7236-5_17 – volume: 44 start-page: 876 year: 2019 ident: ref_27 article-title: Particle swarm Optimized Density-based Clustering and Classification: Supervised and unsupervised learning approaches publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2018.09.008 – ident: ref_26 doi: 10.3390/j2020016 – ident: ref_23 doi: 10.1108/MBE-12-2019-0128 – ident: ref_31 doi: 10.1109/ICDM.2010.35 – volume: 11 start-page: 151 year: 2017 ident: ref_30 article-title: Unsupervised Learning Framework for Customer Requisition and Behavioral Pattern Classification publication-title: Mod. Appl. Sci. doi: 10.5539/mas.v11n9p151 – volume: 5 start-page: 64 year: 2010 ident: ref_18 article-title: Finding Time Quantum of Round Robin CPU Scheduling Algorithm in General Computing Systems Using Integer Programming publication-title: Int. J. New Comput. Archit. Appl. – volume: 47 start-page: 181 year: 2001 ident: ref_32 article-title: Using fundamental electrical theory for varying time quantum uni-processor scheduling publication-title: J. Syst. Arch. doi: 10.1016/S1383-7621(00)00065-5 – volume: 16 start-page: 469 year: 2019 ident: ref_20 article-title: Density-based clustering with constraints publication-title: Comput. Sci. Inf. Syst. doi: 10.2298/CSIS180601007L – volume: 3 start-page: 40 year: 2015 ident: ref_9 article-title: Varying Response Ratio Priority: A Preemptive CPU Scheduling Algorithm (VRRP) publication-title: J. Comput. Commun. doi: 10.4236/jcc.2015.34005 – volume: 5 start-page: 11 year: 2019 ident: ref_17 article-title: An Adjustable Round Robin Scheduling Algorithm in Interactive Systems publication-title: Inf. Eng. Express – volume: 2 start-page: 2383 year: 2010 ident: ref_12 article-title: An optimized round robin scheduling algorithm for CPU scheduling publication-title: Int. J. Comput. Sci. Eng. – volume: 9 start-page: 13231 year: 2019 ident: ref_21 article-title: Silhouette width using generalized mean—A flexible method for assessing clustering efficiency publication-title: Ecol. Evol. doi: 10.1002/ece3.5774 – volume: 1 start-page: 1 year: 2012 ident: ref_2 article-title: A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems publication-title: J. Adv. Eng. Technol.
SSID	ssj0000913810
Score	2.3130193
Snippet	Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within...
SourceID	doaj proquest crossref
SourceType	Open Website Aggregation Database Enrichment Source Index Database
StartPage	5134
SubjectTerms	Algorithms Classification Clustering CPU scheduling Datasets K-means Operating systems round robin Scheduling Timesharing turnaround time waiting time
SummonAdditionalLinks	– databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SPOhBtCrWFzl4UGExMWmyOWq1CKKIttDbkmcVait9-PudZLelouDFaxjIMs9v2Mk3CJ1wFYjmwmdGBZlxAbbQPDSzILkngbogPEnLJuTjY97rqaelVV9xJqykBy4Vd6Gk1wAauMtdzsGBjFBQdQwAQ2WCIjZmXyLVUjOVcrCikbqqfJDHoK-P_4NpwgeMfytBian_RyJO1aW9iTYqWIivys_ZQit-WEfrS2SBdbRVheEEn1Zc0Wfb6Pmm3CiPn-N6JJxec-HWUxe_gDFcnDLv46tBfzR-m76-42soWQ6Phvg-e_BQo3BrMItECVGqMydz3UHd9m2ndZdVaxIyyxmZZiZ3WltFjPK5Y85b4SPjoFNSG4g-R41wTjKuGRWaEntJPXMagtlYCD6AL7uoNhwN_R7CJIjcKdcMWgROndVNq6kMIc4fWsl0A53PNVfYikM8rrIYFNBLRDUXS2puoJOF8EdJnfG72HU0wUIk8l2nA_CCovKC4i8vaKDDuQGLKggnBaAPxRiHHLb_H3ccoLXL2Gyn6b9DVJuOZ_4IrdrP6dtkfJz87wtsg93i priority: 102 providerName: Directory of Open Access Journals
Title	Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique
URI	https://www.proquest.com/docview/2429334730 https://doaj.org/article/97ea4164d8d84510b69224b8829bf90c
Volume	10
WOSCitedRecordID	wos000559193100001&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: PRVAON databaseName: DOAJ: Directory of Open Access Journal (DOAJ) customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center) customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest Central Database Suite (ProQuest) customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: PIMPY dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NbxMxEB1BwgEOQAsVgRL50AMgrbrOOt71CTWhFQg1WoVWKqeVPwNSSEqS8vuZ8TqhCMSJ6-5Iu9LzfNnj9wCOhAq5FtJnRoUyExKx0CIMs1AKnwfugvR5FJsoJ5Pq6krV6Xr0Oo1VbmNiDNQt2zPNbWMQPnZLSzvmx5hYsBMXuDzfXn_PSEOKzlqToMZd6BLx1qAD3frDef15t-dCHJgVz9tregV2-3RKzGPVUIjfElPk7_8jPMecc_bo__7tY3iYak920i6WPbjjF_vw4BYj4T7sJV9fs1eJkPr1E5i-a2Xr2ZQ0mFi8MsbG9SX7hIg7GmWfsZP5DL-4-fKNjTAvOrZcsI_ZucdEyMbzG2JjIKuLLWPsU7g8O70Yv8-SFkNmRZFvMlM5ra3KjfKVK5y30hOtoVOlNujijhvpXFkIXXCpeW4H3BdOY8QwFj0ca6QD6CyWC_8MWB5k5ZQbBi2D4M7qodW8DIGGHG1Z6B682QLR2ERUTnoZ8wYbFkKtuYVaD452xtctP8ffzUaE6M6ESLXjg-Vq1iQfbVTpNdanwlWuEhirjFRY4BjsQZQJKrc9ONyC3SRPXze_sH3-79cv4P6AevU4PHgInc3qxr-Ee_bH5ut61Yfu6HRST_txT6CfFu5PODH8Sg
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3fb9MwED6NDgl4GGyAKAzww5AAKcKO3SR-mNDWMa3qWlWjk8ZT8M8yqUtH24H2T-1v3DlNyhCItz3wmpwiOf583519_g5gS0hPlUhcpKVPI5HgXCjhW5FPhaOeWZ84WjabSPv97OREDlbgqr4LE8oqa59YOmo7MWGP_ANSCebeAgH58fx7FLpGhdPVuoXGAhZdd_kTU7bZdmcP5_dNHO9_GrYPoqqrQGQEp_NIZ1YpI6mWLrPcOpO4INBnZao0gtUynVibcqE4SxSjJmaOW4XY1waximyP370DqwLBHjdgddDpDb4sd3WCymbG6OIiIOeShnNoVsYlXPxGfWWHgD8IoGS1_Yf_2_94BGtV_Ex2FoBfhxVXbMCDG6qKG7Be-asZeVuJar97DEd7l4U6OzXkKPSRIuW1N9IeHJPPiFobyvFHZGc8whHOv52RXeR2SyYF6UY9h2RO2uOLoCgRrIa16u0TOL6VkT6FRjEp3DMg1CeZlbblVeIFs0a1jGKp96FQ06RcNeF9PdW5qcTWQ8-PcY5JV8BFfgMXTdhaGp8vNEb-brYbMLM0CcLg5YPJdJRXfiaXqVMYYwub2Uygv9WJxCBNYx4ltZfUNGGzhlNeeatZ_gtLz__9-jXcOxj2DvPDTr_7Au7HYe-hLIbchMZ8euFewl3zY346m76qFgaBr7eNvWujRExp
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3fTxNBEJ4gGKMPKKihiroPmKjJhb3udu_2gRhobWwqzQUhgadzfxaScsW2aPjX-OuYvd5VjMY3Hny9m1yyt9_ON7M7-w3AFpeeKi5cpKVPIi5wLhT3rcgn3FEfWy8cLZtNJINBenwssyW4ru_ChLLK2ieWjtqOTdgj30YqwdybIyC3fVUWkXW6Hy--R6GDVDhprdtpzCHSd1c_MX2b7vQ6ONdvm83up8P256jqMBAZzugs0qlVykiqpUsts84IF8T6rEyURuDaWAtrE8YVi4WKqWnGjlmF60AbxC0yP373HqxgSM4w8VvJevvZyWKHJyhupjGdXwpkTNJwJh2XMQrjv9Fg2S3gDzIoGa77-H_-N09gtYqrye58IazBkivW4dEttcV1WKv82JS8q8S23z-Fg85Voc7PDDkI_aVIeR2OtLMj8hXRbEOZ_pDsjoY4wtnpOdlDzrdkXJB-tO-Q5El7dBmUJoLVYa2G-wyO7mSkz2G5GBduAwj1IrXStrwSnsfWqJZRceJ9KOA0CVMN-FBPe24qEfbQC2SUYzIWMJLfwkgDthbGF3Ptkb-b7QX8LEyCYHj5YDwZ5pX_yWXiFMbe3KY25eiHtZAYvGnMr6T2kpoGbNbQyisvNs1_4erFv1-_gQcIuPxLb9B_CQ-bYUuirJHchOXZ5NK9gvvmx-xsOnldrREC3-4aejchcVUy
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=Dynamic+Round+Robin+CPU+Scheduling+Algorithm+Based+on+K-Means+Clustering+Technique&rft.jtitle=Applied+sciences&rft.au=Mostafa%2C+Samih+M.&rft.au=Amano%2C+Hirofumi&rft.date=2020-08-01&rft.issn=2076-3417&rft.eissn=2076-3417&rft.volume=10&rft.issue=15&rft.spage=5134&rft_id=info:doi/10.3390%2Fapp10155134&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_app10155134
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon