\begin{thebibliography}{10}

\bibitem{book_raph}
J.~Bahi, S.~Contassot-Vivier, and R.~Couturier.
\newblock {\em Parallel Iterative Algorithms: from Sequential to Grid
  Computing}, volume~1 of {\em Numerical Analysis \& Scientific Computating},
  chapter Asynchronous Iterations, pages 124--131.
\newblock Chapman \& Hall/CRC, 2007.

\bibitem{jaceP2P-v2}
J.-C. Charr, R.~Couturier, and D.~Laiymani.
\newblock Jacep2p-v2: A fully decentralized and fault tolerant environment for
  executing parallel iterative asynchronous applications on volatile
  distributed architectures.
\newblock In {\em GPC}, pages 446--458, 2009.

\bibitem{g5k}
Grid'5000.
\newblock http://www.grid5000.fr.

\bibitem{dag1}
T.~Yang and A.~Gerasoulis.
\newblock Dsc: Scheduling parallel tasks on an unbounded number of processors.
\newblock {\em IEEE Trans. Parallel Distrib. Syst.}, 5(9):951--967, 1994.

\bibitem{dag2}
V.~Sarkar.
\newblock {\em Partitioning and Scheduling Parallel Programs for
  Multiprocessors}.
\newblock MIT Press, Cambridge, MA, USA, 1989.

\bibitem{dag3}
Y.-K. Kwok and I.~Ahmad.
\newblock Dynamic critical-path scheduling: An effective technique for
  allocating task graphs to multiprocessors.
\newblock {\em IEEE Transactions on Parallel and Distributed Systems},
  7(5):506--521, 1996.

\bibitem{dag4}
H.~Topcuouglu, S.~Hariri, and M.~Wu.
\newblock Performance-effective and low-complexity task scheduling for
  heterogeneous computing.
\newblock {\em IEEE Trans. Parallel Distrib. Syst.}, 13(3):260--274, 2002.

\bibitem{tig1}
D.~L. Long and L.~A. Clarke.
\newblock Task interaction graphs for concurrency analysis.
\newblock In {\em ICSE}, pages 44--52, 1989.

\bibitem{tig2}
D.~L. Long~L. A. and Clarke.
\newblock Task interaction graph: An intermediate representation for
  concurrency.
\newblock Technical report, University of Massachusetts, Amherst, MA, USA,
  1988.

\bibitem{npcomp}
M.~Garey and D.~Johnson.
\newblock {\em Computer and Intractability : a guide to the Theory of
  NP-Completness}.
\newblock W.H. Freeman \& Co, 1979.

\bibitem{metis}
G.~Karypis and V.~Kumar.
\newblock A fast and high quality multilevel scheme for partioning irregular
  graphs.
\newblock {\em SIAM Journal on Scientific Computing}, 20(1):359--392, 1998.

\bibitem{chaco}
B.~Hendrickson and R.~W. Leland.
\newblock {\em The Chaco User's Guide}.
\newblock Sandia National Laboratory, Albuquerque, 1995.

\bibitem{pagrid}
S.~Huang, E.~E. Aubanel, and V.~C. Bhavsar.
\newblock Pagrid: A mesh partitioner for computational grids.
\newblock {\em J. Grid Comput.}, 4(1):71--88, 2006.

\bibitem{fastmap}
S.~Sanyal, A.~Jain, S.~K. Das, and Rupak Biswas.
\newblock A hierarchical and distributed approach for mapping large
  applications to heterogeneous grids using genetic algorithms.
\newblock In {\em CLUSTER}, pages 496--499, 2003.

\bibitem{minimax}
S.~Kumar, S.~K. Das, and Rupak Biswas.
\newblock Graph partitioning for parallel applications in heterogeneous grid
  environments.
\newblock In {\em IPDPS}, 2002.

\bibitem{qm_these}
P.~Phinjaroenphan.
\newblock {\em An Efficient, Pratical, Portable Mapping Technique on
  Computational Grids}.
\newblock PhD thesis, School of Computer Science and Information technology
  Science, Engineering and Technology Portfolio, RMIT University, 2006.

\bibitem{scotch}
C.~Chevalier and F.~Pellegrini.
\newblock Pt-scotch: a tool for efficient parallel graph ordering.
\newblock {\em Parallel Computing}, 6-8(34):338--331, 2008.

\bibitem{nas}
The {NAS} {P}arallel {B}enchmarks.
\newblock http://www.nas.nasa.gov/Resources/Software/npb.html.

\bibitem{mtj}
\mbox{Matrix~Toolkit~Java}.
\newblock http://code.google.com/p/matrix-toolkits-java/.

\bibitem{farhat}
C.~Farhat.
\newblock A simple and efficient automatic fem domain decomposer.
\newblock {\em Computers \& Structures}, 28(5):579 -- 602, 1988.

\end{thebibliography}