A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

DOI10.1007/978-3-540-87744-8_18zbMath1158.68339OpenAlexW1499133116MaRDI QIDQ3541088

Vincenzo Bonifaci, Sebastian Stiller, Alberto Marchetti-Spaccamela

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15643

Mathematics Subject Classification ID

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

Related Items (5)

Open problems in real-time scheduling ⋮ Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks ⋮ Feasibility analysis of sporadic real-time multiprocessor task systems ⋮ Improved multiprocessor global schedulability analysis ⋮ Online dynamic power management with hard real-time guarantees

Cites Work

• Unnamed Item
• Feasibility problems for recurring tasks on one processor
• A note on preemptive scheduling of periodic, real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling