Scheduling on hierarchical clusters using malleable tasks
Pierre-François Dutot, Denis Trystram · 2001
The model of malleable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level of granularity than in other models (corresponding typically to numerical routines) where the tasks can themselves be executed in parallel.