Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Search strategies for Java bottleneck location by dynamic instrumentation

Search strategies for Java bottleneck location by dynamic instrumentation

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Software — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The authors have developed a prototype tool that supports instrumentation of distributed Java applications by on-the-fly deployment of interposition code at user-selectable program points. The paper explores the idea, originated in the Paradyn Performance Consultant, of systematically searching for performance bottlenecks by progressive refinement. They present the callgraph search algorithm in detail, and discuss a number of shortcomings with the approach, some of which can be addressed by improving the search strategy. They support their conclusions with two application examples. This is a report of work in progress, aimed at stimulating further investigation of this interesting approach.

References

    1. 1)
      • Yeung, K.C., and Kelly, P.H.J.: ‘Optimising Java RMI programs by communication restructuring’, in D. Schmidt and M. Endler, (Eds): ‘Middleware 2003 - Rio de Janeiro, Brazil’, Lect. Notes Comput. Sci., 2672, pp. 324–343, 2003.
    2. 2)
      • Hollingsworth, J.K., Miller, B.P., Cargille, J.: `Dynamic program instrumentation for scalable performance tools', Scalable high-performance computing Conf, Knoxville, Tennessee., May 1994.
    3. 3)
      • Pazandak, P., and Wells, D.: ‘ProbeMeister: distributed runtime software instrumentation’. Presented at 1st Int. Workshop on Unanticipated software evolution (USE2002), Malaga, Spain, June 2002. http: //www.joint.org/use2002/sub/pazandak-ProbeMeister.pdf.
    4. 4)
      • Liang, S., Viswanathan, D.: `Comprehensive profiling support in the Java Virtual Machine', Proc. 5th USENIX Conference on Object-oriented technologies and systems (COOTS), San Diego, CA, May 1999, p. 229–240.
    5. 5)
      • V. Bala , E. Duesterwald , S. Banerjia . Dynamo: a transparent dynamic optimization system. ACM SIGPLAN Not. , 5 , 1 - 12
    6. 6)
      • G. Kiczales , E. Hilsdale , J. Hugunin . An overview of Aspect J.. Lect. Notes Comput. Sci. , 327 - 355
    7. 7)
      • Standard Performance Evaluation Corporation (SPEC) JVM98 Suite, 1998. Available from http://www.spec.org.
    8. 8)
      • Taivalsaari, A.: `Implementing a Java virtual machine in the Java programming language', TR-98-64, Technical Report, 1998, Sun Microsystemshttp://research.sun.com/techrep/1998/abstract-64.html.
    9. 9)
    10. 10)
      • Bruening, D., Duesterwald, E., and Amarasinghe, S.: ‘Design and implementation at of a dynamic optimization framework for windows’. Presented at 4th ACM Workshop on Feedback-directed and dynamic optimization (FDDO-4), December 2001.
    11. 11)
      • Roth, P.C., and Miller, B.P.: ‘Deep start: a hybrid strategy for automated performance problem searches’, in Burkhard Monien and Rainer Feldmann, (Eds): ‘Euro-Par 2002 - Paderborn, Germany’, Lect. Notes Comput. Sci., 2002, 2400, pp. 86–96.
    12. 12)
      • Cain, H., Wylie, B., and Miller, B.P.: ‘A callgraph based search strategy for automated performance diagnosis’, in Arndt Bode et al., (Ed.): ‘Euro-Par 2000 - Munich’, Lect. Notes Comput. Sci., 2000, 1900, pp. 108–122.
    13. 13)
      • Vallée-Rai, R., Gagnon, E., Hendren, L.J., et al. ‘Optimizing Java bytecode using the Soot framework: Is it feasible?’, in David A. Watt (Ed.): ‘Compiler Construction (CC2000), Berlin, Germany’, Lect. Notes Comput. Sci., 2000, 1781 18–34.
    14. 14)
      • K. Yeung , P.H.J. Kelly , S. Bennett , V. Getov . (2003) Dynamic instrumentation for Java using a virtual JVM, Performance analysis and grid computing.
    15. 15)
      • Dmitriev, M.: ‘Application of the HotSwap technology to advanced profiling’. Presented at 1st Int. Workshop on Unanticipated software evolution (USE), Malaga, Spain, June 2002. http://www.joint.org/use2002/sub/dmitriev-hotswapprof.pdf.
    16. 16)
      • B. Buck , J.K. Hollingsworth . An API for runtime code patching. Int. J. High Perform. Comput. Appl. , 4 , 317 - 329
    17. 17)
      • Popovici, A., Gross, T., Alonso, G.: `Dynamic weaving for aspect oriented programming', 1st Int. Conf. on Aspect-oriented software development (AOSD), Enschede, The Netherlands, 22–26 April 2002.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-sen_20030807
Loading

Related content

content/journals/10.1049/ip-sen_20030807
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address