登入
選單
返回
Google圖書搜尋
Sparse Matrix-vector Multiplication on a Small Linear Array
University of Iowa. Department of Computer Science
Lenwood S. Heath
Sriram V. Pemmaraju
Calvin J. Ribbens
出版
University of Iowa, Department of Computer Science
, 1993
URL
http://books.google.com.hk/books?id=BoaxHAAACAAJ&hl=&source=gbs_api
註釋
Abstract: "A data-driven algorithm to compute a matrix-vector product on a linear array of processing elements is presented. This algorithm is based on an efficient construction that covers the nonzero entries of the matrix with staircases. The number of processing elements required equals the size of a minimal staircase cover of the matrix. The algorithm is shown to be superior to the algorithm of Melhem in terms of hardware requirements, while using exactly the same number of time steps. A question posed by Melhem is answered through a precise characterization of the number of time steps required for a particular matrix."
