S-Space College of Engineering/Engineering Practice School (공과대학/대학원) Dept. of Electrical and Computer Engineering (전기·정보공학부) Others_전기·정보공학부
소괄호 묶기 방법을 이용한 희소 행렬 연쇄 곱셈의 최적화
Optimization of Sparse Matrix Chain Multiplication by using Parenthesizing method
- Issue Date
- 대한전자공학회 2009년 하계종합학술대회 2009. 7
- Matrix chain multiplication is an important computational kernel used in many applications such as scientific computation, signal and image processing. In this paper, sparse matrix chain multiplication is optimized by using dynamic programming method. With the proposed method, total execution time is reduced by 33%.
- Files in This Item: