Abstract
Understanding and improving Java performance is an important objective, for both application and tool developers. Current efforts towards developing benchmarks have played a crucial role towards this objective, particularly in identifying general trends that can be observed through such a study. An alternative mechanism for categorising Java performance is investigated here, based on developing a performance model of Java execution. The presented model is based on stochastic Petri nets and aimed at evaluation performance of method calls and class loading in Java programs. The primary objective of this paper is to use the Java profiler to determine distributions of execution time for method executions, and use this as a first step in analysing Java performance using stochastic Petri net models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
I. Attali, D. Caromel, and M. Russo. A Formal Executable Semantics for Java. Proceedings of the Workshop on Formal Underpinnings of Java, at OOPSLA98, Vancouver, Canada, October 1998.
R. Bastide. Approaches in unifying Petri nets and the Object-Oriented Approach. Proceedings of the 1st Workshop on Object-Oriented Programming and Models of Concurrency, at the 16th International Conference on Application and Theory of Petri nets, Turin, Italy, July 1995.
E. Battiston, F. De Cindio, and G. Mauri. Class Orientation and Inheritance in Modular Algebraic Nets. Proceedings of the International Conference on Systems, Man and Cybernetics, 1993.
P. Bertelsen. Java Byte Code Semantics, 1999. See web site at http://www.dina.kvl.dk/~pmb/.
O. Biberstein and D. Buchs. Structured Algebraic Nets with Object-Orientation. Proceedings of the 1st Workshop on Object-Oriented Programming and Models of Concurrency, at the 16th International Conference on Application and Theory of Petri nets, Turin, Italy, July 1995.
J. M. Bull, L. A. Smith, M. D. Westhead, D. S. Henty, and R. A. Davey. A Methodology for Benchmarking Java Grande Applications. Proceedings of the ACM Java Grande conference, San Francisco, USA, June 1999.
G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo. GreatSPN2.0. Dipartimento di Informatica, Università di Torino (Italy), 1997.
R. David and H. Alla. Petri nets for modeling of dynamic systems-a survey. Automatica (Elsevier Science Limited), 30(2):175–202, 1994.
S. Drossopoulou and S. Eisenbach. Java is Type Safe — Probably. Proceedings of ECOOP97, LNCS 1241, Springer Verlag, 1997.
S. Freund. The Costs and Benefits of Java Bytecode Subroutines. Proceedings of the Workshop on Formal Underpinnings of Java, at OOPSLA98, Vancouver, Canada, October 1998.
S. N. Freund and J. C. Mitchell. A Type System for Object Initialization in the Java Bytecode Language. Proceedings of the ACM Conference on Object Oriented Programming: Languages, Systems, and Applications, October 1998.
K. Hawick, P. Coddington, and J. Mathew. Java Grande Benchmarking, 1999. See web site at http://www.dhpc.adelaide.edu.au/projects/javagrande/benchmarks/.
T. Holvoet and P. Verbaeten. PN-TOX: a Paradigm and Development Environment for Object Concurrency Specifications. Proceedings of the 1st Workshop. on Object-Oriented Programming and Models of Concurrency, at the 16th International Conference on Application and Theory of Petri nets, Turin, Italy, July 1995.
C. A. Lakos and C. D. Keen. LOOPN — Language for Object Oriented Petri nets. Proceedings of the SCS Multiconference on Object-Oriented Simulation, 1991.
J. A. Mathew, P. D. Coddington, and K. A. Hawick. Analysis and Development of Java Grande Benchmarks. Proceedings of the ACM Java Grande conference, San Francisco, USA, June 1999.
T. Murata. Petri nets: Properties, analysis and applications. In Proceedings of the IEEE, April 1989.
T. Nipkow and D. Von Oheimb. Java Light is Type Safe — Definately. Proceedings of the 25th ACM Symposium on Principles of Programming Languages, 1998.
J. Posegga and H. Vogt. Java Bytecode Verification Using Model Checking. Proceedings of the Workshop on Formal Underpinnings of Java, at OOPSLA98, Vancouver, Canada, October 1998.
R. Stata and M. Abadi. A Type System for Java Bytecode Subroutines. Proceedings of the 25th ACM Symposium on Principles of Programming Languages, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rana, O.F., Shields, M.S. (2000). Performance Analysis of Java Using Petri Nets. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_81
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive