Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks

DOI10.1007/978-3-540-77096-1_5zbMath1291.68062OpenAlexW2112698981MaRDI QIDQ5386255

Michele Cirinei, Theodore P. Baker

Publication date: 22 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77096-1_5

Mathematics Subject Classification ID

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

Related Items (13)

On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling ⋮ A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling ⋮ EDZL scheduling analysis ⋮ Synthesising succinct strategies in safety games with an application to real-time scheduling ⋮ Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms ⋮ Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm ⋮ Feasibility analysis of sporadic real-time multiprocessor task systems ⋮ Unnamed Item ⋮ Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible ⋮ Improved multiprocessor global schedulability analysis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm

Cites Work

• EDZL scheduling analysis
• Priority-driven scheduling of periodic task systems on multiprocessors
• Deadline-based scheduling of periodic task systems on multiprocessors.

This page was built for publication: Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks