Searcharxiv⌕ Search

arXiv subjects

Alexander Fell

Publications and source records attributed to Alexander Fell.

3 recordsLinked to original sources

Accelerating Direct Sparse Solvers with Graph Computing Accelerators

Solving large sparse linear systems by Gaussian elimination is a challenging computational task due to the introduction of non-zero elements, or fill-in. Practitioners use heuristics such as the nested dissection reordering algorithm to try to reduce fill-in. In practice, reordering codes do not achieve the same parallel scaling as factorization, nor can they exploit AVX instructions or GPUs. Thus, reordering can be the primary runtime bottleneck in large-scale computer-aided engineering applications. We consider the use of a novel accelerator, the UpDown system, to accelerate the METIS multilevel nested dissection reordering algorithm. The UpDown system is designed for a broad class of graph computing and irregular algorithms. We report results for small-scale UpDown systems that will be available commercially in 2027, using validated simulation and FPGA emulation platforms. Our findings indicate that small UpDown systems can speed up METIS by two-orders of magnitude versus a single CPU. Compared to ParMETIS on hundreds of MPI ranks, we anticipate the same small UpDown systems offer speedups of 4 - 7, providing the potential to significantly speed finite element simulations

cs.DC↗

Fine-Grained Parallel Graph Algorithms Can Be Both Fast and Scalable

Making graph algorithms fast and scalable on traditional architectures and GPUs often involves breaking them into large, coarse-grained computational blocks that access similar regions of memory. We show that graph algorithms, which have tremendous vertex- and edge-level parallelism, can be scaled as fine-grained programs on suitable architectures. Specifically, we investigate graph algorithms on the UpDown architecture and show how this many-threaded, cache-less architecture enables simple, fine-grained parallel graph algorithms to be both fast and scalable. Single-node UpDown performance is 28x (geomean) over an H200 GPU, and that same program scales to 1000's of nodes. We evaluate the system three ways: simulation, analytical projection models, and selected validation studies at scale (simulation of 16,384 UpDown nodes, using 256 supercomputer nodes). These results show the UpDown system can achieve 680K giga-traversed edges per second (GTEPS) for PageRank and 989K GTEPS BFS, exceeding prior results significantly.

cs.DC↗

CIDPro: Custom Instructions for Dynamic Program Diversification

Timing side-channel attacks pose a major threat to embedded systems due to their ease of accessibility. We propose CIDPro, a framework that relies on dynamic program diversification to mitigate timing side-channel leakage. The proposed framework integrates the widely used LLVM compiler infrastructure and the increasingly popular RISC-V FPGA soft-processor. The compiler automatically generates custom instructions in the security critical segments of the program, and the instructions execute on the RISC-V custom co-processor to produce diversified timing characteristics on each execution instance. CIDPro has been implemented on the Zynq7000 XC7Z020 FPGA device to study the performance overhead and security tradeoffs. Experimental results show that our solution can achieve 80% and 86% timing side-channel capacity reduction for two benchmarks with an acceptable performance overhead compared to existing solutions. In addition, the proposed method incurs only a negligible hardware area overhead of 1% slices of the entire RISC-V system.

cs.CR↗