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

DOI10.1007/S13369-016-2288-YMaRDI QIDQ1640419zbMATH OpenOpenAlexFDO

Authors 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 algorithmsFPSoperating systemsprocess schedulingskip ring

Mathematics Subject Classification ID

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

Cites work

• A Simple Optimistic Skiplist Algorithm
• Corona: a stabilizing deterministic message-passing skip list
• Data Structures and Algorithms Using C#
• scientific article; zbMATH DE number 571325 (Why is no real title available?)
• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• scientific article; zbMATH DE number 742983 (Why is no real title available?)
• Introduction to algorithms.
• Skip lift: a probabilistic alternative to red-black trees
• The binomial transform and the analysis of skip lists
• Tiara: a self-stabilizing deterministic skip list and skip graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640419)