A non-preemptive scheduling algorithm for soft real-time systems

DOI10.1016/J.COMPELECENG.2006.04.002zbMATH Open1109.68128OpenAlexW2154684758MaRDI QIDQ865712FDOQ865712

Authors: Wenming Li, Robert Akl, Krishna M. Kavi 

Publication date: 20 February 2007

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc30824/

Recommendations

• Processor bounding for an efficient non-preemptive task scheduling algorithm
• A dynamic fault-tolerant scheduling algorithm based on EDF in real-time database systems
• The study of design optimization about single-processor scheduling algorithms in real-time system
• New strategies for assigning real-time tasks to multiprocessor systems
• An optimal scheduling algorithm for preemptable real-time tasks

zbMATH Keywords

soft real-time systemsbest-effort schedulingearliest deadline first (edf)group-edfnon-preemptive real-time schedulingshortest job first (sjf)

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Cited In (3)

• A group priority earliest deadline first scheduling algorithm
• Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks
• On controlling prioritized discrete event systems with real-time constraints

This page was built for publication: A non-preemptive scheduling algorithm for soft real-time systems

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