Viewing profile — danlark1

Congrats, that's incredible news. Watched apavlo@'s lectures while studying in the university and finished my bachelor thesis implementing features and doing research at ClickHouse…

It's a somewhat known tradeoff, you can streamline and make the format friendlier to do memcpy which this library targets, the more memcpys you do, the faster it is overall to deco…

Surprisingly I didn't put 2023, it was merged with another submission possibly with the help of mods

Yes, sorry, it should be "disclosure"

Disclaimer: the author of the comment is the founder and CTO of ClickHouse

Great work! Popular narrative that NEON does not have a move mask alternative. Some time ago I published an article to simulate popular bit packing use cases with NEON with 1-2 ins…

I am the author of the optimization of partial sorting and selection in Clickhouse. It uses Floyd-Rivest algorithm and we tried a lot of different things back at the time, read [1]…

That's a difficult question. As I am working at Google I need to consult each open source I want to publish on my behalf. This does not involve contributing to the list of the appr…

For compiler-rt it is Apache 2.0 license https://github.com/llvm/llvm-project/blob/master/compiler-rt...

Hi, I thought that this is not the most interesting part of all the benchmarks, for example, all we need to test that with the quotient and the remainder: dividend = quotient * div…

Hi, I believe they can be done for 32 bit platforms also with the multiword division in Knuth https://skanthak.homepage.t-online.de/division.html what I've chosen for fallback if n…

Hi everyone, the author is here. Yes, I believe the title should be changed to `Optimizing 128-bit Division` Yet, I was not expecting it to be here. Overall, I put some knowledge h…