Parallelism on single Core with .NET C# and SIMD / AVX. First Example.

6,258 views

Welcome!

This C# code will shows to us a simple basic examples of SIMD / AVX. We will compare the sum of two arrays of integers without SIMD and with it. The performance increasing is awesome!

The source code is on GitHub, please feel free to come up with proposals to improve it.

Hands-on Demo

Run this ready to use benchmark

// {
�using System;
using System.Diagnostics;
using System.Linq;
using System.Numerics;
namespace Answer
{
    public class UniverseStub
    {
        static void allBench(int loop, int arraySize, int rerun)
        {
            Stopwatch sw = new Stopwatch();
            Random random = new Random();
            Func<int, int[]> genRandomIntArray = n => Enumerable.Repeat(0, n).Select(i => random.Next(2 * n)).ToArray();
            Func<int, int[]> genRandomIntArray2 = n =>
            {
            int[] ar = new int[n];
            for (int k = 0; k < n; ++k) ar[k] = random.Next(2 * n);
            return ar;
            };
            Action<int, int> bench1 = (K, N) =>
            {
            sw.Restart();
            int[] x = genRandomIntArray2(N);
            int[] y = genRandomIntArray2(N);
            int[] r = new int[N];
            for (int k = 0; k < K; ++k)
            {
                for (int i = 0; i < N; ++i) r[i] = x[i] + y[i];
            }
            //Console.WriteLine(String.Join(" ", x.Take(10)));
            //Console.WriteLine(String.Join(" ", y.Take(10)));
            //Console.WriteLine(String.Join(" ", r.Take(10)));
            Console.WriteLine($"Elapsed {sw.ElapsedMilliseconds,6} ms");
            };
            Action<int, int> bench2 = (K, N) =>
            {
            sw.Restart();
            int[] x = genRandomIntArray2(N);
            int[] y = genRandomIntArray2(N);
            int[] r = new int[N];
            Vector<int> v0 = Vector<int>.Zero;
            for (int k = 0; k < K; ++k)
            {