| Project/Area Number |
09680350
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Ritsumeikan University |
|---|
Principal Investigator |
YAMAZAKI Katsuhiro Ritsumeikan Univ.Computer Science Professor, 理工学部, 教授 (70134260)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
NIIMI Haruo Kyoto Sangyo Univ.Information and Communication Sciences Professor, 工学部, 教授 (40144331)
ONISHI Atsushi Ritsumeikan Univ.Computer Science Professor, 理工学部, 教授 (50160560)
|
|---|
| Project Period (FY) |
1997 – 1998
|
| Project Status |
Completed (Fiscal Year 1998)
|
| Budget Amount *help |
¥3,200,000 (Direct Cost: ¥3,200,000)
Fiscal Year 1998: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 1997: ¥2,100,000 (Direct Cost: ¥2,100,000)
|
|---|
| Keywords | parallel programming / case-based reasoning / parallel algorithms / indlces / task dirision / threads / case retvieval / case adaptation |
|---|
| Research Abstract |
This research developed a case-based parallel programming system on a virtual shared memory parallel machine KSR-1 and then evaluated the system by experimenting with case-based parallel programming for several problems.
(1)Development of a case-based parallel programming system
We developed an indexing part which analyzes a given problem and makes indices that show the characteristics of a problem by talking with a user. Then, we developed a case retriever and a case adaptator. The case-base has 22 parallel programs.
(2)Experimentation and evaluation of case-based parallel programming
Knapsack problem, string pattern matching(the BM method), Romberg rule, Viginere cipher and run length compression were the target of the experimentation of case based parallel programming.
A relevant case for each problem was retrieved by the system using the indices. A final parallel program was developed by adapting the skeleton of the relevant case by the user.
We evaluated the re-usability of the case in terms of threads, synchronization, task division and unit calculations, The results show that threads and synchronization are almost reused from skeletons, and unit calculations are extracted from serial programs. Although a part of task division can be reused from the skeletons, most of them should be adapted by the user. This concludes that the skeletal part of parallel programs can be reused from relevant cases so that the burden of parallel programming can be reduced.
|
