Towards efficient sparse matrix vector multiplication on real processing-in-memory architectures

C Giannoula, I Fernandez, J Gómez-Luna… - ACM SIGMETRICS …, 2022 - dl.acm.org
Several manufacturers have already started to commercialize near-bank Processing-In-
Memory (PIM) architectures, after decades of research efforts. Near-bank PIM architectures …

Scalability of hybrid sparse matrix dense vector (spmv) multiplication

BA Page, PM Kogge - 2018 International Conference on High …, 2018 - ieeexplore.ieee.org
SpMV, the product of a sparse matrix and a dense vector, is emblematic of a new class of
applications that are memory bandwidth and communication, not flop, driven. Sparsity and …

Accelerating Irregular Applications via Efficient Synchronization and Data Access Techniques

C Giannoula - arXiv preprint arXiv:2211.05908, 2022 - arxiv.org
Irregular applications comprise an increasingly important workload domain for many fields,
including bioinformatics, chemistry, physics, social sciences and machine learning …

On Optimal Partitioning For Sparse Matrices In Variable Block Row Format

W Ahrens, EG Boman - arXiv preprint arXiv:2005.12414, 2020 - arxiv.org
The Variable Block Row (VBR) format is an influential blocked sparse matrix format
designed for matrices with shared sparsity structure between adjacent rows and columns …

Circuit partitioning for multi-FPGA platforms

J Rodriguez - 2024 - theses.hal.science
An FPGA ('Field Programmable Gate Array') is an integrated circuit comprising a large
number of programmable and interconnectable logic resources, which allow one to …

[PDF][PDF] Επιτάχυνση των Μη-Κανονικών Εφαρμογών Μέσω Αποδοτικών Τεχνικών Συγχρονισμού και Βελτιστοποιημένων Τεχνικών Πρόσβασης στα Δεδομένα

Χ Γιαννούλα - 2023 - dspace.lib.ntua.gr
Περίληψη Οι µη-ϰανονιϰές εφαρµογές, όπως οι εφαρµογές επεξεργασίας γράφων,
παράλληλων δοµών δεδοµένων ϰαι επίλυσης αραιών γραµµιϰών συστηµάτων, αποτελούν …

Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication

W Ahrens - arXiv preprint arXiv:2007.16192, 2020 - arxiv.org
Graph partitioning schedules parallel calculations like sparse matrix-vector multiply (SpMV).
We consider contiguous partitions, where the $ m $ rows (or columns) of a sparse matrix …

[引用][C] Load Plus Communication Balancing of Contiguous Sparse Matrix Partitions