Matrix-vector multiplication on a fixed-size linear systolic array
نویسندگان
چکیده
منابع مشابه
Sparse Matrix-Vector Multiplication on a Small Linear Array
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 eecient 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 i...
متن کاملEfficient Heap Implementation with a Fixed-Size Linear Systolic Array
The heap is a data strudure used in many applications and provides a funfamental technique to solve many problems efficiently. In this paper I we show that a sequence of n INSERT and EXTRACT..MIN heap operations can be performed in time O(nlogmjlogp) with space Oem) on a random access machine to ,vhich a linear systolic array of p processors is attached, provided that, at any time instance, the...
متن کامل2D matrix multiplication on a 3D systolic array
The introduction of systolic arrays in the late 1970s had an enormous impact on the area of special purpose computing. However, most of the work so far has been done with onedimensional and two-dimensional (2D) systolic arrays. Recent advances in three-<limensional VLSI (3D VLSI) and 3D packaging of2D VLSI components, has made the idea of 3D systolic arrays feasible in the near future. In this ...
متن کاملParallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System Parallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity O(N), where 2 < < 3. The current best value of is less than 2.3755. We show that for all 1 p N , multiplying two N N matrices can be performed on a p-processor linear array with a reconngurable pipelined bus system (LARPBS) in O N p + N 2 p 2== log p time. This is currently the fa...
متن کاملHyper-Systolic Matrix Multiplication
A novel parallel algorithm for matrix multiplication is presented. The hyper-systolic algorithm makes use of a one-dimensional processor abstraction. The procedure can be implemented on all types of parallel systems. It can handle matrix-vector multiplications as well as transposed matrix products.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2000
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(00)00231-5