Application placement on a cluster of servers

International Journal of Foundations of Computer Science

Volumn 18, Issue 5, 2007, Pages 1023-1041

  Urgaonkar, Bhuvan ^a   Rosenberg, Arnold L ^b   Shenoy, Prashant ^b  

^a The Pennsylvania State University   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Application placement; Approximation algorithm; Hosting platform

Indexed keywords

EID: 34748908375     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012905410700511X     Document Type: Article

References (24)

1. K. Appleby, S. Fakhouri, L. Fong, M. K. G. Goldszmidt, S. Krishnakumar, D. Pazel, J. Pershing, and B. Rochwerger. Oceano - SLA-based Management of a Computing Utility. In Proceedings of the IFIP/IEEE Symposium on Integrated Network Management, May 2001.
2. A. K. Chandra, D. S. Hirschberg, and C. K. Wong. Approximate Algorithms for Some Generalized Knapsack Problems. In Theoretical Computer Science, volume 3, pages 293-304, 1976.
3. J. Chase and R. Doyle. Balance of Power: Energy Management for Server Clusters. In Proceedings of the Eighth Workshop on Hot Topics in Operating Systems (HotOS-VIII), Elmau, Germany, May 2001.
4. C. Chekuri and S. Khanna. On Multi-dimensional Packing Problems. In In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 1999.
5. C. Chekuri and S. Khanna. A PTAS for the Multiple Knapsack Problem. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000.
6. W. Cook and A. Rohe. Computing Minimum-weight Perfect Matchings. In INFORMS Journal on Computing, pages 138-148, 1999.
7. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1991.
8. D. S. Hochbaum (Ed.). Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston, MA, July 1996.
9. J. Edmonds. Maximum Matching and a Polyhedron with 0,1 - Vertices. In Journal of Research of the National Bureau of Standards 69B, 1965.
10. A. M. Friexe and M. R. B. Clarke. Approximation Algorithms for the m-dimensional 0-1 Knapsack Problem: Worst-case and Probabilistic Analyses. In European Journal of Operational Research 15(1), 1984.
11. M. Garey and D. Johnson. Computers and Intractibility: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York, January 1979.
12. M. Moser, D. P. Jokanovic, and N. Shiratori. An Algorithm for the Multidimensional Multiple-Choice Knapsack Problem. In IEICE Trans. Fundamentals Vol. E80-A No. 3, March 1997.
13. A compendium of NP optimization problems, http://www.nada.kth.se/~viggo/ problemlist/compendium.html.
14. P. Raghavan and C. D. Thompson. Randomized Rounding: a Technique for Provably Good Algorithms and Algorithmic Proofs. In Combinatorica, volume 7, pages 365-374, 1987.
15. S. Ranjan, J. Rolia, H. Fu, and E. Knightly. QoS-Driven Server Migration for Internet Data Centers. In Proceedings of the Tenth International Workshop on Quality of Service, Miami, FL, 2002.
16. D. B. Shmoys and E. Tardos. An Approximation Algorithm for the Generalized Assignment Problem. In Mathematical Programming A, 62:461-74, 1993.
17. B. Urgaonkar, P. Shenoy, and T. Roscoe. Resource Overbooking and Application Profiling in Shared Hosting Platforms. In Proceedings of the Fifth USENIX Symposium on Operating Systems Design and Implementation (OSDI2002), Boston, MA, December 2002.
18. M. J. Beeson, Foundations of Constructive Mathematics (Springer, Berlin, 1985).
19. K. L. Clark, "Negations as failure," in Logic and Data Bases, eds. H. Gallaire and J. Winker (Plenum Press, New York, 1973) pp. 293-306.
20. D. Doive, "Unanimity in an unknown and unreliable environment," Proc. 22nd Annual Symposium on Foundations of Computer Science, Nashville, TN, Oct. 1981, pp. 159-168.
21. W. L. Gewirtz, "Investigations in the theory of descriptive complexity," Ph. D. Thesis, New York University, 1974.
22. M. Joliat, "A simple technique for partial elimination of unit productions from LR(k) parsers," IEEE Trans. Comput. C-27 (1976) 753-764.
23. R. Lorentz and D. B. Benson, "Deterministic and nondeterministic flow-chart interpretations," J. Comput. System Sci. 27 (1983) 400-433.
24. R. Tamassia, C. Batini and M. Talamo, "An algorithm for automatic layout of entity relationship diagrams," in Entity-Relationship Approach to Software Engineering, Proc. 3rd Int. Conf. on Entity-Relationship Approach, eds. C. G. Davis, S. Jajodia, P. A. Ng and R. T. Yeh (North-Holland, Amsterdam, 1983) pp. 421-439.