Top 5 C# Simd Projects
-
So you get cache locality as you're running through your transforms.
Now imagine if instead of space invaders we're trying to model say blades of grass. Suddenly we go from a very cache unfriendly method to something that's cache friendly, branch prediction friendly, and easy to parallelize.
If you want to experiment with it Unity has some great examples under their new DOTS system
https://github.com/Unity-Technologies/EntityComponentSystemS...
APIs can make data oriented more ergonomic than my contrived example implies, but it's still not nearly as intuitive as ECS imo.
To me data oriented subsystems are fine, but not as a core concept for your game's architecture.
-
NetFabric.Hyperlinq
High performance LINQ implementation with minimal heap allocations. Supports enumerables, async enumerables, arrays and Span<T>.
Project mention: Like Regular LINQ, but Faster and Without Allocations: Is It Possible? | reddit.com/r/dotnet | 2022-01-04 -
SonarQube
Static code analysis for 29 languages.. Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.
-
Quickenshtein
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
-
Amplifier.NET
Amplifier allows .NET developers to easily run complex applications with intensive mathematical computation on Intel CPU/GPU, NVIDIA, AMD without writing any additional C kernel code. Write your function in .NET and Amplifier will take care of running it on your favorite hardware.
-
Link to the project: Click Me
C# Simd related posts
Index
What are some of the best open-source Simd projects in C#? This list will help you:
Project | Stars | |
---|---|---|
1 | EntityComponentSystemSamples | 4,458 |
2 | NetFabric.Hyperlinq | 755 |
3 | Quickenshtein | 169 |
4 | Amplifier.NET | 126 |
5 | SimpleSIMD | 63 |
Are you hiring? Post a new remote job listing for free.