Standardize file suffixes

1 files changed, 0 insertions, 155 deletions

diff --git a/test.cc b/test.cc
deleted file mode 100644
index d0ac222..0000000
--- a/test.cc
+++ /dev/null
@@ -1,155 +0,0 @@
-// Based on https://arxiv.org/abs/1705.01991
-
-// Copyright (c) 2017 Microsoft Corporation
-
-// Permission is hereby granted, free of charge, to any person obtaining a copy
-// of this software and associated documentation files (the "Software"), to deal
-// in the Software without restriction, including without limitation the rights
-// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-// copies of the Software, and to permit persons to whom the Software is
-// furnished to do so, subject to the following conditions:
-
-// The above copyright notice and this permission notice shall be included in all
-// copies or substantial portions of the Software.
-
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-// SOFTWARE.
-
-#include "AVX_Matrix_Mult.h"
-#include "SSE_Matrix_Mult.h"
-#include "stopwatch.h"
-
-#include <cassert>
-#include <cmath>
-#include <cstring>
-#include <cstdio>
-
-#include <memory>
-
-// Compute A*B^T very naively.
-void SlowRef_MatrixMult(const float * A, const float * B, float * C, int num_A_rows, int num_B_rows, int width)
-{
-    for (int i = 0; i < num_A_rows; i++) {
-        const float * A_row = A + i*width;
-        float * C_row = C + i*num_B_rows;
-        for (int j = 0; j < num_B_rows; j++) {
-            const float * B_row = B + j*width;
-            float sum = 0.0f;
-            for (int k = 0; k < width; k++) {
-                sum += A_row[k]*B_row[k];
-            }
-            C_row[j] = sum;
-        }
-    }
-}
-
-// Program takes no input
-int main(int argc, char ** argv) {
-    srand(45678);
-
-    // A is usually an activation matrix, B is usually a weight matrix.
-    // We actually comptue A * B^T. num_B_rows is the rows in B^T. 
-    int num_A_rows = 1024;
-    int num_B_rows = 512;
-    // This is the shared dimension.
-    int width = 1024;
-
-    printf("Computing matrix multiplication: %d x %d x %d\n", num_A_rows, width, num_B_rows);
-    
-    assert(num_A_rows % 4 == 0);
-    assert(width % 8 == 0);
-
-    float * A = static_cast<float*>(aligned_alloc(64, sizeof(float) * num_A_rows * width));
-    float * B = static_cast<float*>(aligned_alloc(64, sizeof(float) * num_B_rows * width));
-    
-    for (int i = 0; i < num_A_rows*width; i++) {
-        A[i] = ((float)rand()/(float)RAND_MAX)*2.0f - 1.0f;
-    }
-    
-    for (int i = 0; i < num_B_rows*width; i++) {
-        B[i] = ((float)rand()/(float)RAND_MAX)*2.0f - 1.0f;
-    }
-    
-    // C will thus be num_A_rows x num_B_rows
-    std::unique_ptr<float[]> ref_C(new float[num_A_rows*num_B_rows]);
-    {
-      StopWatch w("Reference multiply");
-      SlowRef_MatrixMult(A, B, ref_C.get(), num_A_rows, num_B_rows, width);
-    }
-
-    // The quantized version of C is never explicity created. We de-quantize on the fly
-    // to avoid extraneous memory accesses.
-    float * SSE_C = new float[num_A_rows*num_B_rows];
-    float * AVX_C = new float[num_A_rows*num_B_rows];
-    
-    // Each __m512i fits 8 16-bit integers, so we assume the width is a multiple of 8.
-    // We could pad with 0 in the general case.
-    __m512i * quant_A = static_cast<__m512i *>(aligned_alloc(64, num_A_rows*width * 2));
-    __m512i * quant_B = static_cast<__m512i *>(aligned_alloc(64, num_B_rows*width * 2));
-
-    // We quantize with 10 bits of precision. This works well "universally". 
-    // See the top of this file for more info on why.
-    //double quant_mult = pow(2.0, 10.0);
-    double quant_mult = 1000.0;
-    
-    // If we quantize to n bits and then multiply the values together, the result will be quantized to n^2 bits.
-    // So we must divide by 1.0/(n^2) to get back the original value.
-    double unquant_mult = 1.0/(quant_mult*quant_mult);
-    {
-      StopWatch w("SSE quantization");
-      // The weight matrix should be quantized before starting decoding, since it is known beforehand.
-      SSE_Quantize(B, (__m128i *)quant_B, (float)quant_mult, num_B_rows, width);
-      // The activation matrix must be quantized on-the-fly.
-      SSE_Quantize(A, (__m128i *)quant_A, (float)quant_mult, num_A_rows, width);
-    }
-    {
-      StopWatch w("SSE matrix multiply");  
-      SSE_MatrixMult((__m128i*)quant_A, (__m128i*)quant_B, SSE_C, (float)unquant_mult, num_A_rows, num_B_rows, width);
-    }
-
-    {
-      StopWatch w("AVX quantization");
-      // The weight matrix should be quantized before starting decoding, since it is known beforehand.
-      AVX_Quantize(B, (__m256i *)quant_B, (float)quant_mult, num_B_rows * width);
-      // The activation matrix must be quantized on-the-fly.
-      AVX_Quantize(A, (__m256i *)quant_A, (float)quant_mult, num_A_rows * width);
-    }
-    {
-      StopWatch w("AVX multiply");
-      AVX_MatrixMult(quant_A, quant_B, AVX_C, (float)unquant_mult, num_A_rows, num_B_rows, width);
-    }
-
-    free(A);
-    free(B);
-    free(quant_A);
-    free(quant_B);
-    
-    double max_diff = 0.0;
-    double mean_diff = 0.0;
-    for (int i = 0; i < num_A_rows; i++) {
-        for (int j = 0; j < num_B_rows; j++) {
-            float r = SSE_C[i*num_B_rows + j];
-            float f = AVX_C[i*num_B_rows + j];
-            double diff = std::fabs(r-f);
-            if (diff > max_diff) {
-                max_diff = diff;
-            }
-            mean_diff += diff;
-        }
-    }
-    
-    mean_diff /= (double)num_A_rows*(double)num_B_rows;
-
-    std::printf("Diff between AVX512 and SSE:\n");
-    std::printf("  Mean = %g\n", mean_diff);
-    std::printf("  Max = %g\n", max_diff);
-    
-    return 0;
-}
-
-