Skip to main content

Part of the book series: In-Memory Data Management Research ((IMDM))

  • 859 Accesses

Abstract

In this chapter, we evaluate our algorithms for RTP. This is done by replaying the load changes of all tenants over a 4-months-period against our algorithms. The load changes are aggregated in 10 min intervals. For each 10 min interval, a new instance of RTP is created and our different algorithms produce a series of migrations which must be completed within a 10 min window.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We study the effect of changing δ in Experiment (iv).

Bibliography

  1. Amazon Web Services LLC, Amazon EC2 Pricing (2012), http://aws.amazon.com/ec2/pricing/ (Online). Accessed 13 Dec 2012

  2. E. Anderson, J. Hall, J.D. Hartline, M. Hobbes, A.R. Karlin, J. Saia, R. Swaminathan, J. Wilkes, Algorithms for data migration. Algorithmica 57(2), 349–380 (2010)

    Article  Google Scholar 

  3. P. Bodík, A. Fox, M.J. Franklin, M.I. Jordan, D.A. Patterson, Characterizing, modeling, and generating workload spikes for stateful services, in Proceedings of the 1st ACM Symposium on Cloud Computing, SoCC 2010, Indianapolis, 10–11 June 2010 (ACM, 2010), pp. 241–252

    Google Scholar 

  4. 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

    Google Scholar 

  5. ILOG CPLEX 12.2, Reference manual (2012), http://www.ilog.com/products/cplex

  6. M. Odersky, M. Zenger, Scalable component abstractions, in Proceedings of the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2005, San Diego, 16–20 Oct 2005 (ACM, 2005), pp. 41–57

    Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. 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

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Schaffner, J. (2014). Experimental Evaluation. 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_6

Download citation

Publish with us

Policies and ethics