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

HPCTransCompile: An AI Compiler Generated Dataset for High-Performance CUDA Transpilation and LLM Preliminary Exploration

HPCTransCompile: An AI Compiler Generated Dataset for High-Performance CUDA Transpilation and LLM Preliminary Exploration

chemtrain: Training Molecular Dynamics Potentials in JAX

chemtrain-deploy: A parallel and scalable framework for machine learning potentials in million-atom MD simulations

microSYCL: SYCL micro-benchmarks repository

Exploring SYCL as a Portability Layer for High-Performance Computing on CPUs

XaaS containers

Acceleration as a Service (XaaS) Source Containers

SYCL Container

Exploring SYCL for batched kernels with memory allocations

CASS: Cuda-Amd aSSembly

CASS: Nvidia to AMD Transpilation with Data, Models, and Benchmark

Cluser of smartphones for edge computing application using TensorFlow

Low-cost edge computing using upcycled smartphones

CFAL-bench

Comparing Parallel Functional Array Languages: Programming and Performance

Efficient Graph Embedding at Scale: Optimizing CPU-GPU-SSD Integration

Efficient Graph Embedding at Scale: Optimizing CPU-GPU-SSD Integration

Can Large Language Models Predict Parallel Code Performance?

Can Large Language Models Predict Parallel Code Performance?

See all packages

* * *

* * *

HGPU group © 2010-2025 hgpu.org

All rights belong to the respective authors

Login | Sitemap | Feedback | Policy

Contact us:

contact@hpgu.org