An optimal multiprocessor real-time scheduling algorithm
From MaRDI portal
Recommendations
Cited in
(15)- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Optimal Scheduling of Digital Signal Processing Data-flow Graphs using Shortest-path Algorithms
- Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks
- {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
- A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
- Energy-optimal batching periods for asynchronous multistage data processing on sensor nodes: foundations and an mPlatform case study
- A composite algorithm for multiprocessor scheduling
- A survey of real-time scheduling on multiprocessor systems
- Real-time uniprocessor scheduling with fewer preemptions
- Performance bounds on multiprocessor scheduling strategies for statically allocated programs
- An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
- The study of design optimization about single-processor scheduling algorithms in real-time system
- New strategies for assigning real-time tasks to multiprocessor systems
- Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
This page was built for publication: An optimal multiprocessor real-time scheduling algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369218)