新型超字级并行改进算法

对于超字级并行（SLP）算法不能有效地处理大型程序中并行代码率较小，且可向量化的代码中可能存在对向量化不利的代码的问题，提出了一种新型的SLP改进算法NSLPO。首先，将程序中不能向量化的非同构语句进行同构化处理，定位SLP丢失的向量化机会；然后，通过冗余节点添加构建最大通用子图，通过冗余删除等优化过程得到同构化之后的补充SLP图，提高程序中代码的并行性；最后，运用节流法将对向量化有害的代码摒除在向量化之外，仅对它们进行标量处理，通过只向量化处理那些向量化有收益的代码以尽可能地提升程序效率。在一组广泛使用的内核测试集中进行实验，结果显示，与SLP算法相比，NSLPO算法性能更优，其执行时间比SLP平均减少9.1%。

New improved algorithm for superword level parallelism

For SLP (Superword Level Parallelism) algorithm cannot effectively process the large-scale applications covered with few parallel codes, and the codes which can be vectorized may be adverse to vectorization. A new improved algorithm for SLP was proposed, namely NSLPO. First of all, the non-isomorphic statements which cannot be vectorized were transformed to isomorphic statements as far as possible, thus locating the opportunities of vectorization which SLP has lost. Secondly, the Max Common Subgraph (MCS) was built by adding redundant nodes, and the supplement diagram of SLP was got by using some optimization such as redundancy deleting, which can greatly increase the parallelism of program. At last, the codes which are harmful to vectorization were exclued out of vectorization by using cutting method and executed in serial, only the valuable codes for vectorization were vectorized to improve the efficiency of programs as far as possible. Experiments were conducted on widely used kernel test sets. The experimental results show that compared with the SLP algorithm, the proposed NSLPO algorithm has better performance and its running time was reduced by 9.1%.