Nothing Special   »   [go: up one dir, main page]

Skip to main content

Workloads

  • Chapter
Systems Benchmarking

Abstract

In this chapter, we consider workloads in the context of workload generation. It starts with a classification of the different workload facets and artifacts. We introduce the distinction between executable and non-executable parts of a workload, as well as the distinction between natural and artificial workloads. The executable parts are then discussed in detail, including natural benchmarks, application workloads, and synthetic workloads. Next, the non-executable parts are discussed, distinguishing between workload traces and workload descriptions. In the rest of the chapter, we introduce the different types of workload descriptions that can be used for batch workloads and transactional workloads, as well as for open and closed workloads. The challenges of generating steady-state workloads and workloads with varying arrival rates are discussed. Finally, the chapter concludes with a brief introduction of system-metric-based workload descriptions.

“It’s not so much how busy you are, but why you are busy. The bee is praised, the mosquito is swatted.”

—Marie O’Conner

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Bolch, G., Greiner, S., de Meer, H., & Trivedi, K. S. (2006). Queueing networks and Markov chains: Modeling and performance evaluation with computer science applications (2nd edn.).Wiley: Hoboken, NJ.

    Book  Google Scholar 

  • Cleveland, R. B., Cleveland, W. S., McRae, J. E., & Terpenning, I. (1990). STL: A seasonal-trend decomposition procedure based on loess. Journal of Official Statistics, 6(1), 3–73. Statistics Sweden (SCB): Stockholm, Sweden.

    Google Scholar 

  • Herbst, N. R., Kounev, S., Weber, A., & Groenda, H. (2015). BUNGEE: An elasticity benchmark for self-adaptive IaaS cloud environments. In Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015), Florence, Italy, pp. 46–56. IEEE: Piscataway, NJ.

    Google Scholar 

  • Lange, K.-D. (2009). Identifying shades of green: The SPECpower benchmarks. Computer, 42(3), 95–97. IEEE: Piscataway, NJ, USA.

    Google Scholar 

  • Menascé, D. A., Almeida, V. A. F., & Dowdy, L. W. (2004). Performance by design: Computer capacity planning by example. Prentice Hall: Upper Saddle River, NJ.

    Google Scholar 

  • Menascé, D. A., Almeida, V. A. F., Fonseca, R. C., & Mendes, M. A. (1999). A methodology for workload characterization of E-commerce sites. In Proceedings of the 1st ACM Conference on Electronic Commerce (EC’99), Denver, Colorado, USA (pp. 119–128). ACM: New York, NY.

    Google Scholar 

  • Schroeder, B., Wierman, A., & Harchol-Balter, M. (2006). Open versus closed: A cautionary tale. In Proceedings of the 3rd Conference on Networked Systems Design & Implementation - Volume 3 (NSDI 2006), San Jose, CA, (pp. 18–18). USENIX Association: Berkeley, CA.

    Google Scholar 

  • SPECpower Committee. (2014). Power and performance benchmark methodology V2.2. Gainesville, VA: Standard Performance Evaluation Corporation (SPEC).

    Google Scholar 

  • Verbesselt, J., Hyndman, R., Newnham, G., & Culvenor, D. (2010). Detecting trend and seasonal changes in satellite image time series. Remote Sensing of Environment, 114(1), 106–115. Elsevier Science: Amsterdam.

    Google Scholar 

  • Vögele, C., van Hoorn, A., Schulz, E., Hasselbring, W., & Krcmar, H. (2018). WESSBAS: Extraction of probabilistic workload specifications for load testing and performance prediction—a model-driven approach for session-based application systems. Software & Systems Modeling, 17(2), 443–477. Springer: Berlin.

    Google Scholar 

  • von Kistowski, J., Eismann, S., Schmitt, N., Bauer, A., Grohmann, J., & Kounev, S. (2018). TeaStore: A micro-service reference application for benchmarking, modeling, and resource management research. In Proceedings of the 26th IEEE International Symposium on the Modelling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2018), Milwaukee, WI, USA. IEEE Computer Society: Washington, DC.

    Google Scholar 

  • von Kistowski, J., Herbst, N. R., Kounev, S., Groenda, H., Stier, C., & Lehrig, S. (2017). Modeling and extracting load intensity profiles. ACM Transactions on Autonomous and Adaptive Systems, 11(4), 23:1–23:28. ACM: New York, NY, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Cite this chapter

Kounev, S., Lange, KD., Kistowski, J.v. (2020). Workloads. In: Systems Benchmarking. Springer, Cham. https://doi.org/10.1007/978-3-030-41705-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41705-5_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41704-8

  • Online ISBN: 978-3-030-41705-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics