This paper presents a quick single-step performance bounding technique for parallel computer and storage systems

Chang Zhang

Elizabeth Varki

Larry Dowdy

This paper presents a quick single-step performance bounding technique for parallel computer and storage systems. The computation of these bounds is so simple that it can even be performed by hand. The bounding technique develops balanced job bounds and asymptotic bounds for parallel systems. These bounds are the parallel system counterparts to previously developed bounds for serial product-form systems. The contribution of this paper is showing how these simple bounds for serial networks can be applied to parallel networks. The performance technique is potentially useful in the early phases of design projects or capacity planning studies when several candidate configurations have to be evaluated quickly. Index Terms: performance evaluation, parallel computer and storage systems, fork-join networks, queueing systems, performance bounds

CiteSeerX

Quick Performance Bounds for Computer and Storage Systems with Parallel Resources

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.4105

Quick Performance Bounds for Computer and Storage Systems with Parallel Resources

Abstract

Similar works

Full text

Available Versions

CiteSeerX