Abstract
In this chapter, we introduce the problem of assigning tenants to servers so that performance SLOs are enforced and server cost is minimized. We call this problem the Robust Tenant Placement and Migration Problem (RTP).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Technically, the response time in the 99-th percentile has been measured and transformed into load using Eq. (3.6).
- 2.
Another conceivable option would be to copy the tenant from a shared filesystem. We focus on shared-nothing architectures in this dissertation (cf. Chap. 2).
Bibliography
C. Curino, E.P.C. Jones, S. Madden, H. Balakrishnan, Workload-aware database monitoring and consolidation, in Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, 12–16 June 2011 (ACM, 2011), pp. 313–324
J. Duggan, U. Çetintemel, O. Papaemmanouil, E. Upfal, Performance prediction for concurrent database workloads, in Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, 12–16 June 2011 (ACM, 2011), pp. 337–348
L. Epstein, A. Levin, On bin packing with conflicts. SIAM J. Optim. 19(3), 1270–1298 (2008)
F. Färber, S.K. Cha, J. Primsch, C. Bornhövd, S. Sigg, W. Lehner, SAP HANA database: data management for modern business applications. SIGMOD Rec. 40(4), 45–51 (2011)
M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco, 1979). ISBN:0-7167-1044-7
L. Hedegard, J. Dietz, The benefits of enabling fallback in the active data warehouse. Teradata Mag. Online 7(1) (2007). http://apps.teradata.com/tdmo/v07n01/tech2tech/asktheexpert/benefitsoffallback.aspx (Online). Accessed 13 Dec 2012
D.S. Johnson, Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256–278 (1974)
V. Kaibel, M.E. Pfetsch, Packing and partitioning orbitopes. Math. Program. 114, 1–36 (2008)
J. Krüger, C. Kim, M. Grund, N. Satish, D. Schwalb, J. Chhugani, H. Plattner, P. Dubey, A. Zeier, Fast updates on read-optimized databases using multi-core CPUs. PVLDB 5(1), 61–72 (2011)
W. Lang, S. Shankar, J.M. Patel, A. Kalhan, Towards multi-tenant performance SLOs, in IEEE 28th International Conference on Data Engineering (ICDE 2012), Washington, DC (Arlington, VA), 1–5 Apr 2012 (IEEE Computer Society, 2012), pp. 702–713
W. Leinberger, G. Karypis, V. Kumar, Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints, in ICPP, Aizu-Wakamatsu City, 1999, pp. 404–412
SAP, BusinessObjects BI OnDemand (2012), http://www.biondemand.com/businessintelligence (Online). Accessed 13 Dec 2012
J.M. Valério de Carvalho, Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86, 629–659 (1999)
F. Yang, J. Shanmugasundaram, R. Yerneni, A scalable data platform for a large number of small applications, in CIDR 2009, Fourth Biennial Conference on Innovative Data Systems Research, Asilomar, 4–7 Jan 2009. Online Proceedings, 2009, www.cidrdb.org
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Schaffner, J. (2014). The Robust Tenant Placement and Migration Problem. In: Multi Tenancy for Cloud-Based In-Memory Column Databases. In-Memory Data Management Research. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00497-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-00497-6_4
Published:
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00496-9
Online ISBN: 978-3-319-00497-6
eBook Packages: Business and EconomicsBusiness and Management (R0)