Fixed priority scheduling with limited priority levels

DOI10.1109/12.464392zbMATH Open1057.68549OpenAlexW2009604291MaRDI QIDQ4421189FDOQ4421189

Authors: Daniel I. Katcher, Shirish S. Sathaye, Jay K. Strosnider 

Publication date: 10 November 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.464392

Recommendations

• scientific article; zbMATH DE number 2112451
• An analysis of fixed-priority schedulability on a multiprocessor
• Uniprocessor static priority scheduling with limited priority levels
• A dynamic scheduling algorithm based on limited number of priority
• Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems

zbMATH Keywords

real-time systemsdegree of schedulable saturation

Mathematics Subject Classification ID

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

Cited In (13)

• Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
• On-line schedulability tests for adaptive reservations in fixed priority scheduling
• On priority assignment in fixed priority scheduling
• A dynamic scheduling algorithm based on limited number of priority
• A dynamic scheduling grouping algorithm based on limited priority levels
• A group priority earliest deadline first scheduling algorithm
• Uniprocessor static priority scheduling with limited priority levels
• Title not available (Why is that?)
• Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
• Performance Analysis of Dynamic Priority Shifting
• Conventional and early token release scheduling models for the IEEE 802.5 token ring
• Fixed-priority scheduling on prioritized SMT processor
• Title not available (Why is that?)

This page was built for publication: Fixed priority scheduling with limited priority levels

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