-
This might go against the whole point of ISPC, but something that would be useful is allowing the usage of vendor-specific intrinsics to facilitate specialized instructions of the "This is so much fas…
-
Hi @mikemccand !
I recently discovered your blog, and I have to say I am a *huge* fan.
I do not (yet) have decent knowledge in Lucene (in fact I have never used it) but it's a technology I use indir…
-
### Bug description
I've recently been trying to understand how the type checker reasons about the equality of types. I've noticed a few inconsistencies and potential bugs. These are demonstrated b…
-
I've noticed that multi-threading is handled in two distinct ways across the library. In some places, we are using dask (`restoration._cycle_spin`, `util.apply_parallel`), while others use OpenMP (in …
-
There are two lowering paths from CIR:
1. CIR to LLVM IR dialect
2. CIR to MLIR in-tree dialects
Most effort has been into (1), which the list below doesn't really apply. Here's a the list of m…
-
Right now we have an explicit SIMD interface via `ShareArray` which implements efficient batch reconstruction. However, this is inconvenient since you have to commit to all or nothing and explicitly p…
-
Hello, I just wanted to let you know about one Rescue Prime Hash implementation I wrote using `portable-simd` or more specifically `std::simd` on Rust Nightly.
Here it's: https://github.com/itzmean…
-
Close to the currently implemented on block-basis in MDegrainN but here on per-sample basis: (for C-implementation see 2 loops from https://github.com/DTL2020/mvtools/blob/a1989c8fc9092e7c3f8713dc1924…
-
[Godbolt link](https://godbolt.org/z/oh87najaG)
The following functions can all use, or should be directly translated to, the orc.b instruction:
```zig
// If the lowest bit of each byte is 1, s…
-
One of the requirements for the Computer Language Benchmarks Game is that programs are supposed to be using the same (rough) algorithm. Are these benchmarks going to have a similar requirement?
Thi…
JZerf updated
2 years ago