The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A scalable application placement controller for enterprise data centers
Abstract
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each application and where to put them, while observing all kinds of resource constraints. This NP hard problem has real usage in commercial middleware products. Existing approximation algorithms for this problem can scale to at most a few hundred machines, and may produce placement solutions that are far from optimal when system resources are tight. In this paper, we propose a new algorithm that can produce within 30 seconds high-quality solutions for hard placement problems with thousands of machines and thousands of applications. This scalability is crucial for dynamic resource provisioning in large-scale enterprise data centers. Our algorithm allows multiple applications to share a single machine, and strives to maximize the total satisfied application demand, to minimize the number of application starts and stops, and to balance the load across machines. Compared with existing state-of-the-art algorithms, for systems with 100 machines or less, our algorithm is up to 134 times faster, reduces application starts and stops by up to 97%, and produces placement solutions that satisfy up to 25% more application demands. Our algorithm has been implemented and adopted in a leading commercial middleware product for managing the performance of Web applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Network flows: Theory, algorithms and applications
(1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90171-6 · Cited by 2,585
Kellerer, H., Pferschy, U., & Pisinger, D. (2004) · Springer eBooks · doi:10.1007/978-3-540-24777-7 · Cited by 1,824
Cluster-based scalable network services
Fox, A., Gribble, S. D., Chawathe, Y., Brewer, E. A., & Gauthier, P. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266662 · Cited by 522
Resource overbooking and application profiling in shared hosting platforms
Urgaonkar, B., Shenoy, P., & Roscoe, T. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844151 · Cited by 352
Oceano-SLA based management of a computing utility
Appleby, K., Fakhouri, S., Fong, L., Goldszmidt, G., Kalantar, M., Krishnakumar, S., Pazel, D. P., Pershing, J., & Rochwerger, B. (2002) · 2001 IEEE/IFIP International Symposium on Integrated Network Management Proceedings. Integrated Network Management VII. Integrated Management Strategies for the New Millennium (Cat. No.01EX470) · doi:10.1109/inm.2001.918085 · Cited by 321
The Coign automatic distributed partitioning system
Hunt, G. C., & Scott, M. L. (1999) · UR Research (University of Rochester) · doi:10.5555/296806.296826 · Cited by 255
Dynamic placement for clustered web applications
Karve, A. A., Kimbrel, T., Pacifici, G., et al. (2006) · International World Wide Web Conference (WWW) · doi:10.1145/1135777.1135865 · Cited by 195
Self-citationPerformance Management for Cluster Based Web Services
Levy, R., Nagarajarao, J., Pacifici, G., Spreitzer, A., Tantawi, A. N., & Youssef, A. (2003) · Springer eBooks · doi:10.1007/978-0-387-35674-7_29 · Cited by 164
Self-citationIntegrated resource management for cluster-based Internet services
Shen, K., Tang, H., Yang, T., & Chu, L. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844150 · Cited by 133
Cited by
Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment
Xiao, Z., Song, W., & Chen, Q. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.283 · Cited by 858
Resource Management in Clouds: Survey and Research Challenges
Jennings, B., & Stadler, R. (2015) · Journal of Network and Systems Management · doi:10.1007/s10922-014-9307-7 · Cited by 548
Multi-Objective Virtual Machine Placement in Virtualized Data Center Environments
Xu, J., & Fortes, J. A. B. (2010) · 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing · doi:10.1109/greencom-cpscom.2010.137 · Cited by 529
Quality-of-service in cloud computing: modeling techniques and their applications
Ardagna, D., Casale, G., Ciavotta, M., Pérez, J. F., & Wang, W. (2014) · Journal of Internet Services and Applications · doi:10.1186/s13174-014-0011-3 · Cited by 267
Plitt, M., & Masselot, F. (2010) · The Prague Bulletin of Mathematical Linguistics · doi:10.2478/v10108-010-0010-x · Cited by 265
Metadata
- Authors
- Tang, C., Steinder, M., Spreitzer, M., & Pacifici, G.
- Venue
- Proceedings of the 16th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2007-05-08
- Pages
- 331-340
- OpenAlex
- W2142994777
- Cited by
- 322
- References
- 10
- FWCI
- 12.36
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A scalable application placement controller for enterprise data centers. https://app.cochat.ai/papers/10.1145/1242572.1242618
- The paper
- Tang, C., Steinder, M., Spreitzer, M., & Pacifici, G. (2007). A scalable application placement controller for enterprise data centers. Proceedings of the 16th international conference on World Wide Web. https://doi.org/10.1145/1242572.1242618
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.