Scheduling independent multiprocessor tasks
From MaRDI portal
Recommendations
Cited in
(58)- Scheduling independent multiprocessor tasks on a uniform k-processor system
- Multi-processor scheduling and expanders
- Multiprocessor scheduling with machine allotment and parallelism constraints
- Real-time scheduling of linear speedup parallel tasks
- On multiprocessor system scheduling
- Complexity and approximation results for scheduling multiprocessor tasks on a ring.
- Scheduling multiple variant programs under hard real-time constraints
- Scheduling multiprocessor tasks on hypercubes
- Scheduling independent tasks with multiple modes
- Scheduling multiprocessor tasks for mean flow time criterion
- Processor bounding for an efficient non-preemptive task scheduling algorithm
- Exact algorithms for scheduling programs with shared tasks
- A polynomial algorithm for some preemptive multiprocessor task scheduling problems
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
- Open block scheduling in optical communication networks
- On minimizing dataset transfer time in an acyclic network with four servers
- scientific article; zbMATH DE number 2185607 (Why is no real title available?)
- A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
- A two-leveled approach for multiprocessor tasks assignment in a distributed computing environment
- Nearly on-line scheduling of multiprocessor systems with memories
- Scheduling on semi-identical processors
- Lower bound algorithms for multiprocessor task scheduling with ready times
- A heuristic algorithm for scheduling multiprocessor tasks in a grid computing environment
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- scientific article; zbMATH DE number 3978800 (Why is no real title available?)
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS
- Algorithms for Scheduling Independent Tasks
- scientific article; zbMATH DE number 1234084 (Why is no real title available?)
- scientific article; zbMATH DE number 1271325 (Why is no real title available?)
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Minimizing total completion time in two-processor task systems with prespecified processor allocations
- scientific article; zbMATH DE number 1979516 (Why is no real title available?)
- scientific article; zbMATH DE number 2080263 (Why is no real title available?)
- scientific article; zbMATH DE number 1529456 (Why is no real title available?)
- scientific article; zbMATH DE number 1929944 (Why is no real title available?)
- Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques
- An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
- Approximation schemes for scheduling jobs with chain precedence constraints
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
- Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks
- scientific article; zbMATH DE number 2247728 (Why is no real title available?)
- Multiprocessor scheduling theory. A short survey
- Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
- New applications of the Muntz and Coffman algorithm
- An improved approximation algorithm for scheduling monotonic moldable tasks
- Improved approximation algorithms for multiprocessor scheduling with testing
- Approximation algorithms for multiprocessor scheduling under uncertainty
- Scheduling independent multiprocessor tasks
- Bounds and algorithms for a practical task allocation model (extended abstract)
- Scheduling independent 2-processor tasks to minimize schedule length
- Rectangle packing with one-dimensional resource augmentation
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors
- On the complexity of adjacent resource scheduling
- Scheduling parallel jobs to minimize the makespan
- Scheduling semi-malleable jobs to minimize mean flow time
- On contiguous and non-contiguous parallel task scheduling
- Grouping techniques for scheduling problems: simpler and faster
This page was built for publication: Scheduling independent multiprocessor tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957575)
