Login / Signup
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
Klaus Jansen
Lorant Porkolab
Published in:
SODA (1999)
Keyphrases
</>
approximation schemes
scheduling problem
approximation algorithms
parallel machines
worst case
parallel processors
computational grids
identical machines
multiprocessor systems
search space
input image
scheduling algorithm
shared memory
round robin