An Efficient Dynamic Round Robin algorithm for CPU scheduling

The efficiency of embedded systems mainly depends on the process scheduling policy of operating systems running on them. Better scheduling algorithms make a system fast using less resources for small time. Out of some important scheduling algorithms, Round Robin algorithm is much efficient. But its...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2017 International Conference on Communication, Computing and Digital Systems (C-CODE) s. 244 - 248
Hlavní autori: Farooq, Muhammad Umar, Shakoor, Aamna, Siddique, Abu Bakar
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.03.2017
Predmet:
Context
CPU scheduling
Dyanmic time quantum
Heuristic algorithms
Operating systems
Operating Systems (OS)
Round robin
Round Robin (RR) algorithm
Scheduling
Sorting
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The efficiency of embedded systems mainly depends on the process scheduling policy of operating systems running on them. Better scheduling algorithms make a system fast using less resources for small time. Out of some important scheduling algorithms, Round Robin algorithm is much efficient. But its efficiency fairly depends on choosen time quantum. In this paper, we have developed an efficient Round Robin algorithm using Dynamic Time Quantum. Some such systems have already been developed but they take advantage of other algorithms and their running time is much higher due to sorting of processes which is practically impossible. So, our goal is to reduce running time of an algorithm along with efficiency constraints such as context switches, average waiting and turnaround times. Lower the context switches, average waiting and turnaround times; higher the efficiency of an operating system and thus better embedded system. In the last section of this paper, we will present a comparison of our system with previously developed algorithms.
AbstractList The efficiency of embedded systems mainly depends on the process scheduling policy of operating systems running on them. Better scheduling algorithms make a system fast using less resources for small time. Out of some important scheduling algorithms, Round Robin algorithm is much efficient. But its efficiency fairly depends on choosen time quantum. In this paper, we have developed an efficient Round Robin algorithm using Dynamic Time Quantum. Some such systems have already been developed but they take advantage of other algorithms and their running time is much higher due to sorting of processes which is practically impossible. So, our goal is to reduce running time of an algorithm along with efficiency constraints such as context switches, average waiting and turnaround times. Lower the context switches, average waiting and turnaround times; higher the efficiency of an operating system and thus better embedded system. In the last section of this paper, we will present a comparison of our system with previously developed algorithms.
Author Farooq, Muhammad Umar
Siddique, Abu Bakar
Shakoor, Aamna
Author_xml – sequence: 1
  givenname: Muhammad Umar
  surname: Farooq
  fullname: Farooq, Muhammad Umar
  email: mufarooq40@gmail.com
  organization: Univ. of Eng. & Technol., Lahore, Pakistan
– sequence: 2
  givenname: Aamna
  surname: Shakoor
  fullname: Shakoor, Aamna
  organization: Univ. of Eng. & Technol., Lahore, Pakistan
– sequence: 3
  givenname: Abu Bakar
  surname: Siddique
  fullname: Siddique, Abu Bakar
  organization: Univ. of Eng. & Technol., Lahore, Pakistan
BookMark eNotj71uwjAURl2pHVrKE7D4BZLasY19hw7IpD8SEhWCGRnnXrCUOFUIA2_fVmX5znCkI31P7D73GRmbSVFKKeDFF369rMtKSFtakA7U_I5NwTppBAittdWP7HWReU2UYsI88uU1hy5FvukvufndQ8o8tMd-SOOp49QP3H_t-DmesLm0KR-f2QOF9ozTGyds-1Zv_UexWr9_-sWqSCDGghzqZq4oWAIpyFhnJJJRBl1V6UgHAAIIGrGBoKiSDqNyfzoaGQ2qCZv9ZxMi7r-H1IXhur99Uj-45kWF
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/C-CODE.2017.7918936
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781509044474
1509044477
9781509044481
1509044485
EndPage 248
ExternalDocumentID 7918936
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-f8e4d63fa7f910f57851ef535e8224cfb99f99a4eed9a3f218ec3835e8c51c5e3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:37:57 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-f8e4d63fa7f910f57851ef535e8224cfb99f99a4eed9a3f218ec3835e8c51c5e3
PageCount 5
ParticipantIDs ieee_primary_7918936
PublicationCentury 2000
PublicationDate 2017-March
PublicationDateYYYYMMDD 2017-03-01
PublicationDate_xml – month: 03
  year: 2017
  text: 2017-March
PublicationDecade 2010
PublicationTitle 2017 International Conference on Communication, Computing and Digital Systems (C-CODE)
PublicationTitleAbbrev C-CODE
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.7754451
Snippet The efficiency of embedded systems mainly depends on the process scheduling policy of operating systems running on them. Better scheduling algorithms make a...
SourceID ieee
SourceType Publisher
StartPage 244
SubjectTerms Context
CPU scheduling
Dyanmic time quantum
Heuristic algorithms
Operating systems
Operating Systems (OS)
Round robin
Round Robin (RR) algorithm
Scheduling
Sorting
Title An Efficient Dynamic Round Robin algorithm for CPU scheduling
URI https://ieeexplore.ieee.org/document/7918936
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0A8eBJDRi_04NHCy3tbrfnZYkHg8Sg4UZ2u1Ml0YUg-PttuxuMiRdvTT_STnt4nXbeG4DbeFiaoTGMKqMYlWgZLcrcHQj36kooBYangZcHNZkk87metuBuz4VBxBB8hn1fDH_55crs_FPZQGnu4DVuQ1upuOZqNUJCnOlBStPHUeajtVS_6fkrZUpAjPHR_-Y6ht4P9Y5M96ByAi2suuCcdJIFrQc3hozqJPLkyWdEIoHARfL315Vz898-iLuEknT6TJzX6lDEk817MBtns_SeNnkP6FKzLbUJyjIWNlfWYbn1ajQcbSQi9BGfxhZaW61z6Raic2EdRqNxfqZrNhE3EYpT6FSrCs-AlEMUqIyWmAgZCZZzaViJ3KBNioLJc-h6yxfrWtli0Rh98Xf1JRz6za0jsK6gs93s8BoOzNd2-bm5CcfxDeFOjeQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmuhJDRi_7cGjhe62S7fnBYIRkRg03Mhud6okyhoEf79td4Mx8eKt6UfaaQ-v0857A3DdCXMdas2o1JJRgYbRLE_tgQROXQkFR_808DyUo1E8napxDW42XBhE9MFn2HJF_5efF3rtnsraUgUWXjtbsB0JEbKSrVVJCQVMtROaPHR7Ll5Ltqq-v5KmeMzo7_9vtgNo_pDvyHgDK4dQw0UDrJtOel7twY4h3TKNPHl0OZGIp3CR9O2lsI7-6zux11CSjJ-I9Vstjji6eRMm_d4kGdAq8wGdK7aiJkaRd7hJpbFobpweTYAm4hG6mE9tMqWMUqmwC1EpNxalUVtP0zbrKNAR8iOoL4oFHgPJQ-QotRIYcxFxlgZCsxwDjSbOMiZOoOEsn32U2hazyujTv6uvYHcwuR_OhrejuzPYcxtdxmOdQ321XOMF7Oiv1fxzeemP5htzh5Er
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%3Abook&rft.genre=proceeding&rft.title=2017+International+Conference+on+Communication%2C+Computing+and+Digital+Systems+%28C-CODE%29&rft.atitle=An+Efficient+Dynamic+Round+Robin+algorithm+for+CPU+scheduling&rft.au=Farooq%2C+Muhammad+Umar&rft.au=Shakoor%2C+Aamna&rft.au=Siddique%2C+Abu+Bakar&rft.date=2017-03-01&rft.pub=IEEE&rft.spage=244&rft.epage=248&rft_id=info:doi/10.1109%2FC-CODE.2017.7918936&rft.externalDocID=7918936