Scheduling MapReduce Jobs on Identical and Unrelated Processors.
Dimitris FotakisIoannis MilisOrestis PapadigenopoulosVasilis VassalosGeorgios ZoisPublished in: Theory Comput. Syst. (2020)
Keyphrases
- parallel machines
- list scheduling
- parallel computing
- scheduling problem
- unrelated parallel machines
- identical parallel machines
- release dates
- processing times
- parallel processing
- minimize total
- identical machines
- precedence constraints
- communication delays
- job scheduling
- scheduling strategy
- single machine
- parallel processors
- scheduling jobs
- precedence relations
- release times
- optimal scheduling
- weighted tardiness
- sequence dependent setup times
- maximum lateness
- setup times
- deteriorating jobs
- computational grids
- multiprocessor systems
- shared memory
- single machine scheduling problem
- data parallelism
- wafer fabrication
- cloud computing
- distributed memory
- fixed number
- batch processing machines
- scheduling algorithm
- batch processing
- flowshop
- completion times
- parallel algorithm
- massively parallel
- scheduling policies
- single server
- processing units
- resource allocation
- parallel computation
- parallel programming
- high performance computing
- data partitioning
- multithreading