high performance computing on graphics processing units: hgpu.org

hgpu.org » Suffix Tree

High performance pattern matching and data remanence on graphics processing units

X. Bellekens

View

Tags: Aho Corasick, Algorithms, amazon, BMH, CUDA, Digital Forensic, forensic, GPU, pattern matching, PFAC, remanence, Sequence matching, String matching, Suffix Tree, Tesla K20, Tesla K20c

November 22, 2016 by xhgpu

HipKittens: Fast and Furious AMD Kernels

HipKittens: Fast and Furious AMD Kernels

Fortran xDSL dialects

An MLIR pipeline for offloading Fortran to FPGAs via OpenMP

mt4g: Memory Topology 4 GPUs

MT4G: A Tool for Reliable Auto-Discovery of NVIDIA and AMD GPU Compute and Memory Topologies

Falcon: GPU-Based Floating-point Adaptive Lossless Compression

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data

CudaForge: An Agent Framework with Hardware Feedback for CUDA Kernel Optimization

CudaForge: An Agent Framework with Hardware Feedback for CUDA Kernel Optimization

LC Framework

Characterizing the Performance of Parallel Data-Compression Algorithms across Compilers and GPUs

pplx-garden: Perplexity open source garden for inference technology

RDMA Point-to-Point Communication for LLM Systems

OpScanner

A Study of Floating-Point Precision Tuning in Deep Learning Operators Implementations

Atlas CLI: Machine Learning (ML) Lifecycle & Transparency Manager

Scalable GPU-Based Integrity Verification for Large Machine Learning Models

transformers_tvm: Implementation of Encoder Decoder transformer on TVM

Enhancing Transformer Performance and Portability through Auto-tuning Frameworks

See all packages

* * *

* * *

HGPU group © 2010-2025 hgpu.org

All rights belong to the respective authors

Login | Sitemap | Feedback | Policy

Contact us: