Efficient lower bounding procedures with application in the allocation of virtual machines to data centers

WSEAS Transactions on Information Science and Applications

Volumn 8, Issue 4, 2011, Pages 157-170

  Rietz, Jürgen ^a   Macedo, Rita ^a   Alves, Cláudio ^a   De Carvalho, José Valério ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Cloud computing; Combinatorial optimization; Lower bounds; Maximal dual feasible functions; Polynomial complexity; Virtual machine allocation problem

Indexed keywords

BIN PACKING PROBLEM; BOUNDING PROCEDURES; CLOUD PROVIDERS; COMPUTATIONAL EXPERIMENT; COMPUTING RESOURCE; DATA CENTERS; DUAL-FEASIBLE FUNCTIONS; END-USERS; LOWER BOUNDS; MAXIMAL DUAL-FEASIBLE FUNCTIONS; POLYNOMIAL COMPLEXITY; POLYNOMIAL-TIME ALGORITHMS; VIRTUAL MACHINES;

CLOUDS; COMBINATORIAL OPTIMIZATION; COMPUTER SIMULATION; EXPERIMENTS;

CLOUD COMPUTING;

EID: 84055178065     PISSN: 17900832     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. D. Bein, W. Bein, S. Phoha, Efficient Data Centers, Cloud Computing in the Future of Distributed Computing, Seventh International Conference on Information Technology, 2010, pp. 70-75.
2. J. Blanchette, A Material History of Bits, Journal of the American Society for Information Science and Technology, Vol. 62, 2011, pp. 1042-1057.
3. C. Burdett, E. Johnson, A Subadditive Approach to Solve Linear Integer Programs, Annals of Discrete Mathematics, Vol. 1, 1977, pp. 117-144.
4. J. Carlier, E. Néron, Computing redundant resources for the resource constrained project scheduling problem, European Journal of Operational Research, Vol. 176, No. 3, 2007, pp. 1452-1463. (Pubitemid 44573661)
5. F. Clautiaux, C. Alves, J. V. de Carvalho, A survey of dual-feasible functions for bin packing problems, Annals of Operations Research, Vol. 179, 2010, pp. 317-342.
6. S. Dash, O. Gunluk, Valid Inequalities Based on Simple Mixed-Integer Sets, Mathematical Programming, Vol. 105, 2006, pp. 29-53. (Pubitemid 41705517)
7. S. Fekete, J. Schepers, New Classes of Fast Lower Bounds for Bin Packing Problems, Mathematical Programming, Vol. 91, 2001, pp. 11-31. (Pubitemid 33758904)
8. E. Feller, L. Rilling, C. Morin, Energy-Aware Ant Colony Based Workload Placement in Clouds, Technical Report, INRIA, 2011.
9. D. Johnson, Near Optimal Bin Packing Algorithms, Ph. D. Dissertation, Massachusetts Institute of Technology, Cambridge, 1973.
10. J. Kaplan, W. Forrest, N. Kindler, Revolutionizing data center energy efficiency, Technical Report, McKinsey and Company, 2008.
11. X. Kong, C. Lin, Y. Jiang, W. Yan, X. Chu. Efficient dynamic task scheduling in virtualized data centers with fuzzy prediction, Journal of Network and Computer Applications, Vol. 34, 2011, pp. 1068-1077.
12. B. Li, J. Li, J. Huai, T. Wo, Q. Li, L. Zhong, EnaCloud: An Energy Saving Application Live Placement Approach for Cloud Computing Environments, IEEE International Conference on Cloud Computing, 2009, pp. 17-24.
13. A. Lodi, S. Martello, M. Monaci, Two-Dimensional Packing Problems: A Survey, European Journal of Operational Research, Vol. 141, No. 2, 2022, pp. 241-252.
14. S. Martello, P. Toth, Knapsack problems - Algorithms and Computer Implementation, Wiley, Chichester, 1990.
15. S. Martello, D. Vigo, Exact Solution of the Two-Dimensional Finite Bin Packing Problem, Management Science, Vol. 44, No. 3, 1998, pp. 388-399. (Pubitemid 128568186)
16. C. Mastroianni, M. Meo, G. Papuzzo, Self Economy in Cloud Data Centers: Satistical Assignmet and Migration of Virtual Machines, Lecture Notes in Computer Science, Vol. 6852, 2011, pp. 405-416.
17. th International Conference on Cloud Computing (CLOUD 2011), 2011.
18. J. Tordsson, R. Montero, R. Moreno-Vozmediano, I. Llorente, Cloud Brokering Mechanisms for Optimized Placement of Virtual Machines across Multiple Providers, Future Generation of Computer Systems, Vol. 28, 2012, pp. 358-367.
19. W. Vogels, Beyond server consolidation, Queue, Vol. 6, 2008, pp. 20-26.
20. Q. Zhang, L. Cheng, R. Boutaba, Cloud computing: state-of-the-art and research challenges, Journal of Internet Services and Applications, Vol. 1, 2010, pp. 7-18.