Sep 2026· IEEE International Conference on Application-Specific Systems, Architectures, and Processors· pp. 177-178· 3 citations· 8 references
Abstract
Modern systems-on-chip (SoCs) rely on heterogeneous accelerators for performance scaling. Memory access is a critical bottleneck, but the complexity of cache coherence and nuances of weak memory consistency models (which may vary from system to system) represent a significant designer burden to every load/store unit that must be created. This paper proposes a single shared load/store unit (LSU) to abstract away system details and offer a simplified interface for designers. We evaluate the shared LSU on an AMD ZCU104 FPGA platform using a soft RISC-V processor through two distinct case studies: (1) a homogeneous system using multiple vector processor cores, and (2) a heterogeneous system combining a vector core with a GEMM systolic array. Results demonstrate that the shared LSU reduces duplicated LSU logic and integration overhead while enabling significant performance gains, achieving a $\mathbf{2. 6 6} \times$ speedup in the homogeneous vector configuration over a single-vector baseline, and a $\mathbf{1 0. 9 3} \times$ speedup for neural network inference in the heterogeneous configuration over a scalar baseline.
Dolunay is introduced, a RISC-V-based Independent Thread Scheduling (ITS) SIMT accelerator that employs a cooperative multitasking model and explicit synchronization barriers at the hardware-level, and provides the forward-progress guarantees necessary to implement starvation-free algorithms.
Ahmet Can, Erkan Uslu· WiPiEC Journal - Works in Pr...· 0 citations
A multi-cluster architecture that replaces inter-cluster communication with localized data replication within ScratchPad Memories (SPMs) is introduced, creating a critical architectural trade-off between the data replication overhead required by overlapping-footprint kernels and the routing delays of larger clusters.
Chanon Khongprasongsiri, P. Tanguy, Kevin J. M. Martin et al.· IEEE International Conferenc...· 0 citations
PlastiCache represents an accelerator memory stream as address–time pairs and extends reuse-distance analysis with predicted service intervals for outstanding misses, and targets early-stage cache design-space exploration by preserving the relative ordering of candidate configurations.
Lingfeng Pei, Wei Siew Liew, Udaree Kanewala et al.· ACM Transactions on Architec...· 0 citations
Heterogeneous accelerator architectures offer an efficient path to performance for compute-intensive workloads. However, full-stack integration remains difficult. We present EAAC (Extensible Accelerator Architecture), a flexible and extensible compiler and hardware architecture designed to lower the overhead of hardwar...
Karl Herman Krause, Emad Jacob Maroun, Martin Schoeberl· 0 citations
The use of custom instructions is a common approach to accelerate domain-specific problems. However, it is difficult to reuse instruction-based accelerators in new systems — for example, if multiple accelerators from past systems are merged into a single SoC, they may have colliding opcodes. Fixing this requires opcode...
Brandon Freiberger, Joseph Maheshe, J. Gray et al.· IEEE International Conferenc...· 0 citations
Evaluation using cycle-accurate hardware-software co-simulation demonstrates that CHIPSMORE effectively sustains high throughput across varying model sizes, context lengths, and batch sizes while maintaining favorable power scaling.