| Project/Area Number |
10680336
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | THE UNIVERSITY OF TOKYO |
|---|
Principal Investigator |
SHIMIZU Kentaro GRADUATE SCHOOL OF AGRICULTURAL AND LIFE SCIENCES, THE UNIVERSITY OF TOKYO PROFESSOR, 大学院・農学生命科学研究科, 教授 (80178970)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
NAKAMURA Shugo GRADUATE SCHOOL OF AGRICULTURAL AND LIFE SCIENCES, THE UNIVERSITY OF TOKYO RESEARCH ASSOCIATE, 大学院・農学生命科学研究科, 助手 (90272442)
池口 満徳 東京大学, 大学院・農学生命科学研究科, 助手 (60261955)
|
|---|
| Project Period (FY) |
1998 – 2000
|
| Project Status |
Completed (Fiscal Year 2000)
|
| Budget Amount *help |
¥3,200,000 (Direct Cost: ¥3,200,000)
Fiscal Year 2000: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 1999: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 1998: ¥2,000,000 (Direct Cost: ¥2,000,000)
|
|---|
| Keywords | parallel computing / parallel programming environment / MPI (Message Passing Interface) / processor allocation / scheduling / molecular dynamics / computational chemistry / 大規模並列計算機 / 科学技術計算 / 分子動力学シミュレーション / 空間分割法 / 大規模並列システム / マスタ / スレープ方式 |
|---|
| Research Abstract |
We designed and implemented a new parallel programming environment called Parsley, which provides fine-grained scheduling services based on the structures of application programs. In Parsley, application programs are divided into subtasks that can run serially or in parallel. It provides a programming interface that allows a user to define subtasks and to easily specify precedence constraints among them. Parsley uses these constraints to schedule subtasks at run time. In this research project, we developed the scheduling policy and mechanism for Parsley and applied them to parallel molecular dynamics simulation program on distributed memory multiprocessor systems. The scheduling policy is automatically improved to reflect the hardware environment and resource usage. The basic policy is an incremental scheduling algorithm based on the critical path method. In this algorithm, subtask priorities are dynamically determined by using the execution time of each subtask, as monitored by the resource management facilities of Parsley. This policy improves processor utilization by 35 to 55 % compared with the FIFO scheduling policy. In addition, Parsley is useful in the heterogeneous environment (e.g. a network of different workstations and clusters) as well as the homogeneous environment. Users need not be aware of the individual performance of the computers and networks, because of the dynamic processor allocation facilities of Parsley. We have developed several resource management policies for Parsley on heterogeneous environment and evaluated the performance for molecular dynamics simulation.
|
