Efficient Implementation of RISC-V Vector Permutation Instructions

📅 2025-05-11
📈 Citations: 0
Influential: 0
📄 PDF

career value

232K/year
🤖 AI Summary
RVV’s diverse permutation instruction control mechanisms hinder efficient execution within a unified datapath, while cryptographic acceleration mandates strict fixed latency. To address this, we propose a Unified Permutation Execution Unit (UPEU) supporting all RVV permutation instructions, enabling single-cycle completion for short vectors and pipelined processing for long vectors—all under fixed-latency constraints. The UPEU integrates an adaptive scheduling mechanism with 7 nm physical synthesis optimizations. Implemented in an open-source RISC-V vector processor, it incurs only 1.5% area overhead—scaling asymptotically toward zero as element width increases. Crucially, it guarantees deterministic latency required for cryptographic workloads while achieving high area efficiency.

Technology Category

Application Category

📝 Abstract
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 that enable flexible element rearrangement within vector registers --critical for optimizing performance in tasks such as matrix operations and cryptographic computations. However, the diverse control mechanisms of these instructions complicate their execution within a unified datapath while maintaining the fixed-latency requirement of cryptographic accelerators. To address this, we propose a unified microarchitecture capable of executing all RVV permutation instructions efficiently, regardless of their control information structure. This approach minimizes area and hardware costs while ensuring single-cycle execution for short vector machines (up to 256 bits) and enabling efficient pipelining for longer vectors. The proposed design is integrated into an open-source RISC-V vector processor and implemented at 7 nm using the OpenRoad physical synthesis flow. Experimental results validate the efficiency of our unified vector permutation unit, demonstrating that it only incurs 1.5% area overhead to the total vector processor. Furthermore, this area overhead decreases to near-0% as the minimum supported element width for vector permutations increases.
Problem

Research questions and friction points this paper is trying to address.

Efficient execution of RISC-V vector permutation instructions
Unified datapath for diverse permutation control mechanisms
Minimizing hardware cost while meeting fixed-latency requirements
Innovation

Methods, ideas, or system contributions that make the work stand out.

Unified microarchitecture for RVV permutation instructions
Single-cycle execution for short vector machines
Minimal area overhead with efficient pipelining
🔎 Similar Papers