Competitiveness of dynamic bin packing for online cloud server allocation

IEEE/ACM Transactions on Networking

Volumn 25, Issue 3, 2017, Pages 1324-1331

  Ren, Runtian ^a   Tang, Xueyan ^a   Li, Yusen ^b   Cai, Wentong ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANKAI UNIVERSITY   (China)

Author keywords

Cloud server allocation; Competitive ratio; Dynamic bin packing; Online algorithm

Indexed keywords

BINS; COMPETITION; ONLINE SYSTEMS;

COMPETITIVE RATIO; CONSTANT VALUES; DYNAMIC BIN PACKING; JOB-DISPATCHING; PACKING ALGORITHMS; RESOURCE CAPACITY; RESOURCE DEMANDS; UPPER AND LOWER BOUNDS;

CLOUD COMPUTING;

EID: 85003696208     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2016.2630052     Document Type: Article

References (25)

1. Amazon EC2 Pricing, accessed on Sep. 1, 2015[Online]. Available: http://aws.amazon.com/ec2/pricing/
2. J. Balogh, J. B?k?si, and G. Galambos, "New lower bounds for certain classes of bin packing algorithms," Approximation and Online Algorithms (Lecture Notes in Computer Science), vol. 6534, pp. 25-36, 2011.
3. L. A. Barroso and U. H?lzle, "The case for energy-proportional computing," Computer, vol. 40, no. 12, pp. 33-37, 2007.
4. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, vol. 53. Cambridge, U.K.: Cambridge Univ. Press, 1998.
5. J. W.-T. Chan, T.-W. Lam, and P. W. Wong, "Dynamic bin packing of unit fractions items," Theor. Comput. Sci., vol. 409, no. 3, pp. 521-529, 2008.
6. J. W.-T. Chan, P. W. H. Wong, and F. C. Yung, "On dynamic bin packing: An improved lower bound and resource augmentation analysis," Computing and Combinatorics (Lecture Notes in Computer Science), vol. 4112. 2006, pp. 309-319.
7. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, "Dynamic bin packing," SIAM J. Comput., vol. 12, no. 2, pp. 227-258, 1983.
8. M. Flammini et al., "Minimizing total busy time in parallel scheduling with application to optical networks," in Proc. 23rd IEEE Int. Parallel Distrib. Process. Symp. (IPDPS), May 2009, pp. 1-12.
9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY, USA: Freeman, 1979.
10. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. San Diego, CA, USA: Academic, 1980.
11. C.-Y. Huang, K.-T. Chen, D.-Y. Chen, H.-J. Hsu, and C.-H. Hsu, "GamingAnywhere: The first open source cloud gaming system," ACM Trans. Multimedia Comput., Commun., Appl., vol. 10, no. 1s, Jan. 2014, Art. no. 10.
12. Z. Ivkovic and E. L. Lloyd, "Fully dynamic algorithms for bin packing: Being (Mostly) myopic helps," SIAM J. Comput., vol. 28, no. 2, pp. 574-611, 1998.
13. S. Kamali and A. L?pez-Ortiz, "Efficient online strategies for renting servers in the cloud," in SOFSEM, Theory and Practice of Computer Science (Lecture Notes in Computer Science), vol. 8939. 2015, pp. 277-288.
14. R. Khandekar, B. Schieber, H. Shachnai, and T. Tamir, "Real-time scheduling to minimize machine busy times," J. Scheduling, vol. 18, no. 6, pp. 561-573, 2015.
15. E. L. Lawler, J. K. Lenstra, A. H. G. R. Kan, and D. B. Shmoys, "Sequencing and scheduling: Algorithms and complexity," Handbooks Oper. Res. Manage. Sci., vol. 4, pp. 445-522, 1993.
16. Y. Li, Y. Deng, R. Seet, X. Tang, and W. Cai, "MASTER: Multi-platform application streaming toolkits for elastic resources," in Proc. 23rd ACM Int. Conf. Multimedia (MM), 2015, pp. 805-806.
17. Y. Li, X. Tang, and W. Cai, "On dynamic bin packing for resource allocation in the cloud," in Proc. 26th ACM Symp. Parallelism Algorithms Archit. (SPAA), 2014, pp. 2-11.
18. Y. Li, X. Tang, and W. Cai, "Dynamic bin packing for on-demand cloud resource allocation," IEEE Trans. Parallel Distrib. Syst., vol. 27, no. 1, pp. 157-170, Jan. 2016.
19. S. T. Maguluri and R. Srikant, "Scheduling jobs with unknown duration in clouds," IEEE/ACM Trans. Netw., vol. 22, no. 6, pp. 1938-1951, Dec. 2014.
20. G. B. Mertzios, M. Shalom, A. Voloshin, P. W. Wong, and S. Zaks, "Optimizing busy time on parallel machines," in Proc. 26th IEEE Int. Parallel Distrib. Process. Symp. (IPDPS), May 2012, pp. 238-248.
21. R. Ren and X. Tang, "Clairvoyant dynamic bin packing for job scheduling with minimum server usage time," in Proc. 28th ACM Symp. Parallelism Algorithms Archit. (SPAA), 2016, pp. 227-237.
22. S. S. Seiden, "On the online bin packing problem," J. ACM, vol. 49, no. 5, pp. 640-671, 2002.
23. R. Shea, J. Liu, E. C.-H. Ngai, and Y. Cui, "Cloud gaming: Architecture and performance," IEEE Netw., vol. 27, no. 4, pp. 16-21, Jul./Aug. 2013.
24. F. C. R. Spieksma, "On the approximability of an interval scheduling problem," J. Scheduling, vol. 2, pp. 215-227, 1999.
25. X. Tang, Y. Li, R. Ren, and W. Cai, "On first fit bin packing for online cloud server allocation," in Proc. 30th IEEE Int. Parallel Distrib. Process. Symp. (IPDPS), May 2016, pp. 323-332.