Statistical performance critical path analysis for service-oriented systems

ABSTRACT

In order to be efficient in service-oriented environments, performance management efforts must be focused on those services that are critical from an end-to-end perspective. This paper overviews a flexible approach to identifying these services and quantifying their criticality, via a statistical extension to the classic critical path algorithm for DAGs. The solution is preliminarily illustrated in a service-oriented Grid.

REFERENCES

• 1: Ei Ando , Masafumi Yamashita , Toshio Nakata , Yusuke Matsunaga, The statistical longest path problem and its application to delay analysis of logical circuits, Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems, December 02-03, 2002, Monterey, California, USA [doi>10.1145/589411.589440]
• 2: Paul Barford , Mark Crovella, Critical path analysis of TCP transactions, ACM SIGCOMM Computer Communication Review, v.31 n.2 supplement, April 2001 [doi>10.1145/844193.844200]
• 3: J. Brady, D. Gavaghan, A. Simpson, M. Mulet-Parada, and R. Highnam. eDiaMoND: A grid-enabled federated database of annotated mammograms. In Grid Computing: Making the Global Infrastructure a Reality, pages 923--943. Wiley, 2003.
• 4: E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, USA, 1976.
• 5: C. Yang and B. Miller. Critical path analysis for the execution of parallel and distributed programs. In Proceedings of 8th International Conference on Distributed Computing Systems, pages 366--373, San Jose, CA, USA, 1988.

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
        D.2.11 Software Architectures
            Subjects: Domain-specific architectures

Additional Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Statistical computing

General Terms:
Design