Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling

@article{Beaumont2012MinimizingWM,
  title={Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling},
  author={Olivier Beaumont and Nicolas Bonichon and Lionel Eyraud-Dubois and Loris Marchal},
  journal={2012 IEEE 26th International Parallel and Distributed Processing Symposium},
  year={2012},
  pages={273-284}
}
Malleable tasks are jobs that can be scheduled with preemptions on a varying number of resources. We focus on the special case of work-preserving malleable tasks, for which the area of the allocated resources does not depend on the allocation and is equal to the sequential processing time. Moreover, we assume that the number of resources allocated to each task at each time instant is limited. We consider both the clairvoyant and non-clairvoyant cases, and we focus on minimizing the weighted sum… CONTINUE READING