编译器前端乘幂运算的实现与优化

The Implementation and Optimization of Power Exponentiation in the Front End of Compiler

乘幂运算是最基本的数学表达式之一,并且被大多数编译器支持,在高性能计算和密码算法中应用十分频繁。为了实现和优化乘幂运算人们提出了许多算法,比如加法链算法。该文描述了在编译器前端一个具体的新的算法,它实现了乘幂运算并且进行了优化,优化方法结合了静态最优加法链算法和Window算法。这个新的算法已经应用于GNUFortran95编译器(Gfortran),并取得良好效果。

The power operator is one of the most important math expressions and is supported by most compilers.It is widely and frequently used in HPC and modern cryptography fields.Many algorithms are developed to implement and optimize the operator.This paper presents a new concrete process combined static optimal addition chain table method and Window method.The new algorithm introduced in the paper has been applied in the GNU Fortran 95 Compiler Project(Gfortran) and fully tested.