A library of common OpenCL operations.
-
Updated
Sep 10, 2016 - C
A library of common OpenCL operations.
Fast differential coding functions (using SIMD instructions)
List data structure supporting prefix sums
A library for aggregating values assigned to indices by slices and the other way around
Belloch Prefix Sum Implementation using CUDA
HPC - OpenCL: work efficient scan implementation
Implementation of several algorithms in OpenCL
Collections and related data structures
Algorithmia: Backtracking, Prefix Sums problems, Multiple Knapsack problem (Dinamyc programing). Adapted BFS, Kruskal, Dijkstra implementations. Heuristics, Greedy algorithms, k-opt search.
A Parallel Implementation Of Array Prefix Sum Using Java
Paralelní a distribuované algoritmy - Projekt - Viditelnost
A set of parallel programming primitives written in C++ and OpenMP
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#
MIT-licensed stand-alone CUDA utility functions.
Writeup for the Algo problem, Prefix Sums, from ByteCTF, hosted by Byte Club.
A repository for my ongoing preparation for Software Engineering Interviews.
BlackBox: CakeSort's comparative benchmark test tool
Parallel and Distributed Algorithms - Project - Line-of-Sight
AUT Multicore Programming Course Materials
Add a description, image, and links to the prefix-sum topic page so that developers can more easily learn about it.
To associate your repository with the prefix-sum topic, visit your repo's landing page and select "manage topics."