Embarrassingly parallel jobs are not embarrassingly easy to schedule on the grid.
Enis AfganPurushotham V. BangalorePublished in: MTAGS@SC (2008)
Keyphrases
- scheduling problem
- identical machines
- single machine scheduling problem
- computational grids
- processing times
- parallel machines
- open shop
- deteriorating jobs
- single machine
- limited capacity
- job scheduling
- scheduling algorithm
- batch processing machines
- precedence constraints
- distributed memory
- parallel computation
- parallel implementation
- flowshop
- release dates
- grid computing
- special case