KZhead

Make Your LINQ Up to 10x Faster!

Nick Chapsas
2024 ж. 28 Ақп.
51 623 Рет қаралды
Жүктеу

Use code MODULAR20 and get 20% off the brand new "Deep Dive into Modular Monoliths" course on Dometrain: dometrain.com/course/deep-div...
Become a Patreon and get special perks: / nickchapsas
Hello, everybody, I'm Nick, and in this video, I will show you how you can improve LINQ's performance in .NET by using hardware acceleration with a Nuget package called SimdLinq.
Give SimdLinq a star on GitHub: github.com/Cysharp/SimdLinq
Workshops: bit.ly/nickworkshops
Don't forget to comment, like and subscribe :)
Social Media:
Follow me on GitHub: github.com/Elfocrash
Follow me on Twitter: / nickchapsas
Connect on LinkedIn: / nick-chapsas
Keep coding merch: keepcoding.shop
#csharp #dotnet

Пікірлер

  • "... a bunch of advanced stuff which I don't understand" - love that honesty.

    @muhamedkarajic@muhamedkarajic2 ай бұрын

  • I like you change shirt and hairstyle for the ads

    @carlinhos10002@carlinhos100022 ай бұрын

    • Always

      @nickchapsas@nickchapsas2 ай бұрын

    • Helps skipping ahead to the end of the ad ;P

      @pavlindrom@pavlindrom2 ай бұрын

    • @@pavlindrom this guy living in 2034.

      @okmarshall@okmarshall2 ай бұрын

  • Always thought that one of the benefits of Linq was that the operations could be improved over time, without breaking the API.

    @nofatchicks6@nofatchicks62 ай бұрын

    • Yes, exactly this! Adding a 3rd party dependency is not what I would consider "making my LINQ faster." Beyond that, this seems to rely on SIMD, which might not work as expected if you are targeting some embedded systems or WASM.

      @josh_flash@josh_flash2 ай бұрын

  • Thank you Nick. Yes the min/max thing is really cool.

    @Kingside88@Kingside882 ай бұрын

  • That's pretty impressive that runtimes are getting that much smarter to handle basic operations that much quicker!

    @marketfinds@marketfinds2 ай бұрын

  • Yep, cool stuff. 7:28 What we see here looks more magical than it is. It's just some good old C style pointer arithmetic, wrapped in a bunch of dotnet helper methods, which look quite verbose compared to actual C code. Each ref variable is literally a pointer. The function works with these in the for loops. The code basically copies the Span data to the Vector, does the Sum calculation with that, and then copies the result back. But what I actually silently hope for with though is that all the methods like Select, Where and Aggregate will get efficient Span based versions as well in the future, so that we won't have loops at all, making C# code look a bit more like Rust code, which uses zero loops most of the time. So in other words, I believe in zero cost functional programming.

    @jongeduard@jongeduard2 ай бұрын

  • I learned about a very useful library I didn't know about, thank you.

    @sevketevli6927@sevketevli69272 ай бұрын

  • The need for all these specialized methods actually point to a weakness in the C#/.NET compiler. For example, if you write the simple for-loop example you used in C or C++, a compiler like gcc would automatically detect that it could be vectorized, and generate SIMD instructions during compilation, eliminating the need for writing specific specialized methods in the first place. I wish Microsoft spent more time optimizing it's compiler rather than essentially forcing people to come up with complex solutions to speed up your code, whereas a smart compiler could do all this for you. Optimization should be a big part of a compiler recognizing code patterns, rather than having the programmer coming up with ways to write more performant code.

    @tomwimmenhove4652@tomwimmenhove46522 ай бұрын

  • what are the breaking changes compared to the Linq implementation by MS?

    2 ай бұрын

  • Very informative. Thanks for sharing

    @mrsajjad30@mrsajjad302 ай бұрын

  • Wow! It took over 2500ns with LINQ on .NET 6. And since .NET 8 it is around 45x faster (57ns on my PC)? I would not believe if I would not run it myself locally.

    @pauljohnsonbringbackdislik1469@pauljohnsonbringbackdislik14692 ай бұрын

  • This is nice. Honestly this isn't going to be the bottleneck for most people though. Most people aren't calling Sum tens of thousands of times.

    @Daniel15au@Daniel15au2 ай бұрын

  • LongSum you say. Swedish has a word thats pronounced the same way and its Långsam. Difference is that långsam means slow ^^

    @L1da77@L1da772 ай бұрын

    • Pre 64 bit machines long addition was really slow, so it’s an apt name. They effectively took 4 times as long as a regular sum. Now with 64 bit, it’s effectively just a regular add. That said unless you were doing hundreds or thousands of them it probably didn’t matter much.

      @NickSteffen@NickSteffen2 ай бұрын

    • In German "langsam" means slow too 😁

      @KeyboardKrieger@KeyboardKrieger2 ай бұрын

  • An interesting benchmark to see would be how fast it is when doing these operations over data from a model object. Eg. You have a list of users and your want an average of their age, so you'd first have to select the age from the model and then do the average. How much faster would LinQ be then a loop then?

    @nocturne6320@nocturne63202 ай бұрын

    • It would be the exact same

      @danny10846@danny108462 ай бұрын

  • Nice content! Love .Net! Just wanna bring up another point of view, sometimes the optimisation could come from side way. For eg, algorithm of adding number from 1 to n. Could be simplified mathematically to formula n (n + 1) / 2

    @arthurchia2828@arthurchia2828Ай бұрын

  • I hope that in future Microsoft will add automatic SIMD optimization to normal for loops aswell. C/C++ compiler can vectorize some simple for loops, so Microsoft have here another opportunity for improvement.

    @scuroguardiano9787@scuroguardiano97872 ай бұрын

  • Well, if you get pointer to the continuous array of (unmanaged) memory you are summing, it is really fast to calculate sum using simple pointer arithmetic. And that's what this library seems to do. But that's what .NET don't want you to do 😄 because otherwise you'd be writing C.

    @weicco@weicco2 ай бұрын

    • If you just do pointer arithmetics to advance over the items one by one to sum, that would be slower than LINQ with its vectorization. On my computer summing 2000 integers with a for-loop is 555ns, LINQ is 108ns and getting a pointer to the array, advancing the pointer until the pointer of the array end is reached is 378ns.

      @maschyt@maschyt2 ай бұрын

    • @@maschyt you are right but if you run the operation so that you split the memory into blocks, process each block in its own thread, and finally sum everything up, you get the speed up - and this is exactly what the library does. I've implemented some image processing stuff this way. I split the image horizontally and ran the processing parallel in threads. But I wrote that in C to get down to the machine level without .net coming in my way, because .net does not really want you to access things directly.

      @weicco@weicco2 ай бұрын

  • Refreshing to hear frome someone like Nick saying he doesent understand some C# code/techniques. The last traces of imposter syndrom went suddenly away 😀 Thank you

    @ssa2955@ssa29552 ай бұрын

  • Can you ask MS if they will be incorporating these changes in core?

    @T___Brown@T___Brown2 ай бұрын

  • I'm a bit surprised that in the loop over all values the compiler wasn't able to vectorize it. Pretty straight forward loop to vectorize for a compiler I would think.

    @EtienneFortin@EtienneFortin2 ай бұрын

  • Is there a way to apply this library to all linq operations in a old .framework (4.7) solution?

    @rhesusfabio@rhesusfabio2 ай бұрын

  • Yo Nick, what theme are you using for Rider?

    @djdejlig8270@djdejlig82702 ай бұрын

    • my guess is "Visual studio dark"

      @czachowsky@czachowsky2 ай бұрын

  • "The concept of writing faster code than microsoft is not unique" :D

    @krazaam6205@krazaam62052 ай бұрын

  • Yes, this is kind of interesting, but we all know that linq is most often used to do select, order/sort operations

    @adamdegerman960@adamdegerman9602 ай бұрын

  • if you were forced into a c# version that doesn't have this yet implemented, could one emulate the API and implementation to achieve this? I assume yes

    @novaardent4528@novaardent45282 ай бұрын

  • I think you can use interceptors to resolve LINQ in a more performant way (I did this with some things already), but the lack of closure captures makes it very strange. If only microsoft stopped with the "don't modify source code" bs.

    @diadetediotedio6918@diadetediotedio69182 ай бұрын

  • Which C# and .NET book will be best to read to have good grasp on fundamentals and understand how these internally works?

    @randomphilic27@randomphilic272 ай бұрын

    • C# in Depth is still good.

      @MaximilienNoal@MaximilienNoal2 ай бұрын

    • C# in a Nutshell is an amazing book :)

      @amallkrishna@amallkrishna2 ай бұрын

    • A few years ago I made a video series about the internals here on youtube. It's in German but the auto-generated subtitles seem to work reasonably well.

      @DJDoena@DJDoena2 ай бұрын

    • how about pro C# 10 with .NET 6

      @randomphilic27@randomphilic272 ай бұрын

  • Great Video. In my i7 4770 CPU for loop is still faster :)

    @anlKaynarr@anlKaynarr2 ай бұрын

  • Wow, the production quality is off the charts

    @Kolbein837@Kolbein8372 ай бұрын

  • I'm curious what behavior they are breaking with this, that is allowing this much extra performance 🤔

    @Thorarin@Thorarin2 ай бұрын

    • Memory safety I think? They're using unsafe stuff from what I saw

      @fgsdhdfgjfyhsg@fgsdhdfgjfyhsg2 ай бұрын

    • The github says they don't take things like 'NaN' into account, and that many of the methods are 'unchecked' (meaning they don't check for overflows). Also mentions there are slight rounding inconsistencies in floating point results, due to values being evaluated in a very different order.

      @billy65bob@billy65bob2 ай бұрын

  • Back in my Dataset days -- apparently MS intends to download the entire database onto a windows form...

    @kahnfatman@kahnfatman2 ай бұрын

  • LoL, try doing something in the Ms or sec range, and check if it's still 10x faster

    @briannielsbergh@briannielsbergh22 күн бұрын

  • SIMDeez nuts!

    @ivank6486@ivank64862 ай бұрын

  • Is it true linq join has poor performance than SQL view??

    @chimnaywanoskar198@chimnaywanoskar198Ай бұрын

  • Hi! Could you make a video explaining differences between visual studio and your IDE, plis? Thanks

    @user-nk4xc8rc6p@user-nk4xc8rc6p2 ай бұрын

    • It’s JetBrains Rider, you can look up comparisons for it

      @JollyGiant19@JollyGiant192 ай бұрын

    • @@JollyGiant19 i know i can look it up. I was asking for It to someone who has expirience with it

      @user-nk4xc8rc6p@user-nk4xc8rc6p2 ай бұрын

    • VS is from Microsoft Rider is from Jet brains Rider is cross platform and works really well. I like Riders default key bindings better.

      @natescode@natescode2 ай бұрын

  • Hi Nick. Could you ban that bot with inappropriate profile picture that keeps posting generic comments like "Wow, the production quality is off the charts" on your videos. I can see it under every video of yours.

    @LeMustache@LeMustache2 ай бұрын

    • It's everywhere on yt. I keep reporting it but yt doesn't give a damn.

      @MaximilienNoal@MaximilienNoal2 ай бұрын

    • I keep banning it and it keeps coming back

      @nickchapsas@nickchapsas2 ай бұрын

    • I think its hilarious, I reply to it every time with equally nonsensical crap 😂

      @mariocamspam72@mariocamspam722 ай бұрын

  • i really think .net ecosystem lacks resources for learning how to write high performance code, memory management etc

    @yufgyug3735@yufgyug37352 ай бұрын

    • I agree.

      @sidaz22@sidaz22Ай бұрын

  • Fastest way to sum range: ( + ) * ( / 2) :-)

    @szikig@szikig2 ай бұрын

    • This works only if the interval between each number is the same

      @alfflasymphonyx@alfflasymphonyx2 ай бұрын

    • Obviously that will work in very particular case when the range represents arithmetic progression, because actually this is the formula for sum of arithmetic progression, but as @alfflasymphonyx said, not any range is arithmetic progression

      @johnnykeems2911@johnnykeems29112 ай бұрын

    • @@johnnykeems2911 You are all wrong. Nick talked about the fastest way to get the sum of Enumerable.Range. Well, that's what I wrote. And that was a joke, of course. You don't have to take it seriously.

      @szikig@szikig2 ай бұрын

    • @@szikig I'm a programmer, which means I'm kind of pedantic person. Your answer joke or not, is generally incorrect, so I dont really understand how I could be wrong. If it is a joke, that's fine, cant read your mind to know when you are joking, I just noticed that this formula only works when the sequence is an arithmetic progression.

      @johnnykeems2911@johnnykeems29112 ай бұрын

    • @@johnnykeems2911 and this is what is always true for Enumerable.Range, right ?

      @szikig@szikig2 ай бұрын

  • First() or [0]?

    @colin87@colin872 ай бұрын

    • FirstOrDefault usually...

      @MaximilienNoal@MaximilienNoal2 ай бұрын

    • prefer.?Last(to => to.post);

      @litus01@litus012 ай бұрын

    • If you have an IList First() will call [0] for you. First operates on IEnumerable so it has other checks to get you the first element for differing implementations, like IPartition.

      @fifty-plus@fifty-plus2 ай бұрын
KZhead