Research on FFT Algorithms for Many-Core Massively Parallel Clusters
| Project/Area Number |
20700021
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Software
|
|---|
| Research Institution | University of Tsukuba |
|---|
Principal Investigator |
TAKAHASHI Daisuke University of Tsukuba, 大学院・システム情報工学研究科, 准教授 (00292714)
|
|---|
| Project Period (FY) |
2008 – 2009
|
| Project Status |
Completed (Fiscal Year 2009)
|
| Budget Amount *help |
¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2009: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2008: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | 並列処理 / 分散処理 / 高速フーリエ変換 / 並列計算機 |
|---|
| Research Abstract |
In this research, we extended a parallel one-dimensional FFT algorithm to a parallel multi-dimensional FFT algorithm. Furthermore, we investigated an appropriate data distribution and a communication method. For parallel three-dimensional FFTs, a two-dimensional decomposition improves performance effectively by reducing the communication time for many-core massively parallel clusters.
|
Report
(3 results)
Research Products
(10 results)
