NDLI: Breaking Sequential Dependencies in FPGA-Based Sparse LU Factorization

Content Provider	IEEE Xplore Digital Library
Author	Siddhartha Kapre, N.
Copyright Year	2014
Description	Author affiliation: Nanyang Technol. Univ., Singapore, Singapore (Siddhartha; Kapre, N.)
Abstract	Substitution, and reassociation of irregular sparse LU factorization can deliver up to 31% additional speedup over an existing state-of-the-art parallel FPGA implementation where further parallelization was deemed virtually impossible. The state-of-the-art implementation is already capable of delivering 3× acceleration over CPU-based sparse LU solvers. Sparse LU factorization is a well-known computational bottleneck in many existing scientific and engineering applications and is notoriously hard to parallelize due to inherent sequential dependencies in the computation graph. In this paper, we show how to break these alleged inherent dependencies using depth-limited substitution, and reassociation of the resulting computation. This is a work-parallelism tradeoff that is well-suited for implementation on FPGA-based token dataflow architectures. Such compute organizations are capable of fast parallel processing of large irregular graphs extracted from the sparse LU computation. We manage and control the growth in additional work due to substitution through careful selection of substitution depth. We exploit associativity in the generated graphs to restructure long compute chains into reduction trees.
Starting Page	60
Ending Page	63
File Size	253390
Page Count	4
File Format	PDF
e-ISBN	9781479951116
DOI	10.1109/FCCM.2014.26
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-05-11
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Benchmark testing Sparse matrices Parallel processing Field programmable gate arrays Hardware Circuit simulation Computer architecture reassociation LU Factorization substitution
Content Type	Text
Resource Type	Article

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

Heterogeneous dataflow architectures for FPGA-based sparse LU factorization

Hardware implementation of LU decomposition using dataflow architecture on FPGA

High Performance Sparse LU Solver FPGA Accelerator Using a Static Synchronous Data Flow Model

Parallel sparse matrix solver for direct circuit simulations on FPGAs

A 64-way VLIW/SIMD FPGA architecture and design flow

Sparse LU factorization for parallel circuit simulation on GPU

CHiMPS: A C-level compilation flow for hybrid CPU-FPGA architectures

FPGA based fault emulation of synchronous sequential circuits

On sparse matrix-vector multiplication with FPGA-based system

Breaking Sequential Dependencies in FPGA-Based Sparse LU Factorization

Similar Documents

Heterogeneous dataflow architectures for FPGA-based sparse LU factorization

Hardware implementation of LU decomposition using dataflow architecture on FPGA

High Performance Sparse LU Solver FPGA Accelerator Using a Static Synchronous Data Flow Model

Parallel sparse matrix solver for direct circuit simulations on FPGAs

A 64-way VLIW/SIMD FPGA architecture and design flow

Sparse LU factorization for parallel circuit simulation on GPU

CHiMPS: A C-level compilation flow for hybrid CPU-FPGA architectures

FPGA based fault emulation of synchronous sequential circuits

On sparse matrix-vector multiplication with FPGA-based system

Breaking Sequential Dependencies in FPGA-Based Sparse LU Factorization