Neil Henning

23 Followers
416 Following
674 Posts
Verse @ Epic, ex-Burster @ Unity, ex-RTG @ AMD, ex-Vulkanite @ Codeplay
Websitehttps://www.neilhenning.dev
GitHubhttps://github.com/sheredom
Next step I'm implementing matrix * matrix for large matrices with .NET 7 SIMD, starting to be 30-40% faster than Tensorflow, which is 😎 but I'm still 30-40% slower than MKL! 😅
Not that bad for a first try, but I will have to dig further if 1) I can optimize things further with some fancy AVX2 instructions, 2) If I can improve cache locality usage when going //
Storyteller is an amazing little game. Not long, but a lovely concept and I had a lot of fun playing! https://store.steampowered.com/app/1624540/Storyteller/
Storyteller on Steam

Storyteller is an award-winning puzzle game about building stories. Start with a title, settings and characters and create a story that fits the story’s description. Play with stories of love, intrigue, crime, monsters, betrayal, and more!

It’s been years in the making and we’re finally ready to show the world: don’t miss Yeoul’s EuroLLVM keynote, “-fbounds-safety: enforcing bounds safety for production C code”! https://discourse.llvm.org/t/the-2023-eurollvm-program/69514
The 2023 EuroLLVM Program

The LLVM Foundation is pleased to announce the 2023 EuroLLVM Program! As a reminder, Early Bird Registration ends on April 10th. Keynote Speaker Order out of Chaos, The LLVM Release Process. Tobias Hieta “-fbounds-safety”: Enforcing bounds safety for production C code Yeoul Na Technical Talk Speaker An example of data flow analysis in MLIR Tom Eccles MLIR-based offline memory planning and other graph-level optimizations for xcore.ai Deepak Panickal A Rusty CHERI: Th...

LLVM Discussion Forums
@logicalerror @aras @gekido the process creep completely suffocated me to be honest. I lost the will to do anything under it.
Friday fun playing around with #fortnite #uefn running round a scan the Natural History Museum (inspired by tweet below). This platform is insanely good!
@dneto @gfxstrand nearly did that in my youth - and if I had I would be blind now (had undiagnosed Keratoconus!). So glad I was too poor to afford it at the time!

@xoofx I think when I did it I used Robin Green's 2003 GDC talk approach, but turning log2 into log, and then using:

ln(x) = ln(2n × f )
= ln(2n )+ ln f
= nln2+ln f

I had to avoid a divide when I did this 10 years ago because it was slow on the GPU I was working on I remember!

@xoofx what did you use to do the range reduction? I vaguely remember the last time I did a low ULP variant of these years ago there were some tricks needed to get the input down to the range for the polynomial approximation!
FUN FACT about Verse now that UEFN is out: the floating point is not quite IEEE-754 double, but it's close. Specifically the functional logic programming part of Verse (which is to say, its foundation) requires a few axioms that IEEE floats don't satisfy, so the float semantics are slightly tweaked.
@MouseByTheSea thanks man!