An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms
With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The time slic...
Saved in:
| Published in: | al-Tarbiyah wa-al-ʻilm lil-ʻulūm al-insānīyah : majallah ʻilmīyah muḥakkamah taṣduru ʻan Kullīyat al-Tarbiyah lil-ʻUlūm al-Insānīyah fī Jāmiʻat al-Mawṣil Vol. 32; no. 2; pp. 20 - 29 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Mosul, Iraq
جامعة الموصل - كلية التربية
2023
University of Mosul, College of Education for Pure Science |
| Subjects: | |
| ISSN: | 1812-125X, 2664-2530 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The time slice length affects the measuring criteria of the performance of the algorithms. Researchers suggested and are continuing to suggest algorithms to obtain the best values for the time slice. Adopting one algorithm over another in a system and for a class of applications requires choosing the best-performing algorithm. This research is an attempt to develop an objective approach for accurate comparison between algorithms. For the sake of objectivity in comparison, five algorithms similar in their general characteristics were chosen; a Modified Median Round Robin Algorithm (MMRRA), A New Median-Average Round Robin Scheduling Algorithm (NMARR), An Improved Round Robin Scheduling Algorithm with Varying Time Quantum (IRRVQ), A Modified Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum (RRDTQ), Improved Round Robin Algorithm with Progressive Dynamic Quantum (IRRPDQ). The results showed that the outperformance of an algorithm over a group of algorithms according to a specific criterion is not absolute, permanent, and fixed in value and that resorting to statistical measures is the best way to clarify the degree of performance of the algorithms. |
|---|---|
| AbstractList | مع ظهور الحاجة إلى الأنظمة التفاعلية برزت الحاجة الماسة إلى أنظمة تقاسم الوقت. ظهرت خوارزميات راوند روبن لتحقيق تقاسم الوقت. تعتمد درجة أداء أنظمة تقاسم الوقت بشكل كبير على طول الشريحة الزمنية في خوارزميات راون روبن. يؤثر طول الشريحة الزمنية في المعايير المستخدمة في أداء الخوارزميات. اقترحت ولا زالت تقترح الخوارزميات لأجل الحصول على القيم الأفضل للشريحة الزمنية. إن تبني خوارزمية دون أخرى في نظام ما ولصنف من التطبيقات يتطلب اختيار الخوارزمية الأفضل أداء. هذا البحث محاولة لوضع نهج موضوعي للمقارنة الدقيقة بين الخوارزميات. ولأجل الموضوعية في المقارنة، تم اختيار خمس خوارزميات تتشابه في خصائصها العامة؛ خوارزمية راوند روبن الوسيط المعدلة (MMRRA)، خوارزمية راوند روبن الوسيط-المعدل الجديدة (NMARR)، خوارزمية جدولة راوند روبن محسنة مع الكم الزمني المتغير (IRRVQ)، خوارزمية جدولة وحدة المعالجة المركزية راوند روبن المعدلة، خوارزمية جدولة وحدة المعالجة المركزية راوند روبن المعدلة مع الكم الزمني الديناميكي (RRDTQ) أظهرت النتائج أن التفوق لخوارزمية على مجموعة خوارزميات باعتبار معيار معين لا يكون مطلقا، دائما وثابت القيمة وأن اللجوء إلى المقاييس الإحصائية هو الأفضل في توضيح درجة أداء الخوارزميات.
With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The time slice length affects the measuring criteria of the performance of the algorithms. Researchers suggested and are continuing to suggest algorithms to obtain the best values for the time slice. Adopting one algorithm over another in a system and for a class of applications requires choosing the best-performing algorithm. This research is an attempt to develop an objective approach for accurate comparison between algorithms. For the sake of objectivity in comparison, five algorithms similar in their general characteristics were chosen; a Modified Median Round Robin Algorithm (MMRRA), A New Median-Average Round Robin Scheduling Algorithm (NMARR), An Improved Round Robin Scheduling Algorithm with Varying Time Quantum (IRRVQ), A Modified Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum (RRDTQ), Improved Round Robin Algorithm with Progressive Dynamic Quantum (IRRPDQ). The results showed that the outperformance of an algorithm over a group of algorithms according to a specific criterion is not absolute, permanent, and fixed in value and that resorting to statistical measures is the best way to clarify the degree of performance of the algorithms. With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The time slice length affects the measuring criteria of the performance of the algorithms. Researchers suggested and are continuing to suggest algorithms to obtain the best values for the time slice. Adopting one algorithm over another in a system and for a class of applications requires choosing the best-performing algorithm. This research is an attempt to develop an objective approach for accurate comparison between algorithms. For the sake of objectivity in comparison, five algorithms similar in their general characteristics were chosen; a Modified Median Round Robin Algorithm (MMRRA), A New Median-Average Round Robin Scheduling Algorithm (NMARR), An Improved Round Robin Scheduling Algorithm with Varying Time Quantum (IRRVQ), A Modified Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum (RRDTQ), Improved Round Robin Algorithm with Progressive Dynamic Quantum (IRRPDQ). The results showed that the outperformance of an algorithm over a group of algorithms according to a specific criterion is not absolute, permanent, and fixed in value and that resorting to statistical measures is the best way to clarify the degree of performance of the algorithms. |
| Abstract_FL | With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve time-sharing. The performance of time-sharing systems depends largely on the length of the time slice in the round-robin algorithms. The time slice length affects the measuring criteria of the performance of the algorithms. Researchers suggested and are continuing to suggest algorithms to obtain the best values for the time slice. Adopting one algorithm over another in a system and for a class of applications requires choosing the best-performing algorithm. This research is an attempt to develop an objective approach for accurate comparison between algorithms. For the sake of objectivity in comparison, five algorithms similar in their general characteristics were chosen; a Modified Median Round Robin Algorithm (MMRRA), A New Median-Average Round Robin Scheduling Algorithm (NMARR), An Improved Round Robin Scheduling Algorithm with Varying Time Quantum (IRRVQ), A Modified Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum (RRDTQ), Improved Round Robin Algorithm with Progressive Dynamic Quantum (IRRPDQ). The results showed that the outperformance of an algorithm over a group of algorithms according to a specific criterion is not absolute, permanent, and fixed in value and that resorting to statistical measures is the best way to clarify the degree of performance of the algorithms. |
| Author | Ahmad, Abdulnasir Younis |
| Author_FL | Ahmad, Abdulnasir Younis |
| Author_FL_xml | – sequence: 1 fullname: Ahmad, Abdulnasir Younis |
| Author_xml | – sequence: 1 fullname: Ahmad, Abdulnasir Younis |
| BookMark | eNqNkE1LAzEQhoMoWKt_QeMP2Dr52M324KEUv6AgtAreljQ7aVO6m5JND_33pl1B8ORpeIfnnYHnipy3vkVC7hiMhCjH4wes991mxIGLERNKiTwNps7IgBeFzHgu4JwMWMl4xnj-dUluum4DALxUQqpiQKpJSycxYrOLNHq6wEgXUbe1DnVHrQ8p7euDa1c0LenUNzsdjimukT5Z64zD1hyot3Tu94mY-6VLF7crH1xcN901ubB62-HNzxySz-enj-lrNnt_eZtOZpnmACorWY2AwJk0JZNWAY5zYKgRpRJFbTXK8dLoWuQ1cjCyxNIsS1sILAwAy8WQqP6uCb7rAtpqF1yjw6FiUJ1UVSdV1VFV1auqjqpS8_FP07ioo_NtDNpt_9G_7fuY3qHVv48VT3CRgPse0NsmSdw3ev3LSGBCcvENABCJog |
| CitedBy_id | crossref_primary_10_1109_ACCESS_2025_3534031 |
| ContentType | Journal Article |
| DBID | NE4 ADJCN AHFXO AAYXX CITATION |
| DOI | 10.33899/edusj.2023.137735.1317 |
| DatabaseName | EduSearch Arabic Database الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| DocumentTitleAlternate | محاولة وضع معايير لدراسة ومقارنة كفاءة خوارزميات راوند روبن |
| EISSN | 2664-2530 |
| EndPage | 29 |
| ExternalDocumentID | 10_33899_edusj_2023_137735_1317 1722026 1401342 |
| GroupedDBID | ALMA_UNASSIGNED_HOLDINGS GROUPED_DOAJ NE4 ADJCN AHFXO AAYXX CITATION |
| ID | FETCH-LOGICAL-a2007-81de0e0214c814f70e9501eaee4736dfae49bcad35de20c48e8cb8f63e6c00153 |
| ISSN | 1812-125X |
| IngestDate | Sat Nov 29 07:37:44 EST 2025 Tue Nov 18 22:32:14 EST 2025 Tue Nov 04 00:21:21 EST 2025 Tue Feb 18 16:36:43 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a2007-81de0e0214c814f70e9501eaee4736dfae49bcad35de20c48e8cb8f63e6c00153 |
| OpenAccessLink | https://doi.org/10.33899/edusj.2023.137735.1317 |
| PageCount | 10 |
| ParticipantIDs | crossref_primary_10_33899_edusj_2023_137735_1317 crossref_citationtrail_10_33899_edusj_2023_137735_1317 emarefa_primary_1722026 almandumah_primary_1401342 |
| PublicationCentury | 2000 |
| PublicationDate | 2023. |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – year: 2023 text: 2023. |
| PublicationDecade | 2020 |
| PublicationPlace | Mosul, Iraq |
| PublicationPlace_xml | – name: Mosul, Iraq |
| PublicationTitle | al-Tarbiyah wa-al-ʻilm lil-ʻulūm al-insānīyah : majallah ʻilmīyah muḥakkamah taṣduru ʻan Kullīyat al-Tarbiyah lil-ʻUlūm al-Insānīyah fī Jāmiʻat al-Mawṣil |
| PublicationTitleAlternate | مجلة التربية والعلم |
| PublicationYear | 2023 |
| Publisher | جامعة الموصل - كلية التربية University of Mosul, College of Education for Pure Science |
| Publisher_xml | – name: جامعة الموصل - كلية التربية – name: University of Mosul, College of Education for Pure Science |
| SSID | ssj0002873476 |
| Score | 2.2185407 |
| Snippet | With the advent of the need for interactive systems, the urgent need for time-sharing systems has emerged. Round-robin algorithms have emerged to achieve... مع ظهور الحاجة إلى الأنظمة التفاعلية برزت الحاجة الماسة إلى أنظمة تقاسم الوقت. ظهرت خوارزميات راوند روبن لتحقيق تقاسم الوقت. تعتمد درجة أداء أنظمة تقاسم الوقت... |
| SourceID | crossref emarefa almandumah |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 20 |
| SubjectTerms | تقسيم الوقت خوارزميات الجدولة نظم التشغيل |
| Title | An Attempt to Set Standards for Studying and Comparing the Efficiency of Round Robin Algorithms |
| URI | https://search.mandumah.com/Record/1401342 https://search.emarefa.net/detail/BIM-1722026 |
| Volume | 32 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals - NZ customDbUrl: eissn: 2664-2530 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002873476 issn: 1812-125X databaseCode: DOA dateStart: 20050101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb5swFLbabpO6h2nTbuku8sN4QmQEczGPJMq0azVp6dY9IQNmIQVSEejl3-_YGEirSl0f9gK2g08cDh8-54vPMULvXLjzzObMsJlrgoPiMSMSJA7z49T1WBJxmez551fv8JAeH_vfd3Z_dbEwZ7lXlvTiwj_9r6qGNlC2CJ29g7p7odAAZVA6HEHtcPwnxQelHtQi41Qt7MofvBYGpaQLZOoFuXLwsgtNnLXbEKqQqbnMJyGDMUWOErHjki4DxPQg_7Ousnqpcpsra5blxoJVUXbJlvo5M6CqzQJtOs3yQs-zrtaA_epowbTQ4QJBb0v7tRSnYCq6ClaiYCtB6UOlkzB8XjTafKJNqRY47OSEFdAENq9o8rWAJE3VqF7wrvoCLnXXU7DZwwCHAR1tD-jTDQNK26L-WRnemRIvBX5j5_13D-tTgihp8pJtskr_PdaDZcGSbULFIluESjsHgM1jgN133E6Rsg3MGNuwHPUXkpo4BmK299_VLGBu2RMtoXN9piIir6F4PpNmsxqLYYxF7kfiwKkNZr2aG_zanN2vpAQfTooKpaBQCApbQaEQtIvuWZ7j0y2uYSUZVY_YcuPF_se2ax-lrPc3D-oh2md5Ac9mA3q-YsY94AWDAtuyzBaP0SPlUuGghcITtMPLpygMSqxggOs1BhjgHgYYYIA7GGBoxD0MMMAADzDA6xRLGGAJAzzA4Bk6-jBfzD4aajMRg0k6HvwybnKRITCmEzv1TO475oQzzm2PuEnKuO1HMUuIk3DLjG3KaRzR1CXcjYVjQZ6jvXJd8pcI8wmNGeVJnPLEpsnEp2YapxEhZmolxPVG6GC4UeFpmzUmlEyGbY2Q2924MFZp-MVuMHl4iypHyOw79jJv6_JCaWbo4VlwlXtwd2Gv0P6Altdor64a_gbdj8_qbFO9lc_XX9fk0uU |
| linkProvider | Directory of Open Access Journals |
| 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+Attempt+to+Set+Standards+for+Studying+and+Comparing+the+Efficiency+of+Round+Robin+Algorithms&rft.jtitle=al-Tarbiyah+wa-al-%CA%BBilm+lil-%CA%BBul%C5%ABm+al-ins%C4%81n%C4%AByah+%3A+majallah+%CA%BBilm%C4%AByah+mu%E1%B8%A5akkamah+ta%E1%B9%A3duru+%CA%BBan+Kull%C4%AByat+al-Tarbiyah+lil-%CA%BBUl%C5%ABm+al-Ins%C4%81n%C4%AByah+f%C4%AB+J%C4%81mi%CA%BBat+al-Maw%E1%B9%A3il&rft.au=Abdulnasir+Y.+Ahmad&rft.date=2023-01-01&rft.issn=1812-125X&rft.eissn=2664-2530&rft.volume=32&rft.issue=2&rft.spage=20&rft.epage=29&rft_id=info:doi/10.33899%2Fedusj.2023.137735.1317&rft.externalDBID=n%2Fa&rft.externalDocID=10_33899_edusj_2023_137735_1317 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1812-125X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1812-125X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1812-125X&client=summon |