发明名称 AN OPTIMAL FLOATING-POINT EXPRESSION TRANSLATION METHOD BASED ON PATTERN MATCHING
摘要 <p>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.</p>
申请公布号 WO2007114722(A1) 申请公布日期 2007.10.11
申请号 WO2006RU00152 申请日期 2006.03.30
申请人 INTEL CORPORATION;SEREBRYANY, KONSTANTIN SERGEYEVICH 发明人 SEREBRYANY, KONSTANTIN SERGEYEVICH
分类号 G06F9/45 主分类号 G06F9/45
代理机构 代理人
主权项
地址
您可能感兴趣的专利