Fair Priority Scheduling (FPS): A Process Scheduling Algorithm Based on Skip Ring Data Structure

Basit Öğe Kaydı
dc.authoridKarci, Ali/0000-0002-8489-8617
dc.authoridAKSU, Mustafa/0000-0001-8077-6383
dc.authorwosidKarci, Ali/AAG-5337-2019
dc.authorwosidKARCI, Ali/A-9604-2019
dc.authorwosidAKSU, Mustafa/KIE-9759-2024
dc.contributor.authorAksu, Mustafa
dc.contributor.authorKarci, Ali
dc.date.accessioned2024-08-04T20:42:57Z
dc.date.available2024-08-04T20:42:57Z
dc.date.issued2017
dc.departmentİnönü Üniversitesien_US
dc.description.abstractOur process scheduling algorithm was created with the help of circular linked list and skip ring data structures and algorithms. Skip ring data structure consists of circular link lists formed in layers which are linked in a canonical way. Time complexity of search, insertion and deletion equals to O (lgN) in an N-element skip ring data structure. Therefore, skip ring data structure is employed more effectively (O(lgN)) in circumstances where circular linked lists (O(N)) are used. In this paper, the applications of data structures such as red-black tree, binary search tree and skip ring were performed and the obtained results were compared. The obtained results demonstrated that skip ring data structure is superior to red-black tree and binary search tree. Process scheduling is the most important part of operating systems. Linux operating system (version 6.23) uses Completely Fair Scheduler for process scheduling by using red-black tree data structures, Whereas skip ring data structure can be used effectively instead of red-black tree data structure. A new algorithm for process scheduling which was called as Fair Priority Scheduling was proposed in this paper.en_US
dc.identifier.doi10.1007/s13369-016-2288-y
dc.identifier.endpage689en_US
dc.identifier.issn2193-567X
dc.identifier.issn2191-4281
dc.identifier.issue2en_US
dc.identifier.scopus2-s2.0-85012141274en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage677en_US
dc.identifier.urihttps://doi.org/10.1007/s13369-016-2288-y
dc.identifier.urihttps://hdl.handle.net/11616/97692
dc.identifier.volume42en_US
dc.identifier.wosWOS:000394287600018en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringer Heidelbergen_US
dc.relation.ispartofArabian Journal For Science and Engineeringen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectData structuresen_US
dc.subjectSkip ringen_US
dc.subjectDesign of algorithmsen_US
dc.subjectProcess schedulingen_US
dc.subjectOperating systemsen_US
dc.subjectFPSen_US
dc.titleFair Priority Scheduling (FPS): A Process Scheduling Algorithm Based on Skip Ring Data Structureen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu