The feasibility of general task systems with precedence constraints on multiprocessor platforms

DOI10.1007/s11241-008-9054-5zbMath1194.68085OpenAlexW2139342412MaRDI QIDQ842732

Nathan Fisher, Sanjoy K. Baruah

Publication date: 25 September 2009

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-008-9054-5

zbMATH Keywords

schedulability analysisfeasibility analysisearliest-deadline-first schedulingrecurrent task modelsresource-augmentation analysis

Mathematics Subject Classification ID

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

Related Items (max. 100)

Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

Cites Work

• Dynamic- and static-priority scheduling of recurring real-time tasks
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Optimal time-critical scheduling via resource augmentation
• Unnamed Item
• Unnamed Item

This page was built for publication: The feasibility of general task systems with precedence constraints on multiprocessor platforms