MALLEABLE TASKS: AN EFFICIENT MODEL FOR SOLVING ACTUAL PARALLEL APPLICATIONS
Renaud Lepère, Grégory Mounié, Denis Trystram, Borut Robič · 2000
The purpose of this paper is to promote the model of Malleable Tasks for efficiently solving actual parallel applications. Malleable Tasks are presented and discussed in regard to other classical models. We show how this approach has been applied to implement two actual applications, namely, the simulation of the circulations in the Atlantic ocean, and large sparse Cholesky factorization.