NDLI: Sparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer with Application

Please wait, while we are loading the content...

Sparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer with Application

Content Provider	ACM Digital Library
Author	Boorman, Thomas Connor, Carolyn Poole, Steve Dubois, David Dubois, Andrew
Copyright Year	2010
Abstract	Double precision floating point Sparse Matrix-Vector Multiplication (SMVM) is a critical computational kernel used in iterative solvers for systems of sparse linear equations. The poor data locality exhibited by sparse matrices along with the high memory bandwidth requirements of SMVM result in poor performance on general purpose processors. Field Programmable Gate Arrays (FPGAs) offer a possible alternative with their customizable and application-targeted memory sub-system and processing elements. In this work we investigate two separate implementations of the SMVM on an SRC-6 MAPStation workstation. The first implementation investigates the peak performance capability, while the second implementation balances the amount of instantiated logic with the available sustained bandwidth of the FPGA subsystem. Both implementations yield the same sustained performance with the second producing a much more efficient solution. The metrics of processor and application balance are introduced to help provide some insight into the efficiencies of the FPGA and CPU based solutions explicitly showing the tight coupling of the available bandwidth to peak floating point performance. Due to the FPGAs ability to balance the amount of implemented logic to the available memory bandwidth it can provide a much more efficient solution. Finally, making use of the lessons learned implementing the SMVM, we present a fully implemented non-preconditioned Conjugate Gradient Algorithm utilizing the second SMVM design.
Starting Page	1
Ending Page	31
Page Count	31
File Format	PDF
ISSN	19367406
e-ISSN	19367414
DOI	10.1145/1661438.1661440
Volume Number	3
Issue Number	1
Journal	ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-01-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Accelerator FPGA Architecture Conjugate gradient Hybrid computing Iterative methods Reconfigurable Reconfigurable hardware Sparse matrix-vector multiplication
Content Type	Text
Resource Type	Article
Subject	Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Sparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer

An Implementation of the Conjugate Gradient Algorithm on FPGAs

Exploiting Matrix Symmetry to Improve FPGA-Accelerated Conjugate Gradient

An I/O Bandwidth-Sensitive Sparse Matrix-Vector Multiplication Engine on FPGAs

A High Memory Bandwidth FPGA Accelerator for Sparse Matrix-Vector Multiplication

High-Performance Architecture for the Conjugate Gradient Solver on FPGAs

Adaptive Optimization Modeling of Preconditioned Conjugate Gradient on Multi-GPUs

A Hybrid Approach for Mapping Conjugate Gradient onto an FPGA-Augmented Reconfigurable Supercomputer

Analysis of Sparse Matrix-Vector Multiplication Using Iterative Method in CUDA

Sparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer with Application

Similar Documents

Sparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer

An Implementation of the Conjugate Gradient Algorithm on FPGAs

Exploiting Matrix Symmetry to Improve FPGA-Accelerated Conjugate Gradient

An I/O Bandwidth-Sensitive Sparse Matrix-Vector Multiplication Engine on FPGAs

A High Memory Bandwidth FPGA Accelerator for Sparse Matrix-Vector Multiplication

High-Performance Architecture for the Conjugate Gradient Solver on FPGAs

Adaptive Optimization Modeling of Preconditioned Conjugate Gradient on Multi-GPUs

A Hybrid Approach for Mapping Conjugate Gradient onto an FPGA-Augmented Reconfigurable Supercomputer

Analysis of Sparse Matrix-Vector Multiplication Using Iterative Method in CUDA

Sparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer with Application