Scheduling in the presence of processor networks : complexity and approximation.
Vincent BoudetJohanne CohenRodolphe GiroudeauJean-Claude KönigPublished in: RAIRO Oper. Res. (2012)
Keyphrases
- scheduling problem
- approximation error
- multiprocessor systems
- computational complexity
- high speed
- scheduling algorithm
- network size
- vapnik chervonenkis dimension
- worst case
- parallel processors
- increase in computational complexity
- decision problems
- closed form
- error tolerance
- parallel processing
- real time database systems
- parallel machines
- space complexity
- information systems
- end to end
- resource allocation
- np hard
- bayesian networks