Real-time scheduling of linear speedup parallel tasks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2080263
- scientific article; zbMATH DE number 2185607
- Scheduling independent multiprocessor tasks
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
Cites work
- scientific article; zbMATH DE number 108110 (Why is no real title available?)
- Application scheduling and processor allocation in multiprogrammed parallel processing systems
- Complexity of Scheduling Parallel Task Systems
- Multiprocessor scheduling with communication delays
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Scheduling with deadlines and loss functions
Cited in
(12)- scientific article; zbMATH DE number 2172786 (Why is no real title available?)
- Scheduling multiple variant programs under hard real-time constraints
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- Scheduling multiprocessor tasks -- An overview
- New applications of the Muntz and Coffman algorithm
- Multi-core real-time scheduling for generalized parallel task models
- Global EDF scheduling for parallel real-time tasks
- On-line scheduling of scalable real-time tasks on multiprocessor systems.
- Integrating job parallelism in real-time scheduling theory
- Malleable scheduling for flows of jobs and applications to MapReduce
- Approximation and Online Algorithms
- Efficient approximation algorithms for scheduling moldable tasks
This page was built for publication: Real-time scheduling of linear speedup parallel tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350756)