Performance Analysis of Java Using Petri Nets

Authors:
Omer F. Rana;Matthew S. Shields
Affiliations:
-;-
Venue:
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Year:
2000

Citing 6
Cited 0

Petri nets for modeling of dynamic systems—a survey

Automatica (Journal of IFAC)
A type system for Java bytecode subroutines

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Javalight is type-safe—definitely

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for object initialization in the Java bytecode language

Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Analysis and development of Java Grande benchmarks

JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
A methodology for benchmarking Java Grande applications

JAVA '99 Proceedings of the ACM 1999 conference on Java Grande

Quantified Score

Hi-index	0.00

Visualization

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.