Towards an FPGA solver for the PageRank eigenvector problem

MaRDI QIDQ3601158zbMATH OpenFDO

Authors Séamas McGettrick, Dermot Geraghty, Ciarán McElroy

Publication date 9 February 2009

zbMATH Keywords

general-purpose processorsSMVM performancesparse matrix by vector multiplication

Mathematics Subject Classification ID

Numerical algorithms for specific classes of architectures (65Y10) Complexity and performance of numerical algorithms (65Y20) Network design and communication in computer systems (68M10)

Recommendations

• Fast PageRank Computation via a Sparse Linear System
• FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method
• Parallelizing the Computation of PageRank
• scientific article; zbMATH DE number 5353409
• Algorithms and Models for the Web-Graph

Cited in

(1)

• FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method

This page was built for publication: Towards an FPGA solver for the PageRank eigenvector problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601158)