Handling Session Classes for Predicting ASP.NET Performance Metrics Ágnes Bogárdi-Mészöly, Tihamér Levendovszky, Hassan Charaf Budapest University of Technology.

Slides:



Advertisements
Similar presentations
CPU Scheduling.
Advertisements

Achieving Elasticity for Cloud MapReduce Jobs Khaled Salah IEEE CloudNet 2013 – San Francisco November 13, 2013.
 Liang Guo  Ibrahim Matta  Computer Science Department  Boston University  Presented by:  Chris Gianfrancesco and Rick Skowyra.
Copyright © 2005 Department of Computer Science CPSC 641 Winter PERFORMANCE EVALUATION Often in Computer Science you need to: – demonstrate that.
Efficient Autoscaling in the Cloud using Predictive Models for Workload Forecasting Roy, N., A. Dubey, and A. Gokhale 4th IEEE International Conference.
Towards Feasibility Region Calculus: An End-to-end Schedulability Analysis of Real- Time Multistage Execution William Hawkins and Tarek Abdelzaher Presented.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Single queue modeling. Basic definitions for performance predictions The performance of a system that gives services could be seen from two different.
1 PERFORMANCE EVALUATION H Often in Computer Science you need to: – demonstrate that a new concept, technique, or algorithm is feasible –demonstrate that.
Yaksha: A Self-Tuning Controller for Managing the Performance of 3-Tiered Web Sites Abhinav Kamra, Vishal Misra CS Department Columbia University Erich.
LDU Parametrized Discrete-Time Multivariable MRAC and Application to A Web Cache System Ying Lu, Gang Tao and Tarek Abdelzaher University of Virginia.
1 Part VI System-level Performance Models for the Web © 1998 Menascé & Almeida. All Rights Reserved.
Towards Autonomic Hosting of Multi-tier Internet Services Swaminathan Sivasubramanian, Guillaume Pierre and Maarten van Steen Vrije Universiteit, Amsterdam,
Computer System Lifecycle Chapter 1. Introduction Computer System users, administrators, and designers are all interested in performance evaluation. Whether.
Computer Networks Performance Evaluation. Chapter 12 Single Class MVA Performance by Design: Computer Capacity Planning by Example Daniel A. Menascé,
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Basic Concepts Maximum CPU utilization.
Verification & Validation
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
U NIVERSITY OF M ASSACHUSETTS, A MHERST – Department of Computer Science An Analytical Model for Multi-tier Internet Services and its Applications Bhuvan.
/ Copyright © Siemens AG All rights reserved. Corporate Technology Performance Prediction of Client-Server Systems by High-Level Abstraction Models.
Modeling and Performance Evaluation of Network and Computer Systems Introduction (Chapters 1 and 2) 10/4/2015H.Malekinezhad1.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
By Lecturer / Aisha Dawood 1.  Dedicated and Shared Server Processes  Configuring Oracle Database for Shared Server  Oracle Database Background Processes.
A Regression-Based Analytic Model for Dynamic Resource Provisioning of Multi-Tier Applications Qi Zhang College of William and Mary Williamsburg, VA 23187,
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 5: CPU Scheduling.
Optimal Server Allocation in Reconfigurable Clusters with Multiple Job Types J. Palmer I. Mitrani School of Computing Science University of Newcastle NE1.
Dana Butnariu Princeton University EDGE Lab June – September 2011 OPTIMAL SLEEPING IN DATACENTERS Joint work with Professor Mung Chiang, Ioannis Kamitsos,
Queueing Models with Multiple Classes CSCI 8710 Tuesday, November 28th Kraemer.
A Method for Transparent Admission Control and Request Scheduling in E-Commerce Web Sites S. Elnikety, E. Nahum, J. Tracey and W. Zwaenpoel Presented By.
Design and Evaluation of a Model for Multi-tiered Internet Applications Bhuvan Urgaonkar Internship project talk – Services Management Middleware Dept,
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 5: CPU Scheduling Basic.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part VI System-level Performance Models for the Web (Book, Chapter 8)
1. ◦ Intro ◦ Client-side security ◦ Server-side security ◦ Complete security ? 2.
Internet Applications: Performance Metrics and performance-related concepts E0397 – Lecture 2 10/8/2010.
Performance Testing Test Complete. Performance testing and its sub categories Performance testing is performed, to determine how fast some aspect of a.
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 31 – Process Management (Part 1) Klara Nahrstedt Spring 2009.
Introduction to Performance Testing Performance testing is the process of determining the speed or effectiveness of a computer, network, software program.
Grid Performability, Modelling and Measurement AHM’04 Optimal Tree Structures for Large-Scale Grids J. Palmer I. Mitrani School of Computing Science University.
Queuing Theory Simulation & Modeling.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part VI System-level Performance Models for the Web.
Abhinav Kamra, Vishal Misra CS Department Columbia University
CPU SCHEDULING.
Regulating Data Flow in J2EE Application Server
Mean Value Analysis of a Database Grid Application
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
CSCI1600: Embedded and Real Time Software
Queueing Theory Carey Williamson Department of Computer Science
CPU Scheduling Basic Concepts Scheduling Criteria
CPU Scheduling G.Anuradha
Module 5: CPU Scheduling
Computer Systems Performance Evaluation
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter5: CPU Scheduling
Chapter 5: CPU Scheduling
Chapter 6: CPU Scheduling
Chapter 5: CPU Scheduling
Computer Systems Performance Evaluation
Carey Williamson Department of Computer Science University of Calgary
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Approximate Mean Value Analysis of a Database Grid Application
Presentation transcript:

Handling Session Classes for Predicting ASP.NET Performance Metrics Ágnes Bogárdi-Mészöly, Tihamér Levendovszky, Hassan Charaf Budapest University of Technology and Economics, Hungary Department of Automation and Applied Informatics

Outline Introduction Backgrounds  Queueing model of web applications Model demonstration and validation in ASP.NET environment  Model parameters estimation based on one measurement  Model evaluation with the help of MATLAB  Model validation Conclusions and future work

Introduction Web-based information systems An important factor: performance  Low response time  High availability  Certain level of throughput Properly designed performance model  Performance prediction  At early stages of the development process Prominent technology: Microsoft.NET

Queueing Model of Web Applications 1 Application – network of M queues  Application tier – queue with processor sharing discipline  A request can take multiple visits to each queue – transitions to its successor and its predecessor Session-based workload – infinite server queueing system  Active session – occupying one server

Queueing Model of Web Applications 2

Evaluation algorithm Mean-Value Analysis (MVA)  Recursive algorithm  Introduce customers one by one  Terminate when all customers have been entered  Visit numbers instead of transition probabilities Utilization law  Utilization of the queues

Multiple session classes Model enhancement:  Incoming sessions classified into multiple classes  Service times, visit ratios, user think time on a per-class basis Time and space complexities of MVA ~ number of feasible population Approximate MVA algorithm in a few steps Balanced job bounds in one step

Model demonstration Three-tier ASP.NET test web application

Model parameters estimation and model evaluation Each page and class belonging to the presentation, business logic or database were measured separately Based on one measurement MVA Approximate MVA Balanced job bounds Max. number of customers Number of tiers Average user think time Visit numbers Average service times Response time Throughput Tier utilization Number of customers

Experimental configuration 1 Application Center Test  Warm-up time for the load to reach a steady-state  Sleep times to simulate realistic usage of the application  When we handle one session class, the number of simultaneous browser connections varied.  When we handle multiple session classes, there were two classes: a database reader and a database writer. The number of session of one class was constant 10, while the number of simultaneous browser connections of the other class was varied.  Average response time and throughput were measured.

Experimental configuration 2  Observed response times and throughputs

Model validation – one session class 1 Performance prediction with MVA algorithm  Model predicts the response time and the throughput acceptably

Model validation - one session class 2  Utilization o presentation tier is the first that becomes congested o database queue is the second (29%) o business logic queue is the last one (17%)

Model validation - one session class 3 Performance prediction with balanced job bounds  Model predicts the response time and the throughput acceptably

Model validation - one session class 4  Utilization o presentation tier is the first that becomes congested o database queue is the second o business logic queue is the last one

Model validation – two session classes 1 Performance prediction with approximate MVA algorithm  Model predicts the response time and the throughput acceptably

Model validation – two session classes 2  Utilization o presentation tier is the first that becomes congested o database queue is the second (76%) o business logic queue is the last one (15%)

Model validation – two session classes 3 Performance prediction with balanced job bounds  Model predicts the response time and the throughput acceptably

Model validation – two session classes 4  Utilization o presentation tier is the first that becomes congested o database queue is the second o business logic queue is the last one

Conclusions and future work 1 Model parameters have been estimated from one measurement MVA, approximate MVA evaluation algorithm and calculation of balanced job bounds have been implemented with the help of MATLAB Measurement process was executed in order to experimentally validate the models

Conclusions and future work 2 Models predicts acceptably  response time  throughput  tier utilization Model must be enhanced to handle  limits of the four thread types in.NET thread pool  g lobal and application queue limit Model may be enhanced by other features

Thank you for your attention.