BURN: Enabling Workload Burstiness in Customized Service Benchmarks

被引:5
作者
Casale, Giuliano
Kalbasi, Amir [1 ]
Krishnamurthy, Diwakar [1 ]
Rolia, Jerry [2 ]
机构
[1] Univ Calgary, Calgary, AB T2N 1N4, Canada
[2] HP Labs, Serv Res Lab, Palo Alto, CA 94304 USA
基金
加拿大自然科学与工程研究理事会;
关键词
Benchmarking; performance; burstiness; bottleneck migration; overdemand; CLOSED QUEUING-NETWORKS; ASYMPTOTIC ANALYSIS; ARRIVAL PROCESSES; PHASE-TYPE; SYSTEMS; GENERATION; BOTTLENECK;
D O I
10.1109/TSE.2011.58
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We introduce BURN, a methodology to create customized benchmarks for testing multitier applications under time-varying resource usage conditions. Starting from a set of preexisting test workloads, BURN finds a policy that interleaves their execution to stress the multitier application and generate controlled burstiness in resource consumption. This is useful to study, in a controlled way, the robustness of software services to sudden changes in the workload characteristics and in the usage levels of the resources. The problem is tackled by a model-based technique which first generates Markov models to describe resource consumption patterns of each test workload. Then, a policy is generated using an optimization program which sets as constraints a target request mix and user-specified levels of burstiness at the different resources in the system. Burstiness is quantified using a novel metric called overdemand, which describes in a natural way the tendency of a workload to keep a resource congested for long periods of time and across multiple requests. A case study based on a three-tier application testbed shows that our method is able to control and predict burstiness for session service demands at a fine-grained scale. Furthermore, experiments demonstrate that for any given request mix our approach can expose latency and throughput degradations not found with nonbursty workloads having the same request mix.
引用
收藏
页码:778 / 793
页数:16
相关论文
共 37 条
[1]  
Amza C., 2002, P 5 WORKSH WORKL CHA
[2]  
[Anonymous], SYSTEM MODELING ANAL
[3]   Asymptotic analysis of multiclass closed queueing networks: Multiple bottlenecks [J].
Balbo, G ;
Serazzi, G .
PERFORMANCE EVALUATION, 1997, 30 (03) :115-152
[4]   Asymptotic analysis of multiclass closed queueing networks: Common bottleneck [J].
Balbo, G ;
Serazzi, G .
PERFORMANCE EVALUATION, 1996, 26 (01) :51-72
[5]  
Barford P., 1998, Performance Evaluation Review, V26, P151, DOI 10.1145/277858.277897
[6]  
Bolch G., 2006, Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications
[7]   Bottlenecks identification in multiclass queueing networks using convex polytopes [J].
Casale, G ;
Serazzi, G .
IEEE COMPUTER SOCIETY'S 12TH ANNUAL INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATIONS SYSTEMS - PROCEEDINGS, 2004, :223-230
[8]  
CASALE G, 2009, SERG200902 U CALG
[9]   KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes [J].
Casale, Giuliano ;
Zhang, Eddy Z. ;
Smirni, Evgenia .
QUANTITATIVE EVALUATION OF SYSTEMS: QEST 2008, PROCEEDINGS, 2008, :83-92
[10]   KPC-Toolbox: Best recipes for automatic trace fitting using Markovian Arrival Processes [J].
Casale, Giuliano ;
Zhang, Eddy Z. ;
Smirni, Evgenia .
PERFORMANCE EVALUATION, 2010, 67 (09) :873-896