activity
20232025
most citedDeMM: A Decoupled Matrix Multiplication Engine Supporting Relaxed Structured Sparsity

4 citations · 5 across the 9 of their papers we have counts for

collaborators
Showing cs.ARShow all

6 papers · 1 filter

cs.AR2025

Low-Cost FlashAttention with Fused Exponential and Multiplication Hardware Operators

Kosmas Alexandridis, Vasileios Titopoulos, Giorgos Dimitrakopoulos

Attention mechanisms, particularly within Transformer architectures and large language models (LLMs), have revolutionized sequence modeling in machine learning and artificial intel…

cs.AR2025

Efficient Implementation of RISC-V Vector Permutation Instructions

Vasileios Titopoulos, George Alexakis, Chrysostomos Nicopoulos +1

RISC-V CPUs leverage the RVV (RISC-V Vector) extension to accelerate data-parallel workloads. In addition to arithmetic operations, RVV includes powerful permutation instructions t…

cs.AR2025

Register Dispersion: Reducing the Footprint of the Vector Register File in Vector Engines of Low-Cost RISC-V CPUs

Vasileios Titopoulos, George Alexakis, Kosmas Alexandridis +2

The deployment of Machine Learning (ML) applications at the edge on resource-constrained devices has accentuated the need for efficient ML processing on low-cost processors. While…

cs.AR2025

Optimizing Structured-Sparse Matrix Multiplication in RISC-V Vector Processors

Vasileios Titopoulos, Kosmas Alexandridis, Christodoulos Peltekis +2

Structured sparsity has been proposed as an efficient way to prune the complexity of Machine Learning (ML) applications and to simplify the handling of sparse data in hardware. Acc…

cs.AR20244 cited

DeMM: A Decoupled Matrix Multiplication Engine Supporting Relaxed Structured Sparsity

Christodoulos Peltekis, Vasileios Titopoulos, Chrysostomos Nicopoulos +1

Deep Learning (DL) has achieved unprecedented success in various application domains. Meanwhile, model pruning has emerged as a viable solution to reduce the footprint of DL models…

cs.AR20231 cited

IndexMAC: A Custom RISC-V Vector Instruction to Accelerate Structured-Sparse Matrix Multiplications

V. Titopoulos, K. Alexandridis, C. Peltekis +2

Structured sparsity has been proposed as an efficient way to prune the complexity of modern Machine Learning (ML) applications and to simplify the handling of sparse data in hardwa…