通过SSE加速矩阵乘法(C++)

#include<iostream>
#include <emmintrin.h> // SSE2

void matrix_multiply(float* A, float* B, float* C, int n) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            float sum = 0;
            for (int k = 0; k < n; k++) {
                sum += A[i*n+k] * B[k*n+j];
            }
            C[i*n+j] = sum;
        }
    }
}

void matrix_multiply_sse(float* A, float* B, float* C, int n) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j += 4) {
            __m128 sum = _mm_setzero_ps();
            for (int k = 0; k < n; k++) {
                __m128 a = _mm_set1_ps(A[i*n+k]);
                __m128 b = _mm_load_ps(&B[k*n+j]);
                sum = _mm_add_ps(sum, _mm_mul_ps(a, b));
            }
            _mm_store_ps(&C[i*n+j], sum);
        }
    }
}

int main() {
    int n = 1000;
    float* A = new float[n*n];
    float* B = new float[n*n];
    float* C = new float[n*n];

    for (int i = 0; i < n*n; i++) {
        A[i] = i;
        B[i] = i;
    }

    matrix_multiply(A, B, C, n);
    matrix_multiply_sse(A, B, C, n);

    delete[] A;
    delete[] B;
    delete[] C;

    return 0;
}