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

DOI10.1007/978-3-540-77096-1_5zbMATH Open1291.68062OpenAlexW2112698981MaRDI QIDQ5386255FDOQ5386255

Authors: 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

Recommendations

• Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
• Schedulability analysis of global EDF
• An analysis of fixed-priority schedulability on a multiprocessor
• The non-preemptive scheduling of periodic tasks upon multiprocessors

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

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

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

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