Efficient data centers, cloud computing in the future of distributed computing

ITNG2010 - 7th International Conference on Information Technology: New Generations

Volumn , Issue , 2010, Pages 70-75

  Bein, Doina ^a   Bein, Wolfgang ^b   Phoha, Shashi ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF NEVADA   (United States)

Author keywords

Bin packing; Data center; Online algorithm; Server; Storage request

Indexed keywords

BIN PACKING; CLOUD COMPUTING; DATA CENTERS; DISTRIBUTED COMPUTING; EFFICIENT ALGORITHM; GROWING DEMAND; INTERNET SERVICES; MICROSOFT; ON-LINE ALGORITHMS; ONLINE ALGORITHM; RANDOM VALUES; SOCIAL NETWORKING; TOTAL COSTS; VIDEO SHARING;

ALGORITHMS; BINS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION TECHNOLOGY; SATELLITE COMMUNICATION SYSTEMS; SERVERS;

INTERNET;

EID: 77955299499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2010.31     Document Type: Conference Paper

References (25)

1. N. Carr, "The Big Switch: Our New Digital Destiny", Norton, February 2008
2. R. Avent, "The Geography of Cloud Computing", Seeking Alpha, June 15, 2009; http://seekingalpha.co m/article/143305-thegeography-of-cloud- computing
3. R. Miller, "Facebook Expands Data Center Space", October 18th, 2007; http://www.datacenterknowledge.com/archives/2007/10/18/facebookexpands- data-center-space/
4. P. Ross, "Cloud Computing's Killer App: Gaming", IEEE Spectrum Magazine, March 2009, pp. 14
5. M. Hendrickson, "AMD and OTOY working together on fastest supercomputer ever", TechCrunch, Jan. 8, 2009; http://www.tech crunch.com/2009/01/08/amd-and-otoy-working-together-on-fastestsupercomputer- ever/
6. S. Cherry, "Forecast for cloud computing: up, up and away", IEEE Spectrum, vol. 46, no. 10, pp. 68-68, 2009.
7. C.C. Lee and D.T. Lee, "A simple on-line bin-packing algorithm", Journal of ACM, vol. 32, no. 3, pp. 562-572, 1985.
8. L. Epstein, "Online bin packing with cardinality constraints", SIAM Journal on Discrete Mathematics , vol. 20, no. 4, pp. 1015-1030, 2006.
9. J. D. Ullman, "The performance of a memory allocation algorithm", Technical Report 100, Princeton University, Princeton, NJ, 1971.
10. E. G. Coffman, M. R. Garey, and D. S. Johnson, "Approximation algorithms for bin packing: A survey", In D. Hochbaum (editor), Approximation algorithms, PWS Publishing Company, 1997.
11. E. G. Coffman Jr. and J. Csirik, "Performance guarantees for one-dimensional bin packing", In T. F. Gonzalez (ed.), Handbook of Approximation Algorithms and Metaheuristics, chapter 32, Chapman & Hall/CRC, 2007.
12. J. Csirik and G. J. Woeginger, "On-line packing and covering problems", In A. Fiat and G.J. Woeginger (editors), Online Algorithms: The State of the Art, chapter 7, pp. 147-177, Springer, 1998.
13. D.S. Johnson, "Fast algorithms for bin packing", Journal of Computer Systems and Science, vol. 8, pp. 272-314, 1974.
14. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham, "Worst-case performance bounds for simple one-dimensional packing algorithms", SIAM Journal on Computing, vol. 3, pp. 256-278, 1974.
15. A.C.C. Yao, "New algorithms for bin packing", Journal of ACM vol. 27, pp. 207-227, 1980.
16. S. Seiden, "On the online bin packing problem", Journal of the ACM vol. 49, no. 5, pp. 640-671, 2002.
17. A. Van Vliet,"An improved lower bound for online bin packing algorithms", Information Processing Letters, vol. 43, pp. 277-284, 1992.
18. L. Epstein, "Bin packing with rejection revisited", 4th Workshop on Approximation and Online Algorithms (WAOA), pp. 146-159, 2006.
19. L. Epstein, "Bin packing with rejection revisited", Algorithmica, DOI 10.1007/s00453-008-9188-9.
20. W. Bein, J. Correa, X. Han, "A fast asymptotic approximation scheme for bin packing with rejection", 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 07), Springer Verlag, Lecture Notes in Computer Science LNCS 4614, pp. 209-218, 2007.
21. W. Bein, J. Correa, X. Han, "A fast asymptotic approximation scheme for bin packing with rejection", Theoretical Computer Science, vol. 393, nos. (1-3), pp.14-22, 2008.
22. K.L. Krause, V.Y. Shen, and H.D. Schwetman, "Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems", Journal of ACM, vol. 22, no. 4, pp. 522-550, 1975.
23. K.L. Krause, V.Y. Shen, and H.D. Schwetman, Errata: "Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems", Journal of ACM, vol. 24, no. 3, pp. 527-527, 1977.
24. L. Babel, B. Chen, H. Kellerer, and V. Kotov, "Algorithms for online binpacking problems with cardinality constraints", Discrete Applied Mathematics, vol. 143, nos. 1-3, pp. 238-251, 2004.
25. L. Epstein, A. Levi, "Bin packing with general cost structures";http://adsabs.harvard.edu/abs/2009arXiv0906.5051E