Q. Zhang, L. Cheng, and R. Boutaba, Cloud computing: state-of-the-art and research challenges, Journal of Internet Services and Applications, vol.33, issue.4, pp.7-18, 2010.
DOI : 10.1007/s13174-010-0007-6

M. Armbrust, A. Fox, R. Griffith, A. Joseph, R. Katz et al., Above the clouds: A berkeley view of cloud computing, EECS Department, 2009.

R. Buyya, C. S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility, Future Generation Computer Systems, vol.25, issue.6, pp.599-616, 2009.
DOI : 10.1016/j.future.2008.12.001

A. Greenberg, J. Hamilton, D. A. Maltz, and P. Patel, The cost of a cloud, ACM SIGCOMM Computer Communication Review, vol.39, issue.1, pp.68-73, 2008.
DOI : 10.1145/1496091.1496103

R. Calheiros, R. Buyya, and C. De-rose, A Heuristic for Mapping Virtual Machines and Links in Emulation Testbeds, 2009 International Conference on Parallel Processing, pp.518-525, 2009.
DOI : 10.1109/ICPP.2009.7

O. Beaumont, L. Eyraud-dubois, H. Rejeb, and C. Thraves, Heterogeneous Resource Allocation under Degree Constraints, IEEE Transactions on Parallel and Distributed Systems, vol.24, issue.5, 2012.
DOI : 10.1109/TPDS.2012.175

URL : https://hal.archives-ouvertes.fr/inria-00624640

A. Berl, E. Gelenbe, M. D. Girolamo, G. Giuliani, H. De-meer et al., Energy-Efficient Cloud Computing, The Computer Journal, vol.53, issue.7, p.1045, 2010.
DOI : 10.1093/comjnl/bxp080

A. Beloglazov and R. Buyya, Energy Efficient Allocation of Virtual Machines in Cloud Data Centers, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing, pp.577-578, 2010.
DOI : 10.1109/CCGRID.2010.45

L. Epstein and R. Van-stee, Online bin packing with resource augmentation, Discrete Optimization, vol.4, issue.3-4, pp.322-333, 2007.
DOI : 10.1016/j.disopt.2007.09.004

D. Hochbaum, Approximation Algorithms for NP-hard Problems, 16th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), in conjunction with IPDPS 2012, 1997.

K. Ranganathan, A. Iamnitchi, and I. Foster, Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02), p.376, 2002.
DOI : 10.1109/CCGRID.2002.1017164

D. Da-silva, W. Cirne, and F. Brasileiro, Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids, Euro-Par 2003 Parallel Processing, ser. Lecture Notes in Computer Science, pp.169-180, 2003.
DOI : 10.1007/978-3-540-45209-6_26

M. Lei, S. V. Vrbsky, and X. Hong, An on-line replication strategy to increase availability in Data Grids, Future Generation Computer Systems, vol.24, issue.2, pp.85-98, 2008.
DOI : 10.1016/j.future.2007.04.009

H. Hsiao and D. J. Dewitt, A performance study of three high availability data replication strategies Distributed and Parallel Databases, pp.53-79, 1007.

E. Santos-neto, W. Cirne, F. Brasileiro, and A. Lima, Exploiting Replication and Data Reuse to Efficiently Schedule Data-Intensive Applications on Grids, Job Scheduling Strategies for Parallel Processing, ser. Lecture Notes in Computer Science, pp.54-103, 2005.
DOI : 10.1007/11407522_12

J. Dongarra, P. Beckman, P. Aerts, F. Cappello, T. Lippert et al., The International Exascale Software Project: a Call To Cooperative Action By the Global High-Performance Community, International Journal of High Performance Computing Applications, vol.23, issue.4, pp.309-322, 2009.
DOI : 10.1177/1094342009347714

F. Cappello, Fault Tolerance in Petascale/ Exascale Systems: Current Knowledge, Challenges and Research Opportunities, International Journal of High Performance Computing Applications, vol.23, issue.3, pp.212-226, 2009.
DOI : 10.1177/1094342009106189

K. Ferreira, J. Stearley, J. Laros, I. , R. Oldfield et al., Evaluating the viability of process replication reliability for exascale systems, Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis on, SC '11, p.44, 2011.
DOI : 10.1145/2063384.2063443

M. Bougeret, H. Casanova, M. Rabie, Y. Robert, and F. Vivien, Checkpointing strategies for parallel jobs, Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis on, SC '11, pp.1-11, 2011.
DOI : 10.1145/2063384.2063428

URL : https://hal.archives-ouvertes.fr/hal-00738504

F. Cappello, H. Casanova, and Y. Robert, Checkpointing vs. Migration for Post-Petascale Supercomputers, 2010 39th International Conference on Parallel Processing, 2010.
DOI : 10.1109/ICPP.2010.26

URL : https://hal.archives-ouvertes.fr/inria-00437201

L. Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-2010304397579900446, 1979.
DOI : 10.1016/0304-3975(79)90044-6

H. Bodlaender and T. Wolle, A note on the complexity of network reliability problems UU-CS, no, 2004.

L. Valiant, The Complexity of Enumeration and Reliability Problems, SIAM Journal on Computing, vol.8, issue.3, pp.410-421, 1979.
DOI : 10.1137/0208032

J. Provan, M. Ball29, ]. A. Benoit, L. Canon, E. Jeannot et al., The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected, SIAM Journal on Computing, vol.12, issue.4, p.777, 1983.
DOI : 10.1137/0212053

P. Gopalan, A. Klivans, R. Meka, D. Stefankovic, S. Vempala et al., An FPTAS for #Knapsack and Related Counting Problems, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.817-826, 2011.
DOI : 10.1109/FOCS.2011.32

H. Chernoff, A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations, The Annals of Mathematical Statistics, vol.23, issue.4, pp.493-507, 1952.
DOI : 10.1214/aoms/1177729330