Preemptive scheduling for approximate computing on heterogeneous machines: Tradeoff between weighted accuracy and makespan.
Vaneet AggarwalRuijiu MaoPublished in: Inf. Process. Lett. (2020)
Keyphrases
- preemptive scheduling
- flowshop
- computational complexity
- highly accurate
- scheduling problem
- trade off
- computational cost
- high accuracy
- error rate
- prediction accuracy
- optimal solution
- data sets
- classification accuracy
- processing times
- parallel computing
- parallel machines
- weighting schemes
- open shop
- single machine to minimize