Underfox

Underfox

@underfox3.bsky.social

Physicist, Telecom Engineering lover, HPC Enthusiast. Prog Rock/Metal fan. --- Independent tech analyst focused on semiconductors, patent analysis and emerging technologies.

816 followers18 following2.3K posts

In this paper is presented CHIPSMORE, a multi-mode and multi-request CIM accelerator for LLM inference across diverse operating scenarios, including base-mode execution, LoRA adaptation, varying context lengths, and concurrent multi-request serving. arxiv.org/pdf/2608.30509

View full thread

Finally, a non-replicated multi-request execution pipeline exploits request-level parallelism without duplicating pretrained weights, while a state-aware resource reconfiguration mechanism selectively retains runtime states and power-gates inactive resources.

The simulation results show that CHIPSMORE achieves up to 2.38× higher throughput and 27× higher energy efficiency on Mistral-7B inference compared with Nvidia H100 while eliminating weight replication for multi-request serving.

In this paper is presented CHIPSMORE, a multi-mode and multi-request CIM accelerator for LLM inference across diverse operating scenarios, including base-mode execution, LoRA adaptation, varying context lengths, and concurrent multi-request serving. arxiv.org/pdf/2608.30509

CHIPSMORE employs heterogeneous processing elements consisting of resistive RAM analog CIM and static RAM digital CIM interconnected through a programmable Inter-PE computational network.

A composable hierarchical KV memory scheme dynamically allocates router scratchpad, SRAM-DCIM, and eDRAM resources according to workload requirements, enabling scalable support for long-context and batched inference.

In this paper is introduced the first auto-tuning framework for Julia GPU kernels as an accessible Julia package, enabling systematic auto-tuning of hardware-agnostic kernels to target a wide variety of platforms, such as NVIDIA, AMD, Intel, and Apple. arxiv.org/pdf/2608.21227

The evaluation results on a GPU kernel in the NextLA linear algebra library show that this approach achieve performance improvements of 3× to 7× over median parameter configurations.

NeuroPrefetcher makes weight movement explicit, predicting which sparse weights the next token will need, compares that predicted set against the weights already resident, and fetches only the difference in advance.

The evaluation results show that, in the memory-constrained regime, NeuroPrefetcher achieves 7.9–12.0x speedup over llama.cpp by replacing page-fault-driven whole-weight movement with application-scheduled sparse-row reads.

View full thread

These metrics are integrated into a multi-objective ranking framework and coupled with GPR to identify process–performance correlations and predict unexplored fabrication recipes within the experimental process space.

The experimental results shows close agreement with ML predictions, thus demonstrating the framework’s ability to efficiently guide gatestack optimization through iterative experimental feedback.

The introduced transition voltage metric, V_Trans, complements conventional transistor metrics and enables more comprehensive process performance optimization.

View full thread

2 - High-efficiency compute workloads achieve exceptional dispatch utilization but suffer corresponding SMT contention at scale; 3 - Memory bandwidth-bound floating-point workloads exhaust DRAM bandwidth at scale while exhibiting low L3 hit rates even at single-copy.

Finally, the results show that the scale-dependent effects, including SMT dispatch contention causing throughput reduction and L3 capacity interference, emerge only at full system utilization.

View full thread

The multi-lens analysis reveals distinct behavioral clusters: 1 - Front-end control-flow-dominated integer workloads stress branch predictor throughput rather than accuracy;

The proposed characterization employs a multi-perspective methodology covering pipeline efficiency, control-flow behavior, cache hierarchy pressure, and instruction composition, analyzing both SPECrate and SPECspeed suites.

View full thread

The results also showing that usability may be driven by the combination of automatic detection and clear visualization of gaps, as well as user control over AI suggestions rather than prediction accuracy alone.

GapFill enables automatic gap detection with circular highlights, along with temporary filling based on color suggestions using a domain-specific deep learning method. By hovering over a highlight, the corresponding region can be magnified for quick inspection without zooming in.

The evaluation results with with 13 professional colorists demonstrated significant efficiency gains in gap-filling tasks compared to existing tools.

In this paper is presented a benchmark of the latest RVV 1.0-capable hardware (SiFive X280, SpacemiT X60 (K1) and X100/A100 (K3), and T-Head C920v2 (Sophon SG2044)), using standard HPC benchmarks and synthetic workloads, comparing them to NVIDIA Grace. #HPC arxiv.org/pdf/2608.28097

View full thread

On the other hand, the FFTW evaluation highlights the distinct advantages of out-of-order execution, favoring the Sophon SG2044 and SpacemiT X100 cores for complex memory access patterns.

In this paper is presented a benchmark of the latest RVV 1.0-capable hardware (SiFive X280, SpacemiT X60 (K1) and X100/A100 (K3), and T-Head C920v2 (Sophon SG2044)), using standard HPC benchmarks and synthetic workloads, comparing them to NVIDIA Grace. #HPC arxiv.org/pdf/2608.28097

View full thread

These architectural limitations become apparent in the BLAS evaluation, where most platforms struggle to overcome the memory wall, yielding compute efficiencies between 30% and 50%.

The SpacemiT K3, however, emerges as a major exception and represents a profound generational leap over the preceding K1. By significantly improving its vector front-end and memory bandwidth, the K3 achieves compute efficiencies of up to 80% on both the X100 and A100 cores.

In this paper is presented a benchmark of the latest RVV 1.0-capable hardware (SiFive X280, SpacemiT X60 (K1) and X100/A100 (K3), and T-Head C920v2 (Sophon SG2044)), using standard HPC benchmarks and synthetic workloads, comparing them to NVIDIA Grace. #HPC arxiv.org/pdf/2608.28097

The results show that while RVV 1.0 delivers significant performance improvements over scalar execution, hardware-specific implementation challenges remain.

View full thread

The results also show that the three GPU vendors can now GPU-accelerate pure Fortran (zero directives), but that manual data movement directives can help with performance and compatibility.

Overall, this work demonstrated that there is rapid advancement toward making GPU-accelerated scientific HPC code performance portable using the Fortran standard language.

View full thread

On Intel GPUs, the pure Fortran code ran over 50% slower, however, the Intel unified memory feature is extremely new and is expected to improve with subsequent compiler updates.

The proposed code uses the Fortran language’s do concurrent loop construct, which allows the compilers to parallelize the loop on both multi-threaded CPUs and GPUs. Through the use of GPU-aware MPI, it was also able to run the code across multiple GPUs.

View full thread

For large-scale problems, a diagonal-block decoupling optimization was introduced with an O(I_B) shared-memory footprint for diagonal block inversion, enabling adaptive block size selection based on matrix scale and hardware characteristics.

The evaluation results on NVIDIA A100, H800, and Hygon DCU Z100 show that HSMA-TRSM achieves peak speedups of 2.05× over cuBLAS and 2.06× over rocBLAS.

For the small-scale regime, a pipelined compute-memory overlap mechanism was designed through loop unrolling and instruction reordering, and a dual thread-group seven-stage pipeline strategy was proposed to address shared memory constraints for double complex types.

FIBER introduces a new parallel execution instance, the fiber, analogous to a SIMT thread but without private register ownership, carrying only minimal state. Unlike SIMT threads, fibers access an SM’s register file through a shared view.

The evaluation results show that FIBER delivers 2.25×, 1.8×, and 2.09× end-to-end speedup under typical mixed-precision LLM serving scenarios against Ampere, Hopper, and Blackwell baselines, with kernel-level speedups of up to 2.49×.

In this paper is introduced a bilingual DSL for modeling compute kernels within a generic solver for hyperbolic PDEs, enabling programmers to express their numerics in an abstract manner in Python, with the physical PDE terms still in C, C++, or SymPy. arxiv.org/pdf/2608.19273

View full thread

It's important to note that this approach yields sufficiently efficient code, but does not yet unlock the full potential of a compiler-/DSL-based kernel encoding.

The major gains that this approach introduces so far are a strict separation of concerns, support for rapid prototyping of novel numerics, cleaner code, and seamless support for both CPU and GPU kernels.

In this paper is introduced a bilingual DSL for modeling compute kernels within a generic solver for hyperbolic PDEs, enabling programmers to express their numerics in an abstract manner in Python, with the physical PDE terms still in C, C++, or SymPy. arxiv.org/pdf/2608.19273

The proposed approach keeps the numerical representation and the physics implementation separate for as long as possible, while delegating optimization to the compiler through existing MLIR optimization passes.