1999 Fiscal Year Final Research Report Summary
Research for a tuning supporting system for parallelization using informations over a network
Project/Area Number |
09680340
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
計算機科学
|
Research Institution | Wakayama University |
Principal Investigator |
KUNIEDA Yoshitoshi Wakayama University, Faculty of Systems Engineering, Professor, システム工学部, 教授 (90153311)
|
Co-Investigator(Kenkyū-buntansha) |
SASAKURA Mariko Okayama University, Faculty of Engineering, Research Associate, 工学部, 助手 (30284087)
UEHARA Tetsutaro Wakayama University, Center for Information Science, Assistant Professor, システム情報学センター, 講師 (20273485)
JOE Kazuki Nara Women's Univ., Faculty of Science, Professor, 理学部, 教授 (90283928)
SAITO Shoichi Wakayama University, Faculty of Systems Engineering, Research Associate, システム工学部, 助手 (70304186)
|
Project Period (FY) |
1997 – 1999
|
Keywords | parallelization / optimization / compiler / vectorization / dependence analysis / parallelizing / task graph / granularity |
Research Abstract |
In the '97 financial year, we investigated several application programs, such as QCD (quantum color dynamics), quantum chemical (molecular orbit), CFD (Numerical Fluid dynamics), Oil reservoir, seismic wave analysis, etc. and found that there is too few fields for the users to parallelize their own application programs by themselves. This fact is an empirical proof of the potential huge needs for automatic parallelization. Therefore from this year, we set to design a subsystem which can analyze a given source program and display three-dimensionally the behaviors of the given program according to the data referencing relationship. In the'98 financial year, we designed and implemented each module of this system. And we improved the functionality and user interface of this system. Namely the improved system can show the program structure, data dependence relationships and the corresponding source program fragment in such a way that these three viewing functions are combined and built up a closer connection. The users can easily and arbitrarily move to and choose any part of their program to investigate for parallelization on tuning up. In the '99 financial year, the last year of this research project, we continued the work and could propose a UIR (universal intermediate representation) for automatic parallelizing compilers. Moreover, we designed the algorithm for visualing function for UIR and implemented it in our prototype system. Now our visualization system show some hints to partition the data of the given program which is recognized as one of the most difficult and important problems on parallelization.
|
Research Products
(20 results)