-
Updated
Aug 31, 2020 - C++
parallel-computing
Here are 1,117 public repositories matching this topic...
-
Updated
Aug 24, 2020 - Python
-
Updated
Aug 4, 2020 - Python
-
Updated
Jan 17, 2020
-
Updated
Dec 4, 2017 - Rust
-
Updated
Aug 22, 2020 - C
-
Updated
Aug 28, 2020 - C++
-
Updated
Jun 27, 2020 - Python
-
Updated
Aug 31, 2020 - Java
-
Updated
Aug 11, 2020 - Nim
-
Updated
Sep 1, 2020 - Python
-
Updated
Sep 2, 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
Sep 2, 2020 - Python
-
Updated
Sep 3, 2020 - C++
-
Updated
Aug 31, 2020 - JavaScript
-
Updated
Sep 3, 2020 - C++
-
Updated
Jun 23, 2020 - C++
-
Updated
Sep 8, 2017 - JavaScript
-
Updated
Sep 2, 2020 - Fortran
-
Updated
Aug 11, 2020 - Python
-
Updated
Aug 27, 2020 - Python
-
Updated
Aug 29, 2020 - Haskell
-
Updated
Oct 5, 2017 - Julia
-
Updated
Aug 24, 2020 - C
-
Updated
Aug 7, 2020 - C++
-
Updated
Jul 31, 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.