On the complexity of multiprocessor task scheduling
From MaRDI portal
Recommendations
- Computational complexity of some scheduling problems with multiprocessor tasks
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- Complexity results for scheduling tasks with discrete starting times
Cited in
(30)- Computational complexity of some scheduling problems with multiprocessor tasks
- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Analysis of scheduling problems with typed task systems
- Complexity of scheduling problems with multi-purpose machines
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- On maximizing the throughput of multiprocessor tasks.
- Complexity and approximation results for scheduling multiprocessor tasks on a ring.
- Complexity analysis of new task allocation problem using network flow method on multicore clusters
- Scheduling multiprocessor tasks on hypercubes
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- A comparison of multiprocessor task scheduling algorithms with communication costs
- Scheduling in the presence of processor networks : complexity and approximation
- An online scheduling of two type parallel jobs on identical machines
- Complexity results for scheduling tasks with discrete starting times
- The Research of Method Based on Complex Multi-task Parallel Scheduling Problem
- Lower bound algorithms for multiprocessor task scheduling with ready times
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Rescheduling to minimize makespan on a changing number of identical processors
- scientific article; zbMATH DE number 4072695 (Why is no real title available?)
- Complexity of Scheduling Parallel Task Systems
- scientific article; zbMATH DE number 67289 (Why is no real title available?)
- scientific article; zbMATH DE number 1756650 (Why is no real title available?)
- A composite algorithm for multiprocessor scheduling
- Bounding the running time of algorithms for scheduling and packing problems
- On multiprocessor task scheduling using efficient state space search approaches
- Multiprocessor scheduling with communication delays
This page was built for publication: On the complexity of multiprocessor task scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910619)
