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

Content Provider	Springer Nature Link
Author	Aksu, Mustafa Karcı, Ali
Copyright Year	2016
Abstract	Our 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.
Starting Page	677
Ending Page	689
Page Count	13
File Format	PDF
ISSN	2193567X
Journal	Arabian Journal for Science and Engineering
Volume Number	42
Issue Number	2
e-ISSN	21914281
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2016-09-02
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Data structures Skip ring Design of algorithms Process scheduling Operating systems FPS Engineering Science, Humanities and Social Sciences, multidisciplinary
Content Type	Text
Resource Type	Article
Subject	Multidisciplinary

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Data structures for task-based priority scheduling

Semi-partitioned Fixed-Priority Scheduling on Multiprocessors

Laboratory exercises for practical performance of algorithms and data structures

Fixed priority scheduling with limited priority levels

An Efficient Distributed Algorithm for Big Data Processing

Optimized algorithms for flexible length-based authenticated skip list

Engineering and analysis of fixed priority schedulers

Acceleration of the LBG algorithm

Fair Scheduling in Networks Through Packet Election

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

Similar Documents

Data structures for task-based priority scheduling

Semi-partitioned Fixed-Priority Scheduling on Multiprocessors

Laboratory exercises for practical performance of algorithms and data structures

Fixed priority scheduling with limited priority levels

An Efficient Distributed Algorithm for Big Data Processing

Optimized algorithms for flexible length-based authenticated skip list

Engineering and analysis of fixed priority schedulers

Acceleration of the LBG algorithm

Fair Scheduling in Networks Through Packet Election

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