Recent Hardness Results for Periodic Uni-processor Scheduling.
Friedrich EisenbrandThomas RothvoßPublished in: Scheduling (2010)
Keyphrases
- multiprocessor systems
- parallel processors
- scheduling algorithm
- recent developments
- round robin
- scheduling problem
- computational complexity
- high speed
- data sets
- parallel processing
- learning theory
- single chip
- response time
- np complete
- resource allocation
- np hard
- phase transition
- parallel machines
- computer architecture
- search algorithm
- genetic algorithm