-
Updated
Nov 29, 2020 - C++
parallel-computing
Here are 1,178 public repositories matching this topic...
-
Updated
Nov 17, 2020 - Python
-
Updated
Oct 11, 2020 - Python
-
Updated
Jan 17, 2020
-
Updated
Dec 4, 2017 - Rust
-
Updated
Nov 13, 2020 - C
-
Updated
Aug 28, 2020 - C++
-
Updated
Oct 19, 2020 - Python
-
Updated
Nov 29, 2020 - Java
-
Updated
Nov 27, 2020 - Nim
-
Updated
Nov 27, 2020 - Python
-
Updated
Nov 28, 2020 - R
Almost all of Kokkos should be noexcept
, but let's break it up into pieces that can be tackled in reasonable-sized issues. This one is the most urgent.
When computing the isosurface, when 4 simplex edges crosses the isosurface, we add 2 triangles to the isosurface triangulation.
Right now we add these arbitrarily (in these 3 lines) but we should add them so that the curvature is minimized.
The current state o
-
Updated
Nov 27, 2020 - C++
-
Updated
Nov 23, 2020 - Python
-
Updated
Nov 28, 2020 - C++
-
Updated
Aug 31, 2020 - JavaScript
-
Updated
Oct 1, 2020 - C++
-
Updated
Sep 8, 2017 - JavaScript
-
Updated
Nov 27, 2020 - Fortran
-
Updated
Nov 10, 2020 - Python
-
Updated
Oct 28, 2020 - Python
-
Updated
Nov 28, 2020 - Haskell
-
Updated
Oct 5, 2017 - Julia
-
Updated
Nov 27, 2020 - C
-
Updated
Oct 30, 2020 - C++
-
Updated
Oct 23, 2020 - C++
Improve this page
Add a description, image, and links to the parallel-computing topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the parallel-computing topic, visit your repo's landing page and select "manage topics."
The standard accelerate test suite, used by all the backends, can be quite slow. Several of the tests are significantly slower than the others, for example segmented folds and scans, which I believe is because the reference implementations are very inefficient. Writing some more efficient reference implementations (e.g. using
Data.Vector.Unboxed
) should help speed things up.