1992 Fiscal Year Final Research Report Summary
Research and Development of an Automatic Vectorizing/Parallelizing Compiler
| Project/Area Number |
02558004
|
|---|
| Research Category |
Grant-in-Aid for Developmental Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Informatics
|
|---|
| Research Institution | KYOTO UNIVERSITY |
|---|
Principal Investigator |
TSUDA Takao Kyoto Univ.,Facult. of ENG., Professor, 工学部, 教授 (60025905)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
NAKAYA Itsuko Kyoto Univ., Facult. of Eng., Assistant, 工学部, 教務職員 (40115902)
OKABE Yasuo Kyoto Univ., Facult. of Eng., Instructor, 工学部, 助手 (20204018)
KUNIEDA Yoshitoshi Kyoto Univ., Facult. of ENG., Assoc.Prof., 工学部, 助教授 (90153311)
|
|---|
| Project Period (FY) |
1990 – 1992
|
| Keywords | Vectorization / Parallelization / Compiler / Dependence analyses / Debugger / Virtual parallel processor / Dependence graphs / Synchronization |
|---|
| Research Abstract |
This research was performed for 3 years starting from 1990. As planned in the proposal, an automatic vectorizing/parallelizing compiler, as well as a simulator of a virtual parallel vector processor, was designed and implemented. As the platform this work, the previously developed automatic vectorizing compiler V-Pascal was used. The research activities can be itemized as : -
1. New degign and implementation of automated vectorization and parallelization functions ;
2. Design and implementation of an efficient stacking / synchronizing mechanism for the virtual parallel vector processor simulator ;
3. Revision of object-code generation modules ;
4. Implementation of the virtual parallel vector processor simulator ;
5. Revision of BV-Pascal for parallelization ;
6. System-wide performance evaluation.
The main features of the new compiler are : it can perform dependence analyses in a way much more precise than any other commercial compilers ; dependence relations are obtained over the whole objective program to parallelize code fragments of various grain sizes ; allowing for hierarchical representation between potential parallel tasks ; these parallel tasks are split or merged with ease using the estimates of execution time cost of each task and thus automatically generating optimal parallel tasks. These schemes were tested and verified on the Titan computer purchased for this project.
|
