| Budget Amount *help |
¥3,700,000 (Direct Cost: ¥3,700,000)
Fiscal Year 2002: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 2001: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 2000: ¥2,700,000 (Direct Cost: ¥2,700,000)
|
|---|
| Research Abstract |
The objective of this research is to develop the methods of the parallel execution and the task scheduling for OpenMP programs on the distributed memory parallel computers.
In this research, the novel concept "data reaching condition" was developed. The coarse grain task parallel processing scheme using "execution start condition", which represents the parallelisms among coarse grain tasks, realizes a macro-dataflow processing by dynamic-assignment of tasks onto processors. An implementation of the macro-dataflow processing on a distributed memory system, such as PC-cluster, requires new functions for explicit data transfer between tasks assigned to distinct processors. As one of the functions, it is vital to make a sender-receiver pair based on the use-definition chain determined at run-time ; however, the execution start condition has no information needed for the function. The concept "data reaching conditions" is used to make a sender-receiver pair of a data transfer, by extending the concept of the conventional reaching definition.
Moreover, the method to reduce the data-transfer overhead by "data preload" and the method to implement the macro-dataflow on "software distributed shared memory" were developed.
The implementation and evaluation on the real cluster system shows the effectiveness of the macro-dataflow on the distributed memory system by using "data reaching condition".
These results of this research have been published on the IPSJ Transaction, JSPP, IPSJ SIG Note.
|
