Record Details

A computational complexity-aware model for performance analysis of software servers

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A computational complexity-aware model for performance analysis of software servers
 
Creator MATHUR, VIPUL
APTE, VARSHA
 
Subject computational complexity
queueing theory
software tools
file servers
 
Description Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs may depend on the total number of active sessions in the server. In this paper, we present a queueing model that explicitly takes into account the time, taken by algorithms in the server, that varies with the user population. The model analytically predicts the response time and the "saturation number" of such systems. We validate our model with simulation and further demonstrate its usefulness by suggesting a heuristic technique to "discover" the complexity of algorithms in server software, solely from response time measurement. We applied the discovery technique to a Web-server test-bed, and found that we can identify the asymptotic behavior of processing time as a function of the user population with a fair amount of accuracy. The results show that this promises to be one of the many "black-box analysis" techniques, often found necessary in the real world.
 
Publisher IEEE
 
Date 2009-09-19T07:14:47Z
2011-11-28T08:51:33Z
2011-12-15T09:57:49Z
2009-09-19T07:14:47Z
2011-11-28T08:51:33Z
2011-12-15T09:57:49Z
2004
 
Type Article
 
Identifier Proceedings of the IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, Volendam, The Netherlands, 4-8 October 2004, 537-544
0-7695-2251-3
10.1109/MASCOT.2004.1348310
http://hdl.handle.net/10054/1646
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1646
 
Language en