Effective sign extension elimination for java

Kawahito, Motohiro; Komatsu, Hideaki; Nakatani, Toshio

doi:10.1145/1111596.1111599

Cited by 2 publications

(1 citation statement)

References 14 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To remove unnecessary sign/zero extension operations, compilers simply collapse operands in an expression tree, or apply advanced analysis [6,12] to verify actual operand size.…”

Section: Detecting Redundant Sign/zero Extension Patternmentioning

confidence: 99%

A dynamic tool for finding redundant computations in native code

Lee

Benaissa

Rodríguez

2008

Proceedings of the 2008 International Workshop on Dynamic Analysis: Held in Conjunction With the ACM SIGSOFT International Symp

View full text Add to dashboard Cite

Compilers perform optimizations to improve application runtime performance, but they often fail to generate optimal code due to complicated interactions between optimizations and unforeseen interactions of optimizations with the target architecture. Although there exist performance monitoring tools that can collect CPU performance information via hardware event counters, compiler developers or performance analysts need to comprehensively interpret the information to infer deficiencies in compiler optimizations. This paper presents a tool that can identify potentially redundant computations relevant to specific compiler optimizations. In particular, our current implementation can identify redundant computations that match three patterns occurring in compiler generated native code: 1. redundant sign/zero extension, 2. redundant constant-spill, and 3. missing copy/constant propagation. Our tool adapts the Pin dynamic instrumentation framework to analyze program execution contexts at runtime and identify the redundant computations described above. We use this tool to report both locations and execution frequencies of redundant computations within the SPEC R CPU2006 benchmarks generated by two GCC compiler versions targeting IA-32 and Intel R 64 architectures. By effectively removing instrumentation that has become unnecessary, our tools runs at 19x the average execution time of these benchmarks. From this study, we are able to address how redundant computations are affected by different architectural features such as a number of registers and memory address size, and different compiler versions.

show abstract

“…To remove unnecessary sign/zero extension operations, compilers simply collapse operands in an expression tree, or apply advanced analysis [6,12] to verify actual operand size.…”

Section: Detecting Redundant Sign/zero Extension Patternmentioning

confidence: 99%

A dynamic tool for finding redundant computations in native code

Lee

Benaissa

Rodríguez

2008

Proceedings of the 2008 International Workshop on Dynamic Analysis: Held in Conjunction With the ACM SIGSOFT International Symp

View full text Add to dashboard Cite

show abstract

New Approach to the Reduction of Sign-Extension Overhead for Efficient Implementation of Multiple Constant Multiplications

Lou

Meher

2015

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

Sign-extension of operands in the shift-add network of multiple constant multiplication (MCM) results in a significant overhead in terms of hardware complexity as well as computation time. This paper presents an efficient approach to minimize that overhead. In the proposed method, the shift-add network of an MCM block is partitioned into three types of sub-networks based on the types of fundamentals and interconnections they involve. For each type of sub-network, a scheme which takes the best advantage of the redundancy in the computation of sign-extension part is proposed to minimize the overhead. Moreover, we also propose a technique to avoid the additions pertaining to the most significant bits (MSBs) of the fundamentals. Experimental results show that the proposed method always leads to implementations of MCM blocks with the lowest critical path delay. The existing methods for the minimization of sign-extension overhead are designed particularly for single multiplication or MCM blocks of FIR filter, but the proposed method can be used to reduce the overhead of sign-extension for MCM blocks of any application. In the case of FIR filters, the proposed method outperforms other competing methods in terms of critical path delay, area-delay product (ADP), and power-delay product (PDP), as well.Index Terms-Critical path, high-speed, low complexity, multiple constant multiplication (MCM), sign extension. 1549-8328

show abstract

Effective sign extension elimination for java

Cited by 2 publications

References 14 publications

A dynamic tool for finding redundant computations in native code

A dynamic tool for finding redundant computations in native code

New Approach to the Reduction of Sign-Extension Overhead for Efficient Implementation of Multiple Constant Multiplications

Contact Info

Product

Resources

About