2001 Fiscal Year Final Research Report Summary
Study on parallelizing compiters with a granularity tuning mechanism
| Project/Area Number |
10480057
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | The University of Electro-Communications |
|---|
Principal Investigator |
YUBA Toshitsugu Graduate School of Information Systems, The University of Electro-Communications, Professor, 大学院・情報システム学研究科, 教授 (50251723)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YAMAGUCHI Yoshinori Tsukuba University, Insititute of Information Sciences and Electronics, Professor, 電子・情報工学系, 教授 (00312827)
KISE Kenji Graduate School of Information Systems, The University of Electro-Communications, Research Associate, 大学院・情報システム学研究科, 助手 (50323887)
HONDA Hiroki Graduate School of Information Systems, The University of Electro-Communications, Associate Professor, 大学院・情報システム学研究科, 助教授 (20199574)
|
|---|
| Project Period (FY) |
1998 – 2001
|
| Keywords | parallel processing / parallel computers / task granularity / parallelizing compiler / granularity tuning / coarse-grain parallelism / SMP cluster / Parallel program |
|---|
| Research Abstract |
We aim to establish the fundamental technology of parallelizing compilers with a granularity tuning mechanism for efficient parallel processing. The parallelizing compiler generates a parallel object program, which will be executed in the shortest time on a parallel computer, by matching its hardware characteristics with parallel properties of a given application program. The main results are as follows :
1. A new static parallelizing scheme is proposed, in which apart of a target sequential program is divided into parallel tasks with optimal granularity by using the LogP model as an abstract parallel machine. Do loops, do across loops and recursive function calls are applied for granularity tuning, and evaluation studies are carried out on some different parallel computers.
An efficient execution mechanism for coarse-grain parallel processing is proposed for distributed memory parallel computers. The mechanism can be realized to transform a given sequential program into a coarse-grain task graph with execution start conditions as well as data reaching conditions as a function of parallelizing computers.
3. A parallelizing compiler with a coarse-grain parallel processing function is experimentally constructed. The conventional Open MP compiler is utilized to translate the coarse-grain task graph with Open MP primitives into an executable parallel C program.
4. A novel software distributed shared memory (SDSM) is proposed, which reduces memory consistency overhead by reflecting characteristics of application programs at a middleware level. The SDSM scheme is implemented in such parallel machine environment as a heterogeneous workstation cluster and an SMP-type personal computer cluster.
|
