Acceleration of band algorithms using fast dense kernels for large Band matrices
| Project/Area Number |
21500030
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Software
|
|---|
| Research Institution | University of Tsukuba |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2009 – 2011
|
| Project Status |
Completed (Fiscal Year 2011)
|
| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2011: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2009: ¥2,730,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥630,000)
|
|---|
| Keywords | 並列処理 / 分散処理 / 帯行列 / 連立一次方程式 / ガウスの消去法 / ハウスホルダー変換 / ブロック化 / BLAS / 高速化 / GPU / コプロセッサ |
|---|
| Research Abstract |
Acceleration of band algorithms has been tested using a co-processor which enables high-performance dense matrix multiplication. The algorithms include Gaussian elimination for general band matrices, and Householder tridiagonalization for symmetric band matrices. Because the band algorithms reduce the amount of storage space in memory by utilizing the specific geometric structure of the matrices and the co-processor uses a separate memory space, data transfer and conversion between memory and co-processor are essential.
|
Report
(4 results)
Research Products
(17 results)
