Reliable service allocation in clouds

Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium, IPDPS 2013

Volumn , Issue , 2013, Pages 55-66

  Beaumont, Olivier ^a   Eyraud Dubois, Lionel ^a   Larchevêque, Hubert ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Cloud Computing; Complexity analysis; Reliability; Resource Allocation

Indexed keywords

CAPACITY CONSTRAINTS; CLOUD COMPUTING PLATFORMS; COMPLEXITY ANALYSIS; PROBABILITY OF FAILURE; PROCESSING RESOURCES; RELIABILITY CONSTRAINTS; RESOURCE ALLOCATION PROBLEM; SERVICE LEVEL AGREEMENTS;

APPROXIMATION ALGORITHMS; CLOUD COMPUTING; DISTRIBUTED PARAMETER NETWORKS; OPTIMIZATION; PROBABILITY; RELIABILITY; RESOURCE ALLOCATION;

RELIABILITY ANALYSIS;

EID: 84884826958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2013.64     Document Type: Conference Paper

References (31)

1. Q. Zhang, L. Cheng, and R. Boutaba, "Cloud computing: state-of-the-art and research challenges," Journal of Internet Services and Applications, vol. 1, no. 1, pp. 7-18, 2010.
2. M. Armbrust, A. Fox, R. Griffith, A. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica et al., "Above the clouds: A berkeley view of cloud computing," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2009-28, 2009.
3. 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, no. 6, pp. 599-616, 2009. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0167739X08001957
4. A. Greenberg, J. Hamilton, D. A. Maltz, and P. Patel, "The cost of a cloud: research problems in data center networks," SIGCOMM Comput. Commun. Rev., vol. 39, no. 1, pp. 68-73, Dec. 2008. [Online]. Available: http://doi.acm.org/10.1145/1496091.1496103
5. H. Van, F. Tran, and J. Menaud, "SLA-aware virtual resource management for cloud infrastructures," in IEEE Ninth International Conference on Computer and Information Technology. IEEE, 2009, pp. 357-362.
6. R. Calheiros, R. Buyya, and C. De Rose, "A heuristic for mapping virtual machines and links in emulation testbeds," in 2009 International Conference on Parallel Processing. IEEE, 2009, pp. 518-525.
7. O. Beaumont, L. Eyraud-Dubois, H. Rejeb, and C. Thraves, "Heterogeneous Resource Allocation under Degree Constraints," IEEE Transactions on Parallel and Distributed Systems, 2012.
8. A. Berl, E. Gelenbe, M. Di Girolamo, G. Giuliani, H. De Meer, M. Dang, and K. Pentikousis, "Energy-efficient cloud computing," The Computer Journal, vol. 53, no. 7, p. 1045, 2010.
9. A. Beloglazov and R. Buyya, "Energy efficient allocation of virtual machines in cloud data centers," in 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing. IEEE, 2010, pp. 577-578.
10. M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
11. L. Epstein and R. van Stee, "Online bin packing with resource augmentation." Discrete Optimization, vol. 4, no. 3-4, pp. 322-333, 2007. (Pubitemid 350167031)
12. D. Hochbaum, Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1997.
13. W. Cirne, "Scheduling at google," in 16th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), in conjunction with IPDPS 2012, 2011.
14. K. Ranganathan, A. Iamnitchi, and I. Foster, "Improving data availability through dynamic model-driven replication in large peer-to-peer communities," in Cluster Computing and the Grid, 2002. 2nd IEEE/ACM International Symposium on, may 2002, p. 376.
15. D. da Silva, W. Cirne, and F. Brasileiro, "Trading cycles for information: Using replication to schedule bag-of-tasks applications on computational grids," in Euro-Par 2003 Parallel Processing, ser. Lecture Notes in Computer Science, H. Kosch, L. Böszörményi, and H. Hellwagner, Eds. Springer Berlin / Heidelberg, 2003, vol. 2790, pp. 169-180.
16. 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, no. 2, pp. 85-98, 2008. [Online]. Available: http://www. sciencedirect.com/science/article/pii/S0167739X07000830
17. H.-I. Hsiao and D. J. Dewitt, "A performance study of three high availability data replication strategies," Distributed and Parallel Databases, vol. 1, pp. 53-79, 1993, 10.1007/BF01277520. [Online]. Available: http://dx.doi.org/10.1007/BF01277520
18. E. Santos-Neto, W. Cirne, F. Brasileiro, and A. Lima, "Exploiting replication and data reuse to efficiently schedule data-intensive applications on grids," in Job Scheduling Strategies for Parallel Processing, ser. Lecture Notes in Computer Science, D. Feitelson, L. Rudolph, and U. Schwiegelshohn, Eds. Springer Berlin / Heidelberg, 2005, vol. 3277, pp. 54-103.
19. J. Dongarra, P. Beckman, P. Aerts, F. Cappello, T. Lippert, S. Matsuoka, P. Messina, T. Moore, R. Stevens, A. Trefethen 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, no. 4, pp. 309-322, 2009.
20. "Eesi, "the european exascale software initiative", 2011," http://www.eesi-project.eu/pages/menu/homepage.php.
21. F. Cappello, "Fault tolerance in petascale/exascale systems: Current knowledge, challenges and research opportunities," International Journal of High Performance Computing Applications, vol. 23, no. 3, pp. 212-226, 2009.
22. K. Ferreira, J. Stearley, J. Laros III, R. Oldfield, K. Pedretti, R. Brightwell, R. Riesen, P. Bridges, and D. Arnold, "Evaluating the viability of process replication reliability for exascale systems," in Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis. ACM, 2011, p. 44.
23. M. Bougeret, H. Casanova, M. Rabie, Y. Robert, and F. Vivien, "Checkpointing strategies for parallel jobs," in High Performance Computing, Networking, Storage and Analysis (SC), 2011 International Conference for. IEEE, 2011, pp. 1-11.
24. F. Cappello, H. Casanova, and Y. Robert, "Checkpointing vs. migration for post-petascale supercomputers," ICPP'2010, 2010.
25. L. Valiant, "The complexity of computing the permanent," Theoretical Computer Science, vol. 8, no. 2, pp. 189-201, 1979. [Online]. Available: http://www.sciencedirect.com/science/article/pii/0304397579900446
26. H. Bodlaender and T. Wolle, "A note on the complexity of network reliability problems," UU-CS, no. 2004-001, 2004.
27. L. Valiant, "The complexity of enumeration and reliability problems," SIAM J. Comput., vol. 8, no. 3, pp. 410-421, 1979.
28. J. Provan and M. Ball, "The complexity of counting cuts and of computing the probability that a graph is connected," SIAM Journal on Computing, vol. 12, p. 777, 1983.
29. A. Benoit, L.-C. Canon, E. Jeannot, and Y. Robert, "Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms," Journal of Scheduling, pp. 1-13, 10.1007/s10951-011-0236-y. [Online]. Available: http://dx.doi.org/10.1007/s10951-011-0236-y
30. P. Gopalan, A. Klivans, R. Meka, D. Stefankovic, S. Vempala, and E. Vigoda, "An fptas for #knapsack and related counting problems," in Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, oct. 2011, pp. 817-826.
31. 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, no. 4, pp. 493-507, 1952.