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

DOI10.1007/s11241-018-9303-1zbMath1398.68063OpenAlexW2792504804WikidataQ130143800 ScholiaQ130143800MaRDI QIDQ1616839

Youcheng Sun, Alessandro Biondi

Publication date: 7 November 2018

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

Full work available at URL: https://doi.org/10.1007/s11241-018-9303-1

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• Feasibility analysis of sporadic real-time multiprocessor task systems
• On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling
• Utilization bounds for EDF scheduling on real-time multiprocessor systems
• Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
• A survey of hard real-time scheduling for multiprocessor systems
• Semi-Partitioned Scheduling of Dynamic Real-Time Workload: A Practical Approach Based on Analysis-Driven Load Balancing
• Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling