Development of an Automatic Vectorizing Intelligent Compiler

点击翻译按钮获取中文摘要

In this fiscal year, everything went according to the plan of the submitted written application. To be more concrete, these steps was carried out: 1. Coding, testing and debugging of the control dependence module, 2. Coding, testing and debugging of the data dependence module, 3. Coding, testing and debugging of the partial vectorization decision module, 4. Coding, testing and debugging of the vector intermediate code generation module, 5. Testing and debugging through all modules, 6. Performance evaluation of generated object codes. In the above control dependence module, a new algorithm has been implemented, which had been published (see the reference). This algorithm can analyze any nested loops including any complicated control structures, for example, multi-entry loops, loops with exits, etc..A new algorithm for data dependence analysis, has been also developed. This algorithm is made by improving and combining our old two methods of the same purpose. It automatically selects the fittest one of the two methods for target nested loops, if necessary, using heuristics.The partial vectorization modules can newly vectorize string manipulations and relational operations. This attempt may be said to be the first step to open up a new vista for vector supercomputers. Moreover, this compiler has also more powerful feature of detecting and generating vector macro operations.