flamethrower
Halide
flamethrower | Halide | |
---|---|---|
3 | 43 | |
313 | 5,714 | |
0.3% | 0.5% | |
3.7 | 9.5 | |
7 months ago | 3 days ago | |
C++ | C++ | |
Apache License 2.0 | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
flamethrower
-
Tool to Benchmark Self-Hosted DNS (DNS-over-TLS) ?
flamethrower: https://github.com/DNS-OARC/flamethrower
-
Recursive resolver for >3 million public queries per day?
If you're concerned about the tests I'd recommend https://github.com/DNS-OARC/flamethrower
- Tools to flood DNS/DNSSEC queries?
Halide
-
Show HN: Flash Attention in ~100 lines of CUDA
If CPU/GPU execution speed is the goal while simultaneously code golfing the source size, https://halide-lang.org/ might have come in handy.
- Halide v17.0.0
-
From slow to SIMD: A Go optimization story
This is a task where Halide https://halide-lang.org/ could really shine! It disconnects logic from scheduling (unrolling, vectorizing, tiling, caching intermediates etc), so every step the author describes in the article is a tunable in halide. halide doesn't appear to have bindings for golang so calling C++ from go might be the only viable option.
-
Implementing Mario's Stack Blur 15 times in C++ (with tests and benchmarks)
Probably would have been much easier to do 15 times in https://halide-lang.org/
The idea behind Halide is that scheduling memory access patterns is critical to performance. But, access patterns being interwoven into arithmetic algorithms makes them difficult to modify separately.
So, in Halide you specify the arithmetic and the schedule separately so you can rapidly iterate on either.
- Making Hard Things Easy
-
Deepmind Alphadev: Faster sorting algorithms discovered using deep RL
It is not the sorting per-se which was improved here, but sorting (particularly short sequences) on modern CPUs with really the complexity being on the difficulty of predicting what will work quickly on these modern CPUs.
Doing an empirical algorithm search to find which algorithms fit well on modern CPUs/memory systems is pretty common, see e.g. FFTW, ATLAS, https://halide-lang.org/
-
Two-tier programming language
Halide https://halide-lang.org/
- Best book on writing an optimizing compiler (inlining, types, abstract interpretation)?
-
Blog Post: Can You Trust a Compiler to Optimize Your Code?
It doesn’t apply in this case, but in general if you really want the best vectorization I would suggest using https://halide-lang.org instead of trying to coerce your compiler.
-
What would make you try a new language?
If we drop the "APL" requirement, wouldn't Halide fit your criteria for the third?
What are some alternatives?
c-ares - A C library for asynchronous DNS requests
taichi - Productive, portable, and performant GPU programming in Python.
PowerDNS - PowerDNS Authoritative, PowerDNS Recursor, dnsdist
futhark - :boom::computer::boom: A data-parallel functional programming language
ArrayFire - ArrayFire: a general purpose GPU library.
Image-Convolutaion-OpenCL
lunchtoast - A command-line tool for functional testing of console applications
TensorOperations.jl - Julia package for tensor contractions and related operations
triton - Development repository for the Triton language and compiler
ponyc - Pony is an open-source, actor-model, capabilities-secure, high performance programming language
qoi - The “Quite OK Image Format” for fast, lossless image compression
png-decoder - A pure-Rust, no_std compatible PNG decoder