Recherche
-
Scheduling divisible loads on star and tree networks: results and open problems
(IEEE Transactions on Parallel and Distributed Systems, 2005)Article de revue -
RedGRID: un environnement pour la redistribution d'objets complexes
(Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques. vol. 27, n° 3-4, pp. 427--455, 2008)Article de revue -
Label-Guided Graph Exploration by a Finite Automaton
(ACM Transactions on Algorithms. vol. 4, n° 4, pp. Article 42, 2008-08)Article de revue -
Tree exploration with advice
(Information and Computation. vol. 206, n° 11, pp. 1276-1287, 2008-11)Article de revue -
Setting port numbers for fast graph exploration
(Theoretical Computer Science. vol. 401, n° 1-3, pp. 236-242, 2008-07)Article de revue -
Impact of memory size on graph exploration capability
(Discrete Applied Mathematics. vol. 156, n° 12, pp. 2310-2319, 2008-06)Article de revue -
SPORT: An Algorithm for Divisible Load Scheduling with Result Collection on Heterogeneous Systems
(IEICE Transactions on Communications, 2008)Article de revue -
PARCOACH: Combining static and dynamic validation of MPI collective communications
(International Journal of High Performance Computing Applications. pp. 10.1177/1094342014552204, 2014)Article de revue -
How to meet when you forget: log-space rendezvous in arbitrary graphs
(Distributed Computing. vol. 25, n° 2, pp. 165-178, 2012)Article de revue -
Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms
(Journal of Scheduling. vol. 15, n° 5, pp. 615-627, 2012-10-01)Article de revue