An approximation scheme for scheduling of malleable parallel tasks.
Klaus JansenPublished in: Randomization Methods in Algorithm Design (1997)
Keyphrases
- polynomial time approximation
- identical machines
- scheduling problem
- approximation schemes
- np hard
- approximation algorithms
- parallel machines
- error bounds
- multiprocessor systems
- parallel implementation
- randomized approximation
- data sets
- numerical scheme
- mobile robot
- special case
- classification scheme
- parallel computing
- multi task
- queueing networks
- detection scheme
- round robin
- parallel architecture
- parallel processing
- closed form
- transfer learning
- motion estimation