INTERVAL ARITHMETIC FOR COMPUTING PERFORMANCE GUARANTEES IN CLIENT-SERVER SOFTWARE

Performance analysis of client-server software systems through bounds on task throughputs is presented. The upper and lower bounds (performance guarantee) are both independent of any assumptions about the stochastic behavior of the client tasks, and make only weak assumptions on the server. The analytic expressions for the bounds however, are not in closed form. A new technique based on interval arithmetic is developed to compute numerical values for the bounds.