Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling

IPDPS, pp. 738-747, 2017.

Cited by: 3|Views16
EI

Abstract:

We propose a model for scheduling jobs in a parallel machine setting that takes into account the cost of migrations by assuming that the processing time of a job may depend on the specific set of machines among which the job is migrated. For the makespan minimization objective, the model generalizes classical scheduling problems such as u...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments