| Project/Area Number |
05452354
|
|---|
| Research Category |
Grant-in-Aid for General Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Waseda University |
|---|
Principal Investigator |
NARITA Seinosuke Waseda University, School of Science and Enigneering, Prof., 理工学部・電気工学科, 教授 (90063677)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
AIDA Kento Waseda University, Center for Informatics, Assistant., 情報科学センター, 助手 (80247212)
HONDA Hiroki Yamanashi University, School of Engineering, Assist. Prof., 工学部・電子情報工学科, 助教授 (20199574)
KASAHARA Hironori Waseda University, School of Science and Engineering, Department of Electrical E, 理工学部・電気工科学, 助教授 (30152622)
|
|---|
| Project Period (FY) |
1993 – 1995
|
| Project Status |
Completed (Fiscal Year 1995)
|
| Budget Amount *help |
¥7,100,000 (Direct Cost: ¥7,100,000)
Fiscal Year 1995: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 1994: ¥2,000,000 (Direct Cost: ¥2,000,000)
Fiscal Year 1993: ¥4,400,000 (Direct Cost: ¥4,400,000)
|
|---|
| Keywords | parallel processing / paralleling compiler / supercomputers / multiprocessors / Fortran / scheduling / coarse grain tasks / macro dataflow processing / マクロデータフロー処理処理 |
|---|
| Research Abstract |
Multitasking and microtasking have long been used for the parallel processing of Fortran programs on shared-momory type multiprocessor systems. Howerver, multitasking has shortcomings such as the difficulty for the specification of parallelism by the user and the scheduling overhead due to OS calls. Micortasking has been widely used for loop parallelization, but there still remain many loops such as complicated data dependencies among iterations and conditional branches outsides loops, which cannot be paralyzed automatically. To resolve those problems, we have proposed a method for the processing of macro dataflows. In this scheme, the compiler automatically decompose a given program into coarse-grain tasks and detects parallelisms existing among the coarse grain task by analyzing the earliest executable conditions.
By using the scheduling routines generated by the compiler, the scheduling overhead can be kept minimum. In macro datafow processing, due considerations are given to minimize data transfer overheads, and more efficient parallel processing can be achieved by localizing onto local memories. The efficiency of the proposed parallel processing of coarse grain tasks through macrodata flow processing was confirmed on the prototype multiprocessor system OSCAR.It was also tested on commercial multiprocessor systems such as a Fujitsu FPP0500, an Alliant FX-4, an KSR1 and an NEC Cenju-3. It has been found that macro dataflow processing can provide more parallelism than conventional multitasking and microtasking. It was also confirmed that lower overheads can be achieved compared with conventional methods, hence faster speed for program processing.
|
