Renaud Lepère

According to our database, Renaud Lepère authored at least 6 papers between 1999 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints.

Renaud Lepère, Denis Trystram, Gerhard J. Woeginger

Int. J. Found. Comput. Sci., 2002

An approximation algorithm for scheduling trees of malleable tasks.

Renaud Lepère, Grégory Mounié, Denis Trystram

Eur. J. Oper. Res., 2002

An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs.

Renaud Lepère, Christophe Rapine

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

A New Clustering Algorithm for Large Communication Delays.

Renaud Lepère, Denis Trystram

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001

Approches algorithmiques pour l'ordonnancement d'applications parallèles avec communications. (Parallel application scheduling with communications).

Renaud Lepère

PhD thesis, 2001

1999

Malleable tasks: An efficient model for solving actual parallel applications.

Renaud Lepère, G. Maunie, Denis Trystram, Borut Robic

Proceedings of the Parallel Computing: Fundamentals & Applications, 1999