Bounding the Power of Preemption in Randomized Scheduling.
Ran CanettiSandy IraniPublished in: SIAM J. Comput. (1998)
Keyphrases
- parallel machines
- batch processing
- scheduling problem
- power consumption
- scheduling algorithm
- round robin
- upper bound
- real time database systems
- resource constraints
- resource utilization
- decision forest
- special case
- minimize total
- response time
- artificial intelligence
- decision trees
- search engine
- single machine
- real time
- resource allocation
- web services
- search algorithm