An Empirical Study of the Scalability of Performance Analysis Tools in the Cloud

Calculation of performance metrics such as steadystate probabilities and response time distributions in large Markov and semi-Markov models can be accomplished using parallel implementations of well-known numerical techniques. In the past these implementations have usually been run on dedicated computational clusters and networks of workstations, but the recent rise of cloud computing offers an alternative environment for executing such applications. It is important, however, to understand what effect moving to a cloud-based infrastructure will have on the performance of the analysis tools themselves. In this paper we investigate he scalability of two existing parallel performance analysistools (one based on Laplace transform inversion and the other on uniformisation) on Amazon’s Elastic Compute Cloud, and compare this with their performance on traditional dedicated hardware. This provides insight into whether such tools can be used effectively in a cloud environment, and suggests factors which must be borne in mind when designing nextgeneration performance tools specifically for the cloud. Keywords-Cloud computing; Performance analysis; Parallel computing; Empirical study;

[1]  Jeremy T. Bradley,et al.  Passage-time computation and aggregation strategies for large semi-Markov processes , 2011, Perform. Evaluation.

[2]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[3]  Ümit V. Çatalyürek,et al.  Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication , 1999, IEEE Trans. Parallel Distributed Syst..

[4]  Micha Yadin,et al.  Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes , 1984, Oper. Res..

[5]  Peter G. Harrison,et al.  HYDRA: HYpergraph-Based Distributed Response-Time Analyzer , 2003, PDPTA.

[6]  Ward Whitt,et al.  An Introduction to Numerical Transform Inversion and Its Application to Probability Models , 2000 .

[7]  Erol Gelenbe G-Networks with Signals and Batch Removal , 1993 .

[8]  Soung Chang Liew,et al.  TCP Veno: TCP enhancement for transmission over wireless access networks , 2003, IEEE J. Sel. Areas Commun..

[9]  Andrew S. Miner,et al.  Computing response time distributions using stochastic Petri nets and matrix diagrams , 2003, 10th International Workshop on Petri Nets and Performance Models, 2003. Proceedings..

[10]  Peter G. Harrison,et al.  Passage time distributions in large Markov chains , 2002, SIGMETRICS '02.

[11]  Deying Li,et al.  QoS topology control in ad hoc wireless networks , 2004, IEEE INFOCOM 2004.

[12]  Their Block Gauss-Seidel Distributed Disk-based Solution Techniques for Large Markov Models , 2011 .

[13]  Erol Gelenbe,et al.  Power-aware ad hoc cognitive packet networks , 2004, Ad Hoc Networks.

[14]  Mario Marchese,et al.  High performance TCP / IP networking - concepts, issues, and solutions , 2004 .

[15]  William Aiello,et al.  Sparse Matrix Computations on Parallel Processor Arrays , 1993, SIAM J. Sci. Comput..

[16]  W. Knottenbelt,et al.  Hypergraph-based parallel computation of passage time densities in large semi-Markov models , 2004 .

[17]  Peter G. Harrison,et al.  Response time densities in generalised stochastic petri net models , 2002, WOSP '02.

[18]  Erol Gelenbe,et al.  Flow equivalence and stochastic equivalence in G-networks , 2004, Comput. Manag. Sci..

[19]  M. Benzi,et al.  A parallel solver for large-scale Markov chains , 2002 .

[20]  Kishor S. Trivedi,et al.  A Decomposition Approach for Stochastic Reward Net Models , 1993, Perform. Evaluation.

[21]  Erol Gelenbe,et al.  G-networks with multiple classes of signals and positive customers , 1998, Eur. J. Oper. Res..

[22]  William J. Knottenbelt,et al.  Generalised Markovian analysis of timed transition systems , 1996 .

[23]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[24]  Richard G. Baraniuk,et al.  TCP-Africa: an adaptive and fair rapid increase rule for scalable TCP , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[25]  Ren Wang,et al.  TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks , 2002, Wirel. Networks.

[26]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[27]  Andrea Baiocchi,et al.  YeAH-TCP: Yet Another Highspeed TCP , 2006 .

[28]  R. Srikant,et al.  TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks , 2006, valuetools '06.

[29]  Erol Gelenbe,et al.  G-Networks with Multiple Classes of Negative and Positive Customers , 1996, Theor. Comput. Sci..

[30]  Ward Whitt,et al.  On the Laguerre Method for Numerically Inverting Laplace Transforms , 1996, INFORMS J. Comput..

[31]  William H. Sanders,et al.  An Efficient Disk-Based Tool for Solving Large Markov Models , 1998, Perform. Evaluation.

[32]  Kishor S. Trivedi,et al.  Numerical Transient Solution of Finite Markovian Queueing Systems , 1992 .

[33]  William John Knottenbelt,et al.  Parallel performance analysis of large Markov models , 1999 .

[34]  Peter G. Harrison,et al.  Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models , 2004, J. Parallel Distributed Comput..

[35]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM '02.

[36]  Azzedine Boukerche,et al.  A Performance Evaluation of a Novel Energy-Aware Data-Centric Routing Algorithm in Wireless Sensor Networks , 2005, Wirel. Networks.

[37]  Randy H. Katz,et al.  A trace-based approach for modeling wireless channel behavior , 1996, Winter Simulation Conference.

[38]  Deborah Estrin,et al.  Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks , 2000 .

[39]  L. Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM.