skip to main content
10.1145/1807128.1807166acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Characterizing, modeling, and generating workload spikes for stateful services

Published: 10 June 2010 Publication History

Abstract

Evaluating the resiliency of stateful Internet services to significant workload spikes and data hotspots requires realistic workload traces that are usually very difficult to obtain. A popular approach is to create a workload model and generate synthetic workload, however, there exists no characterization and model of stateful spikes. In this paper we analyze five workload and data spikes and find that they vary significantly in many important aspects such as steepness, magnitude, duration, and spatial locality. We propose and validate a model of stateful spikes that allows us to synthesize volume and data spikes and could thus be used by both cloud computing users and providers to stress-test their infrastructure.

References

[1]
Faban project web site. http://faban.sunsource.net/.
[2]
Httperf project web site. http://code.google.com/p/httperf/.
[3]
Inauguration Day on Twitter. http://blog.twitter.com/2009/01/inauguration-day-on-twitter.html.
[4]
Jmeter project web site. http://jakarta.apache.org/jmeter/.
[5]
Outpouring of searches for the late Michael Jackson. http://googleblog.blogspot.com/2009/06/outpouring-of-searches-for-late-%michael.html.
[6]
Rubis project web site. http://rubis.ow2.org/.
[7]
Top 20 Twitter trends in 2009. http://trendistic.com/_top-twenty-trending-topics-2009/.
[8]
Wikipedia page counters. http://mituzas.lt/2007/12/10/wikipedia-page-counters/.
[9]
D. Aldous. Exchangeability and related topics. In Ecole d'Ete de Probabilities de Saint-Flour XIII 1983, pages 1--198. Springer, 1985.
[10]
M. Arlitt and T. Jin. Workload characterization of the 1998 World Cup Web site. Technical Report HPL-1999-35R1, HP Labs, 1999.
[11]
M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia. Above the clouds: A Berkeley view of Cloud Computing. Technical Report UCB/EECS-2009-28, UC Berkeley, Feb 2009.
[12]
M. Armbrust, A. Fox, D. Patterson, N. Lanham, H. Oh, B. Trushkowsky, and J. Trutna. SCADS: Scale-independent storage for social computing applications. In CIDR, 2009.
[13]
P. Barford and M. Crovella. Generating representative web workloads for network and server performance evaluation. In SIGMETRICS, 1998.
[14]
P. Bod'ík, G. Friedman, L. Biewald, H. Levine, G. Candea, K. Patel, G. Tolle, J. Hui, A. Fox, M. I. Jordan, and D. Patterson. Combining visualization and statistical analysis to improve operator confidence and efficiency for failure detection and localization. In ICAC, 2005.
[15]
X. Chen and X. Zhang. A popularity-based prediction model for web prefetching. IEEE Computer, 2003.
[16]
M. E. Crovella and A. Bestavros. Self-similarity in World Wide Web traffic evidence and possible causes. IEEE/ACM Transactions on Networking, 1996.
[17]
G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available key-value store. In SOSP 2007.
[18]
A. Gulati, C. Kumar, and I. Ahmad. Storage workload characterization and consolidation in virtualized environments. In VPACT, 2009.
[19]
J. Jung, B. Krishnamurthy, and M. Rabinovich. Flash crowds and denial of service attacks: Characterization and implications for CDNs and Web sites. In WWW, 2002.
[20]
S. Kavalanekar, B. Worthington, Q. Zhang, and V. Sharda. Characterization of storage workload traces from production windows servers. In ISWC, 2008.
[21]
A. Lakhina, M. Crovella, and C. Diot. Diagnosing network-wide traffic anomalies. In SIGCOMM, 2004.
[22]
N. Mi, G. Casale, L. Cherkasova, and E. Smirni. Injecting realistic burstiness to a traditional client-server benchmark. In ICAC, 2009.
[23]
V. N. Padmanabhan and L. Qiu. The content and access dynamics of a busy web server: Findings and implications. In SIGCOMM, 2000.
[24]
J. Pitman and M. Yor. The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator. Ann. Probab., 25(2):855--900, 1997.
[25]
B. Schroeder and M. Harchol-Balter. Web servers under overload: How scheduling can help. ACM Trans. Internet Technol., 6(1):20--52, 2006.
[26]
B. Urgaonkar, P. Shenoy, A. Chandra, and P. Goyal. Dynamic provisioning of multi-tier Internet applications. In ICAC, 2005.
[27]
A. Wolman, M. Voelker, N. Sharma, N. Cardwell, A. Karlin, and H. M. Levy. On the scale and performance of cooperative web proxy caching. In SOSP, 1999.

Cited By

View all
  • (2024)Thesios: Synthesizing Accurate Counterfactual I/O Traces from I/O SamplesProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 310.1145/3620666.3651337(1016-1032)Online publication date: 27-Apr-2024
  • (2024)Smart HPA: A Resource-Efficient Horizontal Pod Auto-Scaler for Microservice Architectures2024 IEEE 21st International Conference on Software Architecture (ICSA)10.1109/ICSA59870.2024.00013(46-57)Online publication date: 4-Jun-2024
  • (2024)PA-SPS: A Predictive Adaptive Approach for an Elastic Stream Processing SystemJournal of Parallel and Distributed Computing10.1016/j.jpdc.2024.104940(104940)Online publication date: Jun-2024
  • Show More Cited By

Index Terms

  1. Characterizing, modeling, and generating workload spikes for stateful services

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SoCC '10: Proceedings of the 1st ACM symposium on Cloud computing
      June 2010
      264 pages
      ISBN:9781450300360
      DOI:10.1145/1807128
      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: 10 June 2010

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. data hotspots
      2. workload spikes
      3. workload synthesis
      4. workoad characterization

      Qualifiers

      • Research-article

      Conference

      SOCC '10
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 169 of 722 submissions, 23%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)20
      • Downloads (Last 6 weeks)4
      Reflects downloads up to 15 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Thesios: Synthesizing Accurate Counterfactual I/O Traces from I/O SamplesProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 310.1145/3620666.3651337(1016-1032)Online publication date: 27-Apr-2024
      • (2024)Smart HPA: A Resource-Efficient Horizontal Pod Auto-Scaler for Microservice Architectures2024 IEEE 21st International Conference on Software Architecture (ICSA)10.1109/ICSA59870.2024.00013(46-57)Online publication date: 4-Jun-2024
      • (2024)PA-SPS: A Predictive Adaptive Approach for an Elastic Stream Processing SystemJournal of Parallel and Distributed Computing10.1016/j.jpdc.2024.104940(104940)Online publication date: Jun-2024
      • (2022)Leveraging Scale-Up Machines for Swift DBMS Replication on IaaS Platforms Using BalenaDBIEICE Transactions on Information and Systems10.1587/transinf.2020ZDP7505E105.D:1(92-104)Online publication date: 1-Jan-2022
      • (2022)TSB-UADProceedings of the VLDB Endowment10.14778/3529337.352935415:8(1697-1711)Online publication date: 22-Jun-2022
      • (2022)The benefits of general-purpose on-NIC memoryProceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3503222.3507711(1130-1147)Online publication date: 28-Feb-2022
      • (2022)Coordinating Fast Concurrency Adapting With Autoscaling for SLO-Oriented Web ApplicationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.315151233:12(3349-3362)Online publication date: 1-Dec-2022
      • (2022)Energy-Aware Collaborative Service Caching in a 5G-Enabled MEC With Uncertain PayoffsIEEE Transactions on Communications10.1109/TCOMM.2021.312503470:2(1058-1071)Online publication date: Feb-2022
      • (2022)A predictive approach for dynamic replication of operators in distributed stream processing systems2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)10.1109/SBAC-PAD55451.2022.00023(120-129)Online publication date: Nov-2022
      • (2022)Accelerating Garbage Collection of 3D Flash Memory via Exploiting Inter-Channel Parallelism2022 IEEE 40th International Conference on Computer Design (ICCD)10.1109/ICCD56317.2022.00033(162-169)Online publication date: Oct-2022
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media