On maximizing the throughput of multiprocessor tasks.
From MaRDI portal
Publication:1401335
DOI10.1016/S0304-3975(02)00850-2zbMath1044.68009MaRDI QIDQ1401335
Aleksei V. Fishkin, Guo-Chuan Zhang
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (3)
Maximizing the throughput of parallel jobs on hypercubes ⋮ A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES ⋮ Scheduling multiprocessor UET tasks of two sizes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing: Maximizing the number of pieces packed
- Scheduling multiprocessor tasks -- An overview
- Dynamic scheduling on parallel machines
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Concurrent Task Systems
- Linear-Time Algorithms for Scheduling on Parallel Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing total completion time in two-processor task systems with prespecified processor allocations
- On-line scheduling on a single machine: Maximizing the number of early jobs
This page was built for publication: On maximizing the throughput of multiprocessor tasks.
