Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2463676.2465302acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

RTP: robust tenant placement for elastic in-memory database clusters

Published: 22 June 2013 Publication History

Abstract

In the cloud services industry, a key issue for cloud operators is to minimize operational costs. In this paper, we consider algorithms that elastically contract and expand a cluster of in-memory databases depending on tenants' behavior over time while maintaining response time guarantees.
We evaluate our tenant placement algorithms using traces obtained from one of SAP's production on-demand applications. Our experiments reveal that our approach lowers operating costs for the database cluster of this application by a factor of 2.2 to 10, measured in Amazon EC2 hourly rates, in comparison to the state of the art. In addition, we carefully study the trade-off between cost savings obtained by continuously migrating tenants and the robustness of servers towards load spikes and failures.

References

[1]
P. A. Bernstein, I. Cseri, N. Dani, N. Ellis, A. Kalhan, G. Kakivaya, D. B. Lomet, R. Manne, L. Novik, and T. Talius. Adapting microsoft SQL server for cloud computing. In ICDE, pages 1255--1263. IEEE Computer Society, 2011.
[2]
C. Chekuri and S. Khanna. On multi-dimensional packing problems. In ACM SODA, 1999.
[3]
J. Chen, G. Soundararajan, and C. Amza. Autonomic Provisioning of Backend Databases in Dynamic Content Web Servers. In ICAC, pages 231--242. IEEE, 2006.
[4]
J. Csirik and D. S. Johnson. Bounded Space On-Line Bin Packing: Best is Better than First. In SODA, pages 309--319. ACM/SIAM, 1991.
[5]
C. Curino, E. P. C. Jones, S. Madden, and H. Balakrishnan. Workload-aware database monitoring and consolidation. In SIGMOD Conference, pages 313--324. ACM, 2011.
[6]
S. Das, S. Nishimura, D. Agrawal, and A. El Abbadi. Albatross: Lightweight Elasticity in Shared Storage Databases for the Cloud using Live Data Migration. PVLDB, 4(8):494--505, 2011.
[7]
J. Duggan, U. Çetintemel, O. Papaemmanouil, and E. Upfal. Performance prediction for concurrent database workloads. In SIGMOD Conference, pages 337--348. ACM, 2011.
[8]
A. J. Elmore, S. Das, D. Agrawal, and A. El Abbadi. Zephyr: live migration in shared nothing databases for elastic cloud platforms. In SIGMOD Conference, pages 301--312. ACM, 2011.
[9]
T. C. Ferreto, M. A. S. Netto, R. N. Calheiros, and C. A. F. D. Rose. Server consolidation with migration control for virtualized data centers. Future Generation Comp. Syst., 27(8):1027--1034, 2011.
[10]
French Operational Research and Decision Support Society. ROADEF Challenge 2012. http://challenge.roadef.org.
[11]
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
[12]
F. Glover. Tabu Search - Part I. INFORMS Journal on Computing, 1(3):190--206, 1989.
[13]
D. Gmach, J. Rolia, L. Cherkasova, G. Belrose, T. Turicchi, and A. Kemper. An integrated approach to resource pool management: Policies, efficiency and quality metrics. In DSN, pages 326--335. IEEE Computer Society, 2008.
[14]
L. Hedegard and J. Dietz. The benefits of enabling fallback in the active data warehouse, teradata, 2007.
[15]
D. S. Hochbaum and D. B. Shmoys. A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach. SIAM J. Comput., 17(3):539--551, 1988.
[16]
H.-I. Hsiao and D. J. DeWitt. Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines. In ICDE, pages 456--465. IEEE Computer Society, 1990.
[17]
J. Krüger, C. Kim, M. Grund, N. Satish, D. Schwalb, J. Chhugani, H. Plattner, P. Dubey, and A. Zeier. Fast Updates on Read-Optimized Databases Using Multi-Core CPUs. PVLDB, 5(1):61--72, 2011.
[18]
W. Lang, S. Shankar, J. M. Patel, and A. Kalhan. Towards Multi-tenant Performance SLOs. In ICDE, pages 702--713. IEEE Computer Society, 2012.
[19]
M. Mehta and D. J. DeWitt. Data Placement in Shared-Nothing Parallel Database Systems. VLDB J., 6(1):53--72, 1997.
[20]
J. M. Milán-Franco, R. Jiménez-Peris, M. Patino-Martınez, and B. Kemme. Adaptive Middleware for Data Replication. In Middleware, pages 175--194. Springer, 2004.
[21]
J. Schaffner, B. Eckart, D. Jacobs, C. Schwarz, H. Plattner, and A. Zeier. Predicting in-memory database performance for automating cluster management tasks. In ICDE, pages 1264--1275. IEEE Computer Society, 2011.
[22]
J. Schaffner and T. Januschowski. Realistic tenant traces for enterprise dbaas. In SMDB, ICDE Workshops, 2013.
[23]
J. M. Valério de Carvalho. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research, 1999.
[24]
A. Watanabe and H. Yokota. Adaptive Lapped Declustering: A Highly Available Data-Placement Method Balancing Access Load and Space Utilization. In ICDE, pages 828--839. IEEE Computer Society, 2005.
[25]
F. Yang, J. Shanmugasundaram, and R. Yerneni. A Scalable Data Platform for a Large Number of Small Applications. In CIDR. www.cidrdb.org, 2009.
[26]
H. Zhu, P. Gu, and J. Wang. Shifted declustering: a placement-ideal layout scheme for multi-way replication storage architecture. In ICS, pages 134--144. ACM, 2008.

Cited By

View all
  • (2023)Flexible Resource Allocation for Relational Database-as-a-ServiceProceedings of the VLDB Endowment10.14778/3625054.362505816:13(4202-4215)Online publication date: 1-Sep-2023
  • (2023)YISHAN: Managing Large-scale Cloud Database Instances via Machine LearningIEEE Transactions on Services Computing10.1109/TSC.2021.313124916:1(724-738)Online publication date: 1-Jan-2023
  • (2023)Online Robust Bin Packing for Resource Allocation in Cloud Computing2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD)10.1109/CSCWD57460.2023.10152004(1063-1068)Online publication date: 24-May-2023
  • Show More Cited By

Index Terms

  1. RTP: robust tenant placement for elastic in-memory database clusters

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
    June 2013
    1322 pages
    ISBN:9781450320375
    DOI:10.1145/2463676
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 22 June 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. cloud computing
    2. data placement
    3. fault tolerance
    4. in-memory databases
    5. multi tenancy

    Qualifiers

    • Research-article

    Conference

    SIGMOD/PODS'13
    Sponsor:

    Acceptance Rates

    SIGMOD '13 Paper Acceptance Rate 76 of 372 submissions, 20%;
    Overall Acceptance Rate 785 of 4,003 submissions, 20%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)11
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 06 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Flexible Resource Allocation for Relational Database-as-a-ServiceProceedings of the VLDB Endowment10.14778/3625054.362505816:13(4202-4215)Online publication date: 1-Sep-2023
    • (2023)YISHAN: Managing Large-scale Cloud Database Instances via Machine LearningIEEE Transactions on Services Computing10.1109/TSC.2021.313124916:1(724-738)Online publication date: 1-Jan-2023
    • (2023)Online Robust Bin Packing for Resource Allocation in Cloud Computing2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD)10.1109/CSCWD57460.2023.10152004(1063-1068)Online publication date: 24-May-2023
    • (2022)Tenant placement in over-subscribed database-as-a-service clustersProceedings of the VLDB Endowment10.14778/3551793.355181415:11(2559-2571)Online publication date: 29-Sep-2022
    • (2022)NetheriteProceedings of the VLDB Endowment10.14778/3529337.352934415:8(1591-1604)Online publication date: 22-Jun-2022
    • (2021)On the Fault-Tolerant Online Bin Packing ProblemAlgorithmic Aspects of Cloud Computing10.1007/978-3-030-93043-1_1(1-17)Online publication date: 10-Dec-2021
    • (2018)Evaluating Multi-tenant Live Migrations Effects on PerformanceOn the Move to Meaningful Internet Systems. OTM 2018 Conferences10.1007/978-3-030-02610-3_4(61-77)Online publication date: 18-Oct-2018
    • (2018)ElasticityEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_80806(1269-1270)Online publication date: 7-Dec-2018
    • (2018)MultitenancyEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_80639(2440-2443)Online publication date: 7-Dec-2018
    • (2017)Energy-efficient resource allocation and provisioning for in-memory database clusters2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)10.23919/INM.2017.7987260(19-27)Online publication date: May-2017
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media