Identifying superword level parallelism with extended directed dependence graph reachability  

作　　者：Jie ZHAO Rongcai ZHAO 

机构地区：[1]National Digital Switching System Engineering & Technological Research Center, Zhengzhou 450001, China [2]Computer Science Department, Ecole Normale Supérieure, Paris 75005, France

出　　处：《Science China(Information Sciences)》2017年第1期210-212,共3页中国科学（信息科学）（英文版）

基　　金：supported by HEGAOJI Major Project of China (Grant No. 2009ZX01036-001-001-2);Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing (Grant No. 2013A11)

摘　　要：Dear editor, The increasing trend of multimedia applications＇ proliferation brings about multimedia extensions＇ wide use among existing microprocessors of mainstream manufacturers, e.g., Intel＇s MMX, AMD＇s 3DNow!, IBM＇s VMX/Altivec, etc. However, the implementation details behind these multimedia extensions vary from one architecture to another; hence, it generally comes in form of SIMD （single instruction multiple data） instructions, providing a mechanism to accelerate the performance of var- ious application programs.Dear editor, The increasing trend of multimedia applications＇ proliferation brings about multimedia extensions＇ wide use among existing microprocessors of mainstream manufacturers, e.g., Intel＇s MMX, AMD＇s 3DNow!, IBM＇s VMX/Altivec, etc. However, the implementation details behind these multimedia extensions vary from one architecture to another; hence, it generally comes in form of SIMD （single instruction multiple data） instructions, providing a mechanism to accelerate the performance of var- ious application programs.

关 键 词：node SIMD Identifying superword level parallelism with extended directed dependence graph reachability SLP 

分 类 号：TP314[自动化与计算机技术—计算机软件与理论]