OpenCL integration for Python, plus shiny features

A code generator for array-based code on CPUs and GPUs

Fast differential coding functions (using SIMD instructions)

List data structure supporting prefix sums

MIT-licensed stand-alone CUDA utility functions.

Prefix-Sum data structures in C++. This is the code for the paper "Practical Trade-Offs for the Prefix-Sum Problem" by Giulio Ermanno Pibiri and Rossano Venturini. https://arxiv.org/abs/2006.14552

Writeup for the Algo problem, Prefix Sums, from ByteCTF, hosted by Byte Club.

A library of common OpenCL operations.

A library for aggregating values assigned to indices by slices and the other way around

It is a data structure used to update and query a 2D matrix in a better way because of its good time and space complexities.

A simple parallel algorithm for computing prefix sum of an array implemented in C#

HPC - OpenCL: work efficient scan implementation

Collections and related data structures

A set of parallel programming primitives written in C++ and OpenMP

BlackBox: CakeSort's comparative benchmark test tool

Implementation of several algorithms in OpenCL

Parallelized histogram equalization for gray scale images using GPUs in CUDA C++ in a consumer-producer aproach.

Algorithmia: Backtracking, Prefix Sums problems, Multiple Knapsack problem (Dinamyc programing). Adapted BFS, Kruskal, Dijkstra implementations. Heuristics, Greedy algorithms, k-opt search.

Belloch Prefix Sum Implementation using CUDA

Paralelní a distribuované algoritmy - Projekt - Viditelnost

A Parallel Implementation Of Array Prefix Sum Using Java