Complexity and approximation results for scheduling multiprocessor tasks on a ring.
Giuseppe ConfessorePaolo Dell'OlmoStefano GiordaniPublished in: Discret. Appl. Math. (2003)
Keyphrases
- scheduling algorithm
- approximation error
- scheduling problem
- multiprocessor systems
- resource allocation
- approximation algorithms
- computational grids
- round robin
- computational cost
- database machines
- highly parallel
- increase in computational complexity
- database
- error tolerance
- resource requirements
- dynamic scheduling
- flexible manufacturing systems
- parallel processors
- relative error
- complexity analysis
- resource constraints
- transfer learning
- worst case
- computational complexity