Parallel processor scheduling with delay constraints
From MaRDI portal
Recommendations
- Scheduling tasks with communication delays on parallel processors
- Scheduling tree dags on parallel architectures
- Scheduling series--parallel orders subject to 0/1-communication delays
- Scheduling series-parallel orders subject to 0/1-communication delays
- Scheduling jobs with communication delays: using infeasible solutions for approximation
Cited in
(15)- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems
- Scheduling tasks with communication delays on parallel processors
- Scheduling parallel processors: Structural properties and optimal policies
- Scheduling Sequential Loops on Parallel Processors
- Scheduling expressions on a pipelined processor with a maximal delay of one cycle
- Scheduling with Concurrency-Based Constraints
- scientific article; zbMATH DE number 2080325 (Why is no real title available?)
- Parallel Algorithms with Processor Failures and Delays
- scientific article; zbMATH DE number 5049925 (Why is no real title available?)
- Some models for scheduling parallel programs with communication delays
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- Extra processors versus future information in optimal deadline scheduling
- Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
This page was built for publication: Parallel processor scheduling with delay constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768351)
