ch2_Algorithmes_para..

Références
1. E. Garcia, Polycopié, LIFC Université de Franche Comté.
2. N. Hameurlain, Polycopié, Université de Pau.
3. H. El-Rewini (Auteur), Ted G. Lewis “Distributed and Parallel Computing”
ed. Manning, 1998.
4. M. Pérotin Synthèse des outils de parallélisation,, Polycopié, LI Tours
5. A. Legrand - Y. Robert Algorithmique Parallèle, ed. Dunod, 2003.
6. J.-Y. Colin, M. Nakechbandi., P. Colin, and F. Guinand "Scheduling Tasks with
Communication Delays on Multi-Levels Clusters" , M., PDPTA'99 : Parallel and Distributed
Techniques and Application, June 1999, Las Vegas, U.S.A.
7. M. Nakechbandi, J.-Y. Colin , C. Delaruelle, "Bounding the makespan of best preschedulings
of task graphs with fixed communication delays and random execution times on
a virtual distributed system", OPODIS02, Reims, pp 225-233 (2002).
8. M. Nakechbandi, J.-Y. Colin, P. Colin "A multi-valued DAG model and an optimal PERT-like
Algorithm for the Distribution of Applications on Heterogeneous Computing Systems",.
PDPTA'05, Las Vegas, Nevada, USA, pp 876-882 (2005).
9. M. Nakechbandi, J.-Y. Colin, “An Algorithm and Some Numerical Experiments for the
Scheduling of Tasks with Fault-Tolerancy Constraints on Heterogeneous Systems”,
HPCS’08 Nicosia, June 2008, Cyprus.