ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “sparse tile execution”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.ARcs.AIEmpiricalRecentJul 24, 2026

Sparse by Command: Task-Conditional Compute Skipping for Multi-Task Inference Accelerators

Afzal Ahmad, Gaoyu Mao, Shoubo Hu, Hui-Ling Zhen +3 more

A co-designed hardware-software approach for task-conditional sparsity in multi-task inference models, reducing FLOPs, latency, and energy.

View →
cs.PLcs.CCcs.FLRecentMay 30, 2026

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation

Ezequiel López-Rubio

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

View →
cs.AREmpiricalRecentJul 4, 2026

TileLens: Efficiently Using Large-Granularity Memory Systems with Transparent Two-Dimensional Memory Layout

Jae Hyung Ju, Euijun Chung, Hritvik Taneja, Anish Saxena +3 more

This paper proposes TileLens, a system to mitigate read amplification in Large-Granularity Memory Systems (LGMS) for Large Language Model (LLM) inference by adopting a tile-major layout.

View →
cs.DCcs.PFEmpiricalRecentJul 24, 2026

TileSight: A First-Principles Tile-Centric Analytical GPU Performance Model from Cores to Clusters

Zhiwen Mo, Yu Cheng, Lei Wang, Zhengju Tang +11 more

TileSight is a tile-centric performance-modeling tool that predicts single-GPU kernel latency and cache hit rates with low error, outperforming state-of-the-art baselines and transferring well across…

View →
cs.DCEmpiricalRecentJul 2, 2026

Elasticity in Parallel Sparse Triangular Solve

Raphael S. Steiner, Christos K. Matzoros, Pál András Papp, Toni Böhnlein +1 more

This paper introduces Stale Synchronous Parallel mode of execution for parallel sparse triangular linear system solve and presents a scheduler that achieves geometric-mean speed-ups of 7-30% over Grow…

View →
cs.GRcs.CVcs.DCEmpiricalRecentJul 17, 2026

Rendering 3D Gaussians on a Graph Processor

Nicholas Fry, Ignacio Alzugaray, Mark Pupilli, Paul H. J. Kelly +1 more

First implementation of a 3D Gaussian renderer on an Intelligence Processing Unit (IPU) with 1,472 independent tiles using only on-chip SRAM.

View →
cs.ARcs.PFRecentMay 30, 2026

Regular-Dead on Arrival: Characterizing and Protecting Against Dead-Entry TLB Misses in GPU Microarchitectures

Shafayat Mowla Anik, Yongchan Jung, Jeeho Ryoo, Byeong Kil Lee

The paper characterizes 'dead-entry' TLB misses in GPUs, which occur when recently evicted translations are immediately re-walked, and proposes DEPOT, a Bloom filter mechanism that significantly reduc…

View →
cs.PFcs.ARcs.DCRecentMay 28, 2026

From Roofline to Ruggedness: Decomposing and Smoothing the GEMM Performance Landscape

Aditya Chatterjee

The paper introduces performance ruggedness analysis to quantify performance variance in GEMM workloads, proposing a two-stage software stack that significantly smooths the performance landscape and b…

View →
cs.DCcs.PFEmpiricalRecentJun 27, 2026

Five Ways to Build a Concurrent Linked From Coarse-Grain Locking to Lock-Free Algorithms

Zeeshan Mohammed Rangrej

This paper explores five methods for making a linked list work efficiently with multiple threads, from using one big lock to a lock-free design.

View →
cs.SEcs.AIcs.LGRecentMay 28, 2026

AI-PROPELLER: Warehouse-Scale Interprocedural Code Layout Optimization with AlphaEvolve

Chaitanya Mamatha Ananda, Rajiv Gupta, Mircea Trofin, Aiden Grossman +3 more

AI-PROPELLER introduces a novel interprocedural code layout optimization system that uses an agentic evolutionary workflow to achieve significant, measurable performance gains in large-scale, real-wor…

View →
cs.DCNEWEmpiricalJul 28, 2026

CW-Ghost: Search-Free Granularity Selection for Helper-Thread Prefetching via Capacity Windows

Ya Zhang, Tong Lei, Yao Chen, Yonggang Che +3 more

This paper introduces CW-Ghost, a method for estimating cache line fill volume and determining helper-thread prefetching granularity based on cache capacity constraints.

View →
cs.DScs.DCcs.MSEmpiricalRecentJul 27, 2026

Right Multiplication on Grammar-Compressed Matrices: A Streaming, Memory-Bounded GPU Engine

Francesco Tosoni, Gabriele Mencagli

This paper presents a method for compressing matrices using a RePair straight-line program (SLP), allowing matrix-vector products with time and space proportional to the compressed size, and demonstra…

View →
cs.CEphysics.comp-phRecentMay 27, 2026

Unified sparse framework for large-scale material point method simulations

Yidong Zhao, Lars Blatny, Xiang Feng, Mikkel M. Juel +2 more

This paper proposes a unified sparse background-grid framework for the Material Point Method (MPM), significantly reducing computational time and memory usage in large-scale simulations where the mate…

View →
cs.ARcs.LGcs.OSEmpiricalRecentJul 16, 2026

ExaGEMM: Exploration Framework for CPU-Driven ML Inference via Associative In-Register Computing for Low-Bit GEMM

Hyunwoo Oh, Suyeon Jang, Hanning Chen, Sanggeon Yun +2 more

The paper presents ExaGEMM, a framework for designing and exploring CPU-native low-bit GEMM via register-resident LUT execution.

View →
cs.AREmpiricalRecentJul 24, 2026

The Sparsity Tax: Weight Sparsity Trade-offs in Event-Driven SIMD and SIMT Neuromorphic Cores

Mattias Westerink, Sameed Sohail, Berend-Jan van der Zwaag, Sabih Gerez +1 more

This paper compares three neuromorphic core designs for handling weight sparsity in event-driven neural networks and quantifies the performance and energy costs.

View →
cs.LGcs.AIRecentJun 1, 2026

FOAM: Frequency and Operator Error-Based Adaptive Damping Method for Reducing Staleness-Oriented Error for Shampoo

Kyunghun Nam, Sumyeong Ahn

The paper proposes FOAM, an adaptive damping method that stabilizes the Shampoo optimization algorithm by dynamically controlling damping and eigendecomposition frequency, thereby reducing staleness-i…

View →
math.NTcs.DScs.SCTheoreticalRecentJun 22, 2026

Faster enumeration of primes

David Harvey

This paper introduces new algorithms for finding prime numbers up to a given bound, achieving a speedup of log N over the sieve of Eratosthenes.

View →