high performance computing on graphics processing units: hgpu.org

hgpu.org » ATI Mobility Radeon HD 5870

Fast Parallel Algorithm for Enumerating All Chordless Cycles in Graphs

Elisangela Silva Dias, Diane Castonguay, Humberto Longo, Walid Abdala Rfaei Jradi, Hugo A. D. do Nascimento

View

Tags: Algorithms, ATI, ATI Mobility Radeon HD 5870, Computer science, Graph theory, OpenCL

October 22, 2014 by hgpu

Ray Traced Rendering Using GPGPU Devices

Coby Soss

View

Tags: ATI, ATI Mobility Radeon HD 5870, Computer science, OpenCL, Raytracing, Rendering, Thesis

September 11, 2014 by hgpu

* * *

Rodinia Benchmarks for DPC++

Evaluation of Intel’s DPC++ Compatibility Tool in heterogeneous computing

DCA++: a state of the art implementation of the dynamical cluster approximation

Optimizing the Performance of Parallel and Concurrent Applications Based on Asynchronous Many-Task Runtimes

tntorch - Tensor Network Learning with PyTorch

tntorch: Tensor Network Learning with PyTorch

Open-source FPGA-ML codesign for the MLPerf Tiny Benchmark

Open-source FPGA-ML codesign for the MLPerf Tiny Benchmark

MapReduce for Counting Word Frequencies with MPI and GPUs

MapReduce for Counting Word Frequencies with MPI and GPUs

CoDL: Efficient CPU-GPU Co-execution for Deep Learning Inference on Mobile Devices

CoDL: Efficient CPU-GPU Co-execution for Deep Learning Inference on Mobile Devices

SYCLCOMP Utilities

On the Compilation Performance of Current SYCL Implementations

M1 GPUs for (scientific) computations in C++

Seamless GPU acceleration for C++ based physics with the Metal Shading Language on Apple’s M series unified chips

CUB: Cooperative primitives for CUDA C++

Onesweep: A Faster Least Significant Digit Radix Sort for GPUs

Simulator and workload generator for Edge-to-Cloud environments

FELARE: Fair Scheduling of Machine Learning Applications on Heterogeneous Edge Systems

See all packages

* * *

* * *

HGPU group © 2010-2022 hgpu.org

All rights belong to the respective authors

Login | Sitemap | Feedback | Policy

Contact us: