| Project/Area Number |
07680354
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | HIROSHIMA CITY UNIVERSITY (1996)
Kyoto University (1995) |
|---|
Principal Investigator |
TSUDA Takao HIROSHIMA CITY UNIVERSITY,FACULTY OF INFORMATION SCIENCES,PROFESSOR, 情報科学部, 教授 (60025905)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KAWABATA Hideyuki HIROSHIMA CITY UNIVERSITY,FACULTY OF INFORMATION SCIENCES,RESEARCH ASSOCIATE, 情報科学部, 助手 (00264937)
KUNIEDA Yoshitoshi WAKAYAMA UNIVERSITY,DEPARTMENT OF SYSTEMS ENGINEERING,PROFESSOR, システム工学部, 教授 (90153311)
岡部 寿男 京都大学, 大型計算機センター, 助教授 (20204018)
|
|---|
| Project Period (FY) |
1995 – 1996
|
| Project Status |
Completed (Fiscal Year 1996)
|
| Budget Amount *help |
¥2,500,000 (Direct Cost: ¥2,500,000)
Fiscal Year 1996: ¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 1995: ¥1,000,000 (Direct Cost: ¥1,000,000)
|
|---|
| Keywords | OPTIMIZATION / COMPILER / VECTORIZATION / PARALLELIZATION / GRANULAITY / DEPENDENCE ANALYSIS / ALIAS ANALYSIS / TASK GRAPH |
|---|
| Research Abstract |
On top of the vectorizing compiler V-Pascal that had been developed by the Tsuda laboratory of Kyoto University over ten years, automatic parallelizing functions were added, together with various features. (1) Powerful ability to detect parallelism, (2) facility to find optimal grain sizes, (3) enhancing the locality of data references by means of data partitioning and loop transformation, and (3) minimizing machine-dependences in automatic parallelization by abstraction of parallel architectures are the main difficulties that remain to be resolved. In this project, new algorithms were developed for alias analyzes to have more precision in the analysis of dependeces due to pointer references. Alias analyzes in the presence of pointer variables that point to memory area that has been assigned by heap are especially difficult, but the result of this project gives an important clue to the problem. This partially answers the question (1) above. Concerning the question (2), a special view mechanism has been considered so that the results of dependence analyzes can be displayd at an arbitrary hierarchical level, namely, either coarse-grain level or fine-grain level. This makes it easier to check on, and choose, optimal parallelization.
|
