Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure

DOI10.1007/s13369-016-2288-yzbMath1390.68108OpenAlexW2518235880MaRDI QIDQ1640419

Mustafa Aksu, Ali Karcı

Publication date: 14 June 2018

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-016-2288-y

zbMATH Keywords

data structuresdesign of algorithmsoperating systemsprocess schedulingFPSskip ring

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Theory of operating systems (68N25)

Cites Work

• Corona: a stabilizing deterministic message-passing skip list
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Skip lift: a probabilistic alternative to red-black trees
• The binomial transform and the analysis of skip lists
• Data Structures and Algorithms Using C#
• A Simple Optimistic Skiplist Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure