Subsuming methods: finding new optimisation opportunities in object-oriented software

Maplesden, David, Tempero, Ewan, Hosking, John and Grundy, John C. 2015, Subsuming methods: finding new optimisation opportunities in object-oriented software, in ICPE 2015 : Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering, ACM Digital Library, [Austin, Tex.], pp. 175-186, doi: 10.1145/2668930.2688040.

Attached Files
Name Description MIMEType Size Downloads

Title Subsuming methods: finding new optimisation opportunities in object-oriented software
Author(s) Maplesden, David
Tempero, Ewan
Hosking, John
Grundy, John C.ORCID iD for Grundy, John C. orcid.org/0000-0003-4928-7076
Conference name Performance Engineering. Conference (6th : 2015 : Austin, Texas)
Conference location Austin, Texas
Conference dates 31 Jan. - 4 Feb. 2015
Title of proceedings ICPE 2015 : Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering
Editor(s) [Unknown]
Publication date 2015
Start page 175
End page 186
Total pages 12
Publisher ACM Digital Library
Place of publication [Austin, Tex.]
Summary The majority of existing application profiling techniques ag- gregate and report performance costs by method or call- ing context. Modern large-scale object-oriented applications consist of thousands of methods with complex calling pat- terns. Consequently, when profiled, their performance costs tend to be thinly distributed across many thousands of loca- tions with few easily identifiable optimisation opportunities. However experienced performance engineers know that there are repeated patterns of method calls in the execution of an application that are induced by the libraries, design patterns and coding idioms used in the software. Automati- cally identifying and aggregating costs over these patterns of method calls allows us to identify opportunities to improve performance based on optimising these patterns. We have developed an analysis technique that is able to identify the entry point methods, which we call subsuming methods, of such patterns. Our ofiine analysis runs over previously collected runtime performance data structured in a calling context tree, such as produced by a large number of existing commercial and open source profilers. We have evaluated our approach on the DaCapo bench- mark suite, showing that our analysis significantly reduces the size and complexity of the runtime performance data set, facilitating its comprehension and interpretation. We also demonstrate, with a collection of case studies, that our analysis identifies new optimisation opportunities that can lead to significant performance improvements (from 20% to over 50% improvement in our case studies).
ISBN 9781450332484
Language eng
DOI 10.1145/2668930.2688040
Field of Research 080309 Software Engineering
Socio Economic Objective 890201 Application Software Packages (excl. Computer Games)
HERDC Research category E1.1 Full written paper - refereed
ERA Research output type E Conference publication
Copyright notice ©2015, ACM Digital Library
Persistent URL http://hdl.handle.net/10536/DRO/DU:30081714

Document type: Conference Paper
Collections: School of Information Technology
2018 ERA Submission
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 7 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 142 Abstract Views, 5 File Downloads  -  Detailed Statistics
Created: Thu, 25 Feb 2016, 09:52:30 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.