Maximizing the throughput of parallel jobs on hypercubes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1929944
- Scheduling multiprocessor tasks on hypercubes
- A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES
- Optimal task allocation in hyercube multiprocessor ensembles
- On maximizing the throughput of multiprocessor tasks.
- Hierarchical scheduling of dynamical parallel computations on hypercube multicomputers
- Processor allocation for hypercubes
Cites work
- Algorithm Theory - SWAT 2004
- Algorithms and Computation
- Complexity of Scheduling Parallel Task Systems
- Dynamic scheduling on parallel machines
- scientific article; zbMATH DE number 3521521 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- scientific article; zbMATH DE number 1167865 (Why is no real title available?)
- Multiprocessor scheduling with communication delays
- On maximizing the throughput of multiprocessor tasks.
- On rectangle packing, maximizing benefits
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling independent jobs on partitionable hypercubes
- Scheduling multiprocessor tasks -- An overview
Cited in
(2)
This page was built for publication: Maximizing the throughput of parallel jobs on hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846023)