Thumbnail
Access Restriction
Subscribed

Author Sevitsky, Gary ♦ Rountev, Atanas ♦ Schonberg, Edith ♦ Arnold, Matthew ♦ Xu, Guoqing ♦ Mitchell, Nick
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Abstract dynamic thin slicing ♦ Cost benefit analysis ♦ Memory bloat
Abstract Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these missed optimization opportunities lie computations that, with great expense, produce data values that have little impact on the program's final output. Constructing a new date formatter to format every date, or populating a large set full of expensively constructed structures only to check its size: these involve costs that are out of line with the benefits gained. This disparity between the formation costs and accrued benefits of data structures is at the heart of much runtime bloat. We introduce a run-time analysis to discover these low-utility data structures. The analysis employs dynamic thin slicing, which naturally associates costs with value flows rather than raw data flows. It constructs a model of the incremental, hop-to-hop, costs and benefits of each data structure. The analysis then identifies suspicious structures based on imbalances of its incremental costs and benefits. To decrease the memory requirements of slicing, we introduce abstract dynamic thin slicing, which performs thin slicing over bounded abstract domains. We have modified the IBM J9 commercial JVM to implement this approach. We demonstrate two client analyses: one that finds objects that are expensive to construct but are not necessary for the forward execution, and second that pinpoints ultimately-dead values. We have successfully applied them to large-scale and long-running Java applications. We show that these analyses are effective at detecting operations that have unbalanced costs and benefits.
Description Affiliation: Ohio State University, Columbus, OH, USA (Xu, Guoqing; Rountev, Atanas) || IBM T. J. Watson Research Center, Hawthorne, NY, USA (Mitchell, Nick; Arnold, Matthew; Schonberg, Edith; Sevitsky, Gary)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 45
Issue Number 6
Page Count 13
Starting Page 174
Ending Page 186


Open content in new tab

   Open content in new tab
Source: ACM Digital Library