-
**Description**
There are a couple of improvements we need to make to the BayesQuasi2 and BayesStretch2 algorithms which use the quickBayes package, so that they have similar features to the BayesQuas…
-
Notably, the graph traversal algorithms can be parallelized (especially the BFS-like ones) by having multiple threads pull from a queue of objects to traverse. Possibly the heap index building can be …
-
Cache-oblivious algorithms automatically take advantage of all levels of caches present
in the system (register set, L1/L2/L2, disk) by recursively sub-dividing the problem
into smaller parts:
http://…
-
Coherence ( in the sense of https://www.netlib.org/scalapack/slug/node134.html ) between processors/groups for iterative algorithms like MD or mixing.
-
I have a use case where there are multiple indexes on one device. The queries are also batched. For example, if there are N indexes, the query matrix has shape `(N, Q, D)`. The expected return reshape…
-
As already mentioned at #23 , The cost of creating/destroying thread is expensive.
C++17 introduce C++17 parallel algorithms. MSVC's implementation use threadpool. So, instead of adapting Intel TBB(#…
-
Originating from #98, it was discussed that we probably should parametrize the library according to a particular metric. Even if not all algorithms may work with arbitrary metrics, it would surely be …
-
| | |
| --- | --- |
| Bugzilla Link | [48557](https://llvm.org/bz48557) |
| Version | unspecified |
| OS | Linux |
## Extended Description
For example:
Mandates: All of
— binary_op(init, init),
…
-
# Feature request:
Investigate whether the parallel linear solvers that are used in the elliptic solver should switch to an inbox control flow. Currently they do this:
- An element action contribu…
-
When developing algorithms, a line of code such as:
`IntMatrix1D v = IntFactory1D.dense.make(6,1);`
Gives the following exception when executed:
```
Exception in thread "main" java.lang.NoSu…