A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling

DOI10.1007/s11241-015-9245-9zbMath1357.68024OpenAlexW2293605332MaRDI QIDQ283177

Youcheng Sun, Giuseppe Lipari

Publication date: 13 May 2016

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

Full work available at URL: https://doi.org/10.1007/s11241-015-9245-9

zbMATH Keywords

multiprocessorsporadic tasksfixed priorityexact schedulablity testlinear hybrid automaton

Mathematics Subject Classification ID

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

Related Items (4)

On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• FORTS
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms
• Feasibility analysis of sporadic real-time multiprocessor task systems
• The octagon abstract domain
• Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
• On Reachability for Hybrid Automata over Bounded Time
• Synthesising Succinct Strategies in Safety and Reachability Games
• Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Lectures on Concurrency and Petri Nets

This page was built for publication: A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling