Imperial College London


Faculty of EngineeringDepartment of Computing

Professor of Computer Engineering



+44 (0)20 7594 8313w.luk Website




434Huxley BuildingSouth Kensington Campus






BibTex format

author = {Chow, G and Grigoras, P and Burovskiy, PA and Luk, W},
doi = {10.1109/FPL.2014.6927464},
publisher = {IEEE},
title = {An efficient sparse conjugate gradient solver using a Beneš permutation network},
url = {},
year = {2014}

RIS format (EndNote, RefMan)

AB - The conjugate gradient (CG) is one of the most widely used iterative methods for solving systems of linear equations. However, parallelizing CG for large sparse systems is difficult due to the inherent irregularity in memory access pattern. We propose a novel processor architecture for the sparse conjugate gradient method. The architecture consists of multiple processing elements and memory banks, and is able to compute efficiently both sparse matrix-vector multiplication, and other dense vector operations. A Beneš permutation network with an optimised control scheme is introduced to reduce memory bank conflicts without expensive logic. We describe a heuristics for offline scheduling, the effect of which is captured in a parametric model for estimating the performance of designs generated from our approach.
AU - Chow,G
AU - Grigoras,P
AU - Burovskiy,PA
AU - Luk,W
DO - 10.1109/FPL.2014.6927464
PY - 2014///
TI - An efficient sparse conjugate gradient solver using a Beneš permutation network
UR -
UR -
ER -