Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum

Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics as the average waiting time (AWT), average turnaround time (ATAT...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht 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 Jg. 31; H. 4; S. 105 - 115
1. Verfasser: Ahmad, Abdulnasir Younis
Format: Journal Article
Sprache:Arabisch
Englisch
Veröffentlicht: جامعة الموصل - كلية التربية 01.12.2022
College of Education for Pure Sciences
Schlagworte:
ISSN:1812-125X, 2664-2530
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics as the average waiting time (AWT), average turnaround time (ATAT), response time (RT) and the number of context switches (NCS) of the time-sharing round robin RR algorithms. The research aims to propose an algorithm that achieves a short waiting time while maintaining a reasonable response time, which is the most important characteristic of time-sharing algorithms. The Different Arrival-Dynamic Quantum Round Robin (DADQRR) algorithm bases its work on different parameters to adjust the time slice value dynamically. The algorithm has been compared to three other algorithms that are similar in terms of dealing with different arrival times, namely AN, MARR, RR. The algorithm outperformed the three algorithms at range from 6.155% to 31.409% in term of AWT. It achieved an outperformance of 5.924% to 30.850%, considering the TAT. The ranges of outperformance values resulted from the difference in the ranges of arrival times, as well as in the ranges of burst times.
AbstractList Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics such as the average waiting time (AWT), average turnaround time (ATAT), response time (RT), and number of context switches (NCS) of the time-sharing round robin RR algorithms. The research aims to propose an algorithm that achieves a short waiting time while maintaining a reasonable response time, which is the most important characteristic of time-sharing algorithms. The Different Arrival-Dynamic Quantum Round Robin (DADQRR) algorithm bases its work on different parameters to adjust the time slice value dynamically. The algorithm has been compared to three other algorithms that are similar in terms of dealing with different arrival times, namely AN, MARR, and RR. The algorithm outperformed the three algorithms at a range from 6.155% to 31.409% in terms of AWT. It achieved an outperformance of 5.924% to 30.850%, considering the TAT. The ranges of outperformance values resulted from the difference in the ranges of arrival times, as well as in the ranges of burst times.
Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics as the average waiting time (AWT), average turnaround time (ATAT), response time (RT) and the number of context switches (NCS) of the time-sharing round robin RR algorithms. The research aims to propose an algorithm that achieves a short waiting time while maintaining a reasonable response time, which is the most important characteristic of time-sharing algorithms. The Different Arrival-Dynamic Quantum Round Robin (DADQRR) algorithm bases its work on different parameters to adjust the time slice value dynamically. The algorithm has been compared to three other algorithms that are similar in terms of dealing with different arrival times, namely AN, MARR, RR. The algorithm outperformed the three algorithms at range from 6.155% to 31.409% in term of AWT. It achieved an outperformance of 5.924% to 30.850%, considering the TAT. The ranges of outperformance values resulted from the difference in the ranges of arrival times, as well as in the ranges of burst times.
Abstract_FL Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics as the average waiting time (AWT), average turnaround time (ATAT), response time (RT) and the number of context switches (NCS) of the time-sharing round robin RR algorithms. The research aims to propose an algorithm that achieves a short waiting time while maintaining a reasonable response time, which is the most important characteristic of time-sharing algorithms. The Different Arrival-Dynamic Quantum Round Robin (DADQRR) algorithm bases its work on different parameters to adjust the time slice value dynamically. The algorithm has been compared to three other algorithms that are similar in terms of dealing with different arrival times, namely AN, MARR, RR. The algorithm outperformed the three algorithms at range from 6.155% to 31.409% in term of AWT. It achieved an outperformance of 5.924% to 30.850%, considering the TAT. The ranges of outperformance values resulted from the difference in the ranges of arrival times, as well as in the ranges of burst times.
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 eNo90NlOwzAQBVALFYlS-g2YD0hxxvGSx9KyVEJiKxJv0cR2WleJg5ymiL8nLOLlXmkejq7mlIxCGxwh5ymbca7z_NLZvtvNgAHMUi6YHgoUPyJjkDJLQHA2IuNUp5CkIN5OyLTrdowx0IpnSo6JWTXvsT04S5_bPnxn6QNdPL7SF7Md8NqHDZ3Xmzb6_bahH0PSpa8qF13Y03mM_oA1XfvGdfQKu8FpA11-Bmy8oU89hn3fnJHjCuvOTf96Ql5urteLu-T-4Xa1mN8nmAMmKK3IRW6UAGWqSlrFHGOVYFiWyBFyJpkYditZlsoKB0IZlmkL3IItJZ-Q1a9qW9wV79E3GD-LFn3xc2jjpsC496Z2xfAiATaTJWQmA6lztOg0h8rYVOsMB-vi18K6wWD7Brf_YsolZ1ryL7dQc5E
ContentType Journal Article
DBID NE4
DOA
DOI 10.33899/edusj.2022.135082.1273
DatabaseName EduSearch Arabic Database
DOAJ: Directory of Open Access Journal (DOAJ)
DatabaseTitleList

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
DocumentTitleAlternate خوارزمية راوند روبن محسنة بأوقات وصول مختلفة ومرتكزة على شريحة زمنية ديناميكية
EISSN 2664-2530
EndPage 115
ExternalDocumentID oai_doaj_org_article_12752d46b24c42689adae832fcd1884a
1363086
GroupedDBID ALMA_UNASSIGNED_HOLDINGS
GROUPED_DOAJ
NE4
ID FETCH-LOGICAL-a92a-a6d5959c7527cff6d70e00f50abba3a29060528776bb7d5e257c048d23d2db63
IEDL.DBID DOA
ISSN 1812-125X
IngestDate Fri Oct 03 12:49:27 EDT 2025
Tue Feb 18 16:36:32 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language Arabic
English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a92a-a6d5959c7527cff6d70e00f50abba3a29060528776bb7d5e257c048d23d2db63
OpenAccessLink https://doaj.org/article/12752d46b24c42689adae832fcd1884a
PageCount 11
ParticipantIDs doaj_primary_oai_doaj_org_article_12752d46b24c42689adae832fcd1884a
almandumah_primary_1363086
PublicationCentury 2000
PublicationDate 2022-12-01
PublicationDateYYYYMMDD 2022-12-01
PublicationDate_xml – month: 12
  year: 2022
  text: 2022-12-01
  day: 01
PublicationDecade 2020
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 2022
Publisher جامعة الموصل - كلية التربية
College of Education for Pure Sciences
Publisher_xml – name: جامعة الموصل - كلية التربية
– name: College of Education for Pure Sciences
SSID ssj0002873476
Score 2.2158802
Snippet Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the...
SourceID doaj
almandumah
SourceType Open Website
Publisher
StartPage 105
SubjectTerms dynamic quantum
round robin
turnaround time
varying arrival times
waiting time
أنظمة التشغيل
الشريحة الزمنية
علم الخوارزميات
Title Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum
URI https://search.mandumah.com/Record/1363086
https://doaj.org/article/12752d46b24c42689adae832fcd1884a
Volume 31
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  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/eLvHCXMwrV27TsMwFLUQYigDAgGi5SEPrKGJnTjJ2AcVA6oKBalbdP1IH2pa1DZ8P9dxBGViYUrkwYnOtX19rOtzCLmXEIAOVOAFErlJmIPv4YvvQZRGiiUStFPXf46Hw2QySUd7Vl-2JszJAzvg2laAnOlQSBYqzCZJChoMDsNc6SBJwmpr5MfpHplaVEdGMQ8rZzmbwTzM4hNX3MWtnlwbV_HtAskhY9b3AbPgA36GH5MGLAsk8GUBs18a_lWyGZySk3qXSDvu787IAWzOiXIHAEbTV-uFRKurW7Q3eqdjRF7bkvIp7Syna-T7s4LaE1bar_1PdtjXZo6jilZ3PmgXk5em6xXtO0d6-lIixGVxQcaDx7fek1d7JHiQMvBAIJZRqhCjWOW50LFvfD-PfJASOFgtdz9CMGIhZawjgxNU4ZzVjGumpeCX5HC1XpkrQqUSUW5CkMwgQ5RhagTLU3zKyCR5wpqk9QNO9uGkMLKAC46kqEm6FqzvZqtZXTVgJLM6ktlfkWz9RyfXpGHD6gpObsjhblOaW3KkPnfz7eauGiRffPm_0g
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=Improved+Round+Robin+CPU+Scheduling+Algorithm+with+Different+Arrival+Times+Based+on+Dynamic+Quantum&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=%D9%90Abdulnasir+Ahmad&rft.date=2022-12-01&rft.pub=College+of+Education+for+Pure+Sciences&rft.issn=1812-125X&rft.eissn=2664-2530&rft.volume=31&rft.issue=4&rft.spage=105&rft.epage=115&rft_id=info:doi/10.33899%2Fedusj.2022.135082.1273&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_12752d46b24c42689adae832fcd1884a
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