A Novel Parallel Scan for Multicore Processors and Its Application in Sparse Matrix-Vector Multiplication
Issue No. 03 - March (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.174
Nan Zhang , Xi'an Jiaotong-Liverpool University, Suzhou
We present a novel parallel algorithm for computing the scan operations on x86 multicore processors. The existing best known parallel scan for the same platform requires the number of processors to be a power of two. But this constraint is removed from our proposed method. In the design of the algorithm architectural considerations for x86 multicore processors are given so that the rate of cache misses is reduced and the cost of thread synchronization and management is minimized. Results from tests made on a machine with dual-socket \times quad-core Intel Xeon E5405 showed that the proposed solution outperformed the best known parallel reference. A novel approach to sparse matrix-vector multiplication (SpMV) based on the proposed scan is then explained. The approach, unlike the existing ones that make use of backward segmented operations, uses forward ones for more efficient caching. An implementation of the proposed SpMV was tested against the SpMV in Intel's Math Kernel Library (MKL) and merits were found in the proposed approach.
Parallel algorithms, parallel scan, prefix sum, multicore computing, sparse matrix-vector multiplication.
N. Zhang, "A Novel Parallel Scan for Multicore Processors and Its Application in Sparse Matrix-Vector Multiplication," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 397-404, 2011.