Scheduling MapReduce Jobs on Unrelated Processors.
Dimitris FotakisIoannis MilisEmmanouil ZampetakisGeorgios ZoisPublished in: CoRR (2013)
Keyphrases
- parallel machines
- list scheduling
- parallel computing
- scheduling problem
- communication delays
- precedence relations
- unrelated parallel machines
- identical parallel machines
- precedence constraints
- parallel processing
- scheduling strategy
- identical machines
- processing times
- parallel processors
- minimize total
- release dates
- job scheduling
- scheduling jobs
- weighted tardiness
- optimal scheduling
- release times
- flowshop
- sequence dependent setup times
- shared memory
- single machine
- computational grids
- multiprocessor systems
- batch processing
- single machine scheduling problem
- wafer fabrication
- scheduling algorithm
- deteriorating jobs
- cloud computing
- parallel algorithm
- massively parallel
- fixed number
- maximum lateness
- batch processing machines
- distributed computing
- parallel programming
- parallel computation
- grid computing
- distributed memory
- scheduling policies
- setup times
- completion times
- high performance data mining
- resource consumption
- data partitioning
- job shop scheduling problem
- data parallelism
- high performance computing
- round robin
- np hard
- scheduling decisions