Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
From MaRDI portal
Publication:5445754
DOI10.1007/978-3-540-77444-0_20zbMATH Open1131.68350OpenAlexW1575939710MaRDI QIDQ5445754FDOQ5445754
Authors: Sanjoy K. Baruah, Nathan Fisher 
Publication date: 6 March 2008
Published in: Distributed Computing and Networking (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77444-0_20
Recommendations
- Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
- Interference-aware fixed-priority schedulability analysis on multiprocessors
- An analysis of fixed-priority schedulability on a multiprocessor
- Fixed priority scheduling with limited priority levels
- Priority-driven scheduling of periodic task systems on multiprocessors
Cited In (10)
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
- FPSL, FPCL and FPZL schedulability analysis
- Fixed priority scheduling with limited priority levels
- Priority-free conditionally-preemptive scheduling of modular sporadic real-time systems
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
- Fixed-priority scheduling on prioritized SMT processor
- Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
- Improved multiprocessor global schedulability analysis
This page was built for publication: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445754)
