Subscribe

Issue No.06 - June (2008 vol.57)

pp: 780-794

Giuliano Casale , College of William and Mary

Richard Muntz , UCLA

Giuseppe Serazzi , Politecnico di Milano

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.37

ABSTRACT

We propose the Geometric Bounds (GB), a new family of fast and accurate non-iterative bounds on closed queueing network performance metrics that can be used in the on-line optimization of distributed applications. Compared to state-of-the-art techniques such as the Balanced Job Bounds (BJB), the GB achieve higher accuracy at similar computational costs, limiting the worst-case bounding error typically within 5%-13% when for the BJB it is usually in the range 15%-35%. Optimization problems that are solved with the GB bounds return solutions that are much closer to the global optimum than with existing bounds. We also show that the GB technique generalizes as an accurate approximation to closed fork-join networks commonly used in disk, parallel and database models, thus extending the applicability of the method beyond the optimization of basic product-form networks.

INDEX TERMS

Performance of Systems, Queuing theory, Performance, Operating Systems, Software/Software Engineering, Modeling techniques, Performance of Systems, Computer Systems Organization

CITATION

Giuliano Casale, Richard Muntz, Giuseppe Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks",

*IEEE Transactions on Computers*, vol.57, no. 6, pp. 780-794, June 2008, doi:10.1109/TC.2008.37REFERENCES

- [1]
Proc. Fourth IEEE Int'l Conf. Autonomic Computing, 2007.- [2] K. Whisnant, Z. Kalbarczyk, and R.K. Iyer, “A System Model for Dynamically Reconfigurable Software,”
IBM Systems J., vol. 42, no. 1, pp. 45-59, 2003.- [3] C.A. Floudas,
Nonlinear and Mixed Integer Optimization. Oxford Univ. Press, 1995.- [4] M. Bennani and D.A. Menascè, “Resource Allocation for Autonomic Data Centers Using Analytic Performance,”
Proc. Second IEEE Int'l Conf. Autonomic Computing, 2005.- [11] R.R. Muntz and J.W. Wong, “Asymptotic Properties of Closed Queueing Network Models,”
Proc. Eighth Ann. Princeton Conf. Information Sciences and Systems, pp. 348-352, 1974.- [20] H. Kobayashi,
Modelling and Analysis: An Introduction to System Performance Evaluation Methodology. Addison-Wesley, 1978.- [21] M. Reiser and S.S. Lavenberg, “Mean-Value Analysis of Closed Multichain Queueing Networks,”
J. ACM, vol. 27, no. 2, pp. 312-322, 1980.- [22] G. Bolch, S. Greiner, H. de Meer, and K.S. Trivedi,
Queueing Networks and Markov Chains. John Wiley & Sons, 1998.- [24] M.M. Srinivasan, “Successively Improving Bounds on Performance Measures for Single Class Product Form Queueing Networks,”
IEEE Trans. Computers, vol. 36, no. 9, pp. 1107-1112, Sept. 1987.- [25] J.D.C. Little, “A Proof of the Queueing Formula $L = \lambda W$ ,”
Operations Research, vol. 9, pp. 383-387, 1961.- [28] A. Harel, S. Namn, and J. Sturm, “Simple Bounds for Closed Queueing Networks,”
Queueing Systems, vol. 47, no. 1, pp. 125-135, 1999.- [32] E. Varki and L.W. Dowdy,
Quick Performance Bounding Techniques for Computer and Storage Systems with Parallel Resources, in review, http://ietcom.oxfordjournals.org/cgi/content/ abstract/E88-B/3/1244http://citeseer.ist.psu.edu 669758.html, 2008.- [33] P.J. Schweitzer, “Approximate Analysis of Multiclass Closed Networks of Queues,”
Proc. Int'l Conf. Stochastic Control and Optimization, pp. 25-29, 1979.- [34] Y. Bard, “Some Extensions to Multiclass Queueing Network Analysis,”
Proc. Third Int'l Symp. Modelling and Performance Evaluation of Computer Systems, M. Arato, A. Butrimenko, and E.Gelenbe, eds., pp. 51-62, 1979.- [36] P. Bonami et al., “An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs,” IBM Research Report RC23771 (W0511-023), 2005.
- [37] R. Fourer, D.M. Gay, and B.W. Kernighan,
AMPL—A Modeling Language for Mathematical Programming. Scientific Press, 1993.- [38] Y. Chen, A. Das, W. Qin, A. Sivasubramaniam, Q. Wang, and N. Gautam, “Managing Server Energy and Operational Costs in Hosting Centers,”
Proc. ACM SIGMETRICS '05, pp. 303-314, 2005.- [40] S. Kounev and A.P. Buchmann, “Performance Modeling and Evaluation of Large-Scale J2EE Applications,”
Proc. 29th Int'l Computer Measurement Group Conf., pp. 273-283, 2003.- [41] M. Bertoli, G. Casale, and G. Serazzi, “Java Modelling Tools: An Open Source Suite for Queueing Network Modelling and Workload Analysis,”
Proc. Third Int'l Conf. Quantitative Evaluation of Systems, pp. 119-120, http:/jmt.sourceforge.net, 2006. |