chad-fast/bench, branch masterAn implementation of CHAD, towards performance
https://git.tomsmeding.com/chad-fast/atom?h=master2025-11-10T20:57:54ZUse ImportQualifiedPost2025-11-10T20:57:54ZTom Smedingtom@tomsmeding.com2025-11-10T20:57:54Zurn:sha1:57eb321eaeabc53c8c8b83d0554d8a8cca6eed76Move module hierarchy under CHAD.2025-11-10T20:50:25ZTom Smedingtom@tomsmeding.com2025-11-10T20:49:45Zurn:sha1:174af2ba568de66e0d890825b8bda930b8e7bb96test: Proper intermixing of GCC warnings with test output2025-11-03T22:06:55ZTom Smedingtom@tomsmeding.com2025-11-03T21:43:40Zurn:sha1:477b1b0481579519f26153c729daa6a041ed945dAdd uniform-tree test and benchmark2025-10-23T21:43:54ZTom Smedingtom@tomsmeding.com2025-10-23T21:43:54Zurn:sha1:1adad63b14aa8d13295fb0d68fbdc8ab988775b2
We need an optimisation that detects replicate-like behaviour and turns
it into actual replicates, which should then be fused away. The problem
is exhibited by this function exUniformFree.
bench: Simplify before differentiating2025-10-21T20:45:17ZTom Smedingtom@tomsmeding.com2025-10-21T20:45:17Zurn:sha1:c50aecbb209bb99da074b6c6911b672d0f1d1388Add pruneExpr to benchmarks2025-10-16T13:44:20ZTom Smedingtom@tomsmeding.com2025-10-16T13:44:20Zurn:sha1:15d586515dea0b352be8b71ea9bade3ae2389784
neural/default neural/accum gmm/default gmm/accum
before 157.1 μs 117.9 μs 2.087 ms 2.040 ms
after 106.6 μs 107.0 μs 1.931 ms 1.780 ms
I call that a win!
Complete monoidal accumulator rewrite2025-04-29T13:54:12ZTom Smedingtom@tomsmeding.com2025-04-29T13:54:12Zurn:sha1:3fd8d35cca2a23c137934a170c67e8ce310edf13Benchmark Compile, not Interpreter2025-03-30T09:18:16ZTom Smedingtom@tomsmeding.com2025-03-30T09:17:22Zurn:sha1:83fdbd9a6103376213d4fc8b62bfec22a2d2b658WIP accum top-level args2024-11-26T14:25:13ZTom Smedingtom@tomsmeding.com2024-11-26T14:25:13Zurn:sha1:ae2b1b71a91d60d3bd1dfb21fce98c05c1a4fcbbBenchmark with accum-mode bound variables2024-11-23T11:10:53ZTom Smedingtom@tomsmeding.com2024-11-23T11:10:53Zurn:sha1:84f6845803511e24770fbf1dffc6a9a007371edf