发明名称 Optimal floating-point expression translation method based on pattern matching
摘要 Embodiments of the present invention include code generation methods. In one embodiment, a table of patterns is generated. Each pattern in the table includes an FMA (fused multiply-add) DAG (Directed Acyclic Graph), a canonical form equivalent of the FMA DAG, and a shape corresponding to the canonical form equivalent. Incoming floating-point expressions are matched against the patterns in the table during compilation of a program to obtain optical sequences of FMA, FMS (fused multiply-subtract), and FNMA (fused negate multiply-add) instructions as compiled instructions for computing the floating point expressions.
申请公布号 US7966609(B2) 申请公布日期 2011.06.21
申请号 US20060587093 申请日期 2006.03.30
申请人 INTEL CORPORATION 发明人 SEREBRYANY KONSTANTIN S.
分类号 G06F9/45;G06F7/38 主分类号 G06F9/45
代理机构 代理人
主权项
地址