Abstract
In this paper we present a platform independent analysis of the dynamic profiles of the the Java Grande Forum benchmark suite. A useful platform independent metric for analysing eventual running time is to use a cost center design pattern to “charge” each bytecode to the appropriate method. This necessitates accessing an item in a hash table dictionary each time round the interpreter inner loop and incrementing a counter. The measurements from the experiment are significantly different for either static or dynamic method frequencies and show that for the Grande programs in the Java Grande Forum Benchmark suite 66% of the execution time, as measured by bytecode use, is spent in the top two methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Daly, J Horgan, J Power and J.T. Waldron, Platform Independent Dynamic Java Virtual Machine Analysis: the Java Grande Forum Benchmark Suite, Proceedings of Joint ACM Java Grande-ISCOPE (International Symposium on Computing in Object-oriented Parallel Environments) 2001 Conference, Stanford University, June 2–4, 2001
T.J. Wilkinson, KAFFE, A Virtual Machine to run Java Code, http://www.kaffe.org, URL last accessed on 20/10/2000
Bull M, Smith L, Westhead M, Henty D and Davey R. Benchmarking Java Grande Applications, Second International Conference and Exhibition on the Practical Application of Java, Manchester, UK, April 12-14, 2000.
J. Waldron, C. Daly, D. Gray and J. Horgan, Comparison of Factors Influencing Bytecode Usage in the Java Virtual Machine, Second International Conference and Exhibition on the Practical Application of Java, Manchester, UK, April 12-14, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Waldron, J., Gregg, D. (2001). Identification and Quantification of Hotspots in Java Grande Programs. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_80
Download citation
DOI: https://doi.org/10.1007/3-540-48228-8_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42293-8
Online ISBN: 978-3-540-48228-4
eBook Packages: Springer Book Archive