TY - GEN
T1 - Memory support design for LU decomposition on the starbridge hyper-computer
AU - Young, Seth
AU - Sudarsanam, Arvind
AU - Dasu, Aravind
AU - Hauser, Thomas
PY - 2006
Y1 - 2006
N2 - LU matrix decomposition is a linear algebra algorithm used to reduce the complexity required to solve a large system of linear equations. Large systems of equations frequently need to be solved in physics, engineering, and computational chemistry. In the hardware implementation of such LU algorithms supporting modules must be included which handle the transfer of memory between the disk and processing nodes. This paper looks at the data transfer hardware which supports an implementation of a block-based LU algorithm on a multi-FPGA system. Preliminary results are provided which show the required areas and latencies of these designs.
AB - LU matrix decomposition is a linear algebra algorithm used to reduce the complexity required to solve a large system of linear equations. Large systems of equations frequently need to be solved in physics, engineering, and computational chemistry. In the hardware implementation of such LU algorithms supporting modules must be included which handle the transfer of memory between the disk and processing nodes. This paper looks at the data transfer hardware which supports an implementation of a block-based LU algorithm on a multi-FPGA system. Preliminary results are provided which show the required areas and latencies of these designs.
UR - https://www.scopus.com/pages/publications/43749114963
U2 - 10.1109/FPT.2006.270307
DO - 10.1109/FPT.2006.270307
M3 - Conference contribution
AN - SCOPUS:43749114963
SN - 0780397282
SN - 9780780397286
T3 - Proceedings - 2006 IEEE International Conference on Field Programmable Technology, FPT 2006
SP - 157
EP - 164
BT - Proceedings - 2006 IEEE International Conference on Field Programmable Technology, FPT 2006
T2 - 2006 IEEE International Conference on Field Programmable Technology, FPT 2006
Y2 - 13 December 2006 through 15 December 2006
ER -