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

20 results for “INT8 GEMM engine”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.ARRecentJun 1, 2026

O-POPE: High-Frequency Pipelined Outer Product based GEMM acceleration with minimal buffering overhead

Danilo Cammarata, Angelo Garofalo, Luca Benini

O-POPE is a novel outer-product engine that accelerates floating-point GEMM by repurposing FPU pipeline registers as buffers, achieving high utilization and improved energy efficiency.

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.DCEmpiricalRecentJul 21, 2026

InstantInfer: Enabling Fast LLM Cold Start with Communicating Finite Automata

Yitao Yuan, Yongchao He, Shaoke Fang, Wenfei Wu

The paper proposes the Communicating Finite Automata (CFA) abstraction and a framework for component program refactoring in large language model inference services, achieving significant speedup and r…

View →
cs.ARcs.MSRecentJun 3, 2026

GoldenFloat: A Phi-Derived Static-Split Floating-Point Family from GF4 to GF256 with a Lucas-Exact Integer Identity

Dmitrii Vasiliev

This paper presents a hardware-oriented description of GoldenFloat, a static-split floating-point family, and its concrete artefacts.

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.CRcs.PLRecentMay 8, 2026

Deterministic Fully-Static Whole-Binary Translation without Heuristics

Hongyu Chen, James McGowan, Michael Franz

Elevator is a novel, deterministic binary translator that statically translates entire x86-64 executables to AArch64 by considering all possible interpretations of every byte, eliminating the need for…

View →
cs.PLTheoreticalRecentJul 21, 2026

Formal Verification of an Out-of-Order Multiprocessor against an In-Order Weak-Memory ISA

Janggun Lee, Jeehoon Kang

The first formal verification of an out-of-order multiprocessor against an in-order, weak-memory ISA using a core specification and mechanized proofs in Rocq.

View →
cs.CRcs.CLRecentMay 4, 2026

FunFuzz: An LLM-Powered Evolutionary Fuzzing Framework

Mario Rodríguez Béjar, B. Romera-Paredes, Jose L. Hernández-Ramos

FunFuzz introduces a multi-island evolutionary fuzzing framework that uses LLMs to generate structured inputs, achieving superior compiler coverage and discovering more unique failures compared to exi…

View →
cs.ARcs.DCEmpiricalRecentJun 29, 2026

COSM: A Cooperative Scheduling Framework for Concurrent PIM and CPU Execution on Mobile Devices

Yilong Zhao, Fangxin Liu, Onur Mutlu, Mingyu Gao +3 more

The paper introduces COSM, a cooperative scheduling framework to facilitate concurrent operation of Processing-in-Memory (PIM) and CPU tasks on mobile platforms, improving PIM throughput by up to 2.8x…

View →
cs.ARcs.AIcs.SERecentJun 2, 2026

HighTide: An Agent-Curated Open-Source VLSI Benchmark Suite

Benjamin Goldblatt, Paolo Pedroso, Farhad Modaresi, Ethan Sifferman +1 more

HighTide is an evolving, AI-assisted, open-source benchmark suite for VLSI design, providing a comprehensive and scalable platform for hardware development.

View →
cs.AREmpiricalRecentJul 17, 2026

From Patterns to Parsers: Automatic Generation of Efficient Hardware Parsers for FPGAs

Tushar Garg, Andrew Boutros

This paper presents an open-source tool for generating efficient hardware parsers from high-level specifications using a decoupled parsing intermediate representation and custom symbolic tokens.

View →
cs.SEcs.PLEmpiricalRecentJul 19, 2026

Portable models as a replacement for industrial heuristics in compiler optimizations

Fot Nikolai, Vinarsky Alexander

This paper proposes a portable inlining-prediction framework for lightweight systems, using production compiler diagnostics, an extractor, and a trained predictor.

View →
cs.CRcs.SERecentMar 20, 2026

Byte-level Object Bounds Protection

Piyus Kedia

PRISM is a novel, precise object-bounds protection scheme that significantly reduces runtime overhead by encoding the object's end address directly into the pointer tag, thereby eliminating costly met…

View →
cs.LOcs.PLEmpiricalRecentJun 26, 2026

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

Nils Lommen, Éléanore Meyer, Jürgen Giesl

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

View →