1 \begin{thebibliography}{10}
4 J.~Bahi, S.~Contassot-Vivier, and R.~Couturier.
5 \newblock {\em Parallel Iterative Algorithms: from Sequential to Grid
6 Computing}, volume~1 of {\em Numerical Analysis \& Scientific Computating},
7 chapter Asynchronous Iterations, pages 124--131.
8 \newblock Chapman \& Hall/CRC, 2007.
11 J.-C. Charr, R.~Couturier, and D.~Laiymani.
12 \newblock Jacep2p-v2: A fully decentralized and fault tolerant environment for
13 executing parallel iterative asynchronous applications on volatile
14 distributed architectures.
15 \newblock In {\em GPC}, pages 446--458, 2009.
19 \newblock http://www.grid5000.fr.
22 T.~Yang and A.~Gerasoulis.
23 \newblock Dsc: Scheduling parallel tasks on an unbounded number of processors.
24 \newblock {\em IEEE Trans. Parallel Distrib. Syst.}, 5(9):951--967, 1994.
28 \newblock {\em Partitioning and Scheduling Parallel Programs for
30 \newblock MIT Press, Cambridge, MA, USA, 1989.
33 Y.-K. Kwok and I.~Ahmad.
34 \newblock Dynamic critical-path scheduling: An effective technique for
35 allocating task graphs to multiprocessors.
36 \newblock {\em IEEE Transactions on Parallel and Distributed Systems},
40 H.~Topcuouglu, S.~Hariri, and M.~Wu.
41 \newblock Performance-effective and low-complexity task scheduling for
42 heterogeneous computing.
43 \newblock {\em IEEE Trans. Parallel Distrib. Syst.}, 13(3):260--274, 2002.
46 D.~L. Long and L.~A. Clarke.
47 \newblock Task interaction graphs for concurrency analysis.
48 \newblock In {\em ICSE}, pages 44--52, 1989.
51 D.~L. Long~L. A. and Clarke.
52 \newblock Task interaction graph: An intermediate representation for
54 \newblock Technical report, University of Massachusetts, Amherst, MA, USA,
58 M.~Garey and D.~Johnson.
59 \newblock {\em Computer and Intractability : a guide to the Theory of
61 \newblock W.H. Freeman \& Co, 1979.
64 G.~Karypis and V.~Kumar.
65 \newblock A fast and high quality multilevel scheme for partioning irregular
67 \newblock {\em SIAM Journal on Scientific Computing}, 20(1):359--392, 1998.
70 B.~Hendrickson and R.~W. Leland.
71 \newblock {\em The Chaco User's Guide}.
72 \newblock Sandia National Laboratory, Albuquerque, 1995.
75 S.~Huang, E.~E. Aubanel, and V.~C. Bhavsar.
76 \newblock Pagrid: A mesh partitioner for computational grids.
77 \newblock {\em J. Grid Comput.}, 4(1):71--88, 2006.
80 S.~Sanyal, A.~Jain, S.~K. Das, and Rupak Biswas.
81 \newblock A hierarchical and distributed approach for mapping large
82 applications to heterogeneous grids using genetic algorithms.
83 \newblock In {\em CLUSTER}, pages 496--499, 2003.
86 S.~Kumar, S.~K. Das, and Rupak Biswas.
87 \newblock Graph partitioning for parallel applications in heterogeneous grid
89 \newblock In {\em IPDPS}, 2002.
93 \newblock {\em An Efficient, Pratical, Portable Mapping Technique on
95 \newblock PhD thesis, School of Computer Science and Information technology
96 Science, Engineering and Technology Portfolio, RMIT University, 2006.
99 C.~Chevalier and F.~Pellegrini.
100 \newblock Pt-scotch: a tool for efficient parallel graph ordering.
101 \newblock {\em Parallel Computing}, 6-8(34):338--331, 2008.
104 The {NAS} {P}arallel {B}enchmarks.
105 \newblock http://www.nas.nasa.gov/Resources/Software/npb.html.
108 \mbox{Matrix~Toolkit~Java}.
109 \newblock http://code.google.com/p/matrix-toolkits-java/.
113 \newblock A simple and efficient automatic fem domain decomposer.
114 \newblock {\em Computers \& Structures}, 28(5):579 -- 602, 1988.
116 \end{thebibliography}