amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-04-20 15:48:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added support to benchmark ASUMV APIs

Browse Source 
- Implemented the feature to benchmark ?ASUMV APIs
  for the supported datatypes. The feature allows to
  benchmark BLAS, CBLAS or the native BLIS API, based
  on the macro definition.

- Added a sample input file to provide examples to benchmark
  ASUMV for all its datatype supports.

AMD-Internal: [CPUPL-5984]
Change-Id: Iff512166545687d12504babda1bd52d71a3a5755
This commit is contained in:
Hari Govind S
2025-01-27 11:30:59 +05:30
parent 0e71d28c01
commit 67322416d3
3 changed files with 264 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
bench/Makefile
View File

@@ -194,7 +194,8 @@ blis: \
bench_swapv_blis.x \
bench_axpbyv_blis.x \
bench_axpyv_blis.x \
bench_gemm_pack_compute_blis.x
bench_gemm_pack_compute_blis.x \
bench_asumv_blis.x
openblas: \
bench_gemm_openblas.x \
@@ -211,7 +212,8 @@ openblas: \
bench_copyv_openblas.x \
bench_swapv_openblas.x \
bench_axpbyv_openblas.x \
bench_axpyv_openblas.x
bench_axpyv_openblas.x \
bench_asumv_openblas.x
atlas: \
bench_gemm_atlas.x \
@@ -245,7 +247,8 @@ mkl: \
bench_swapv_mkl.x \
bench_axpbyv_mkl.x \
bench_axpyv_mkl.x \
bench_gemm_pack_compute_mkl.x
bench_gemm_pack_compute_mkl.x \
bench_asumv_mkl.x
# --Object file rules --

230
bench/bench_asumv.c Normal file
View File

@@ -0,0 +1,230 @@
/*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2025, Advanced Micro Devices, Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name(s) of the copyright holder(s) nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef WIN32
#include <io.h>
#else
#include <unistd.h>
#endif
#include "blis.h"
#include "blis_int_type.h"
#define AOCL_MATRIX_INITIALISATION
//#define BLIS_ENABLE_CBLAS
/* For BLIS since logs are collected at BLAS interfaces
* we disable cblas interfaces for this benchmark application
*/
/* #ifdef BLIS_ENABLE_CBLAS */
/* #define CBLAS */
/* #endif */
int main( int argc, char** argv )
{
obj_t x, res;
dim_t p_inc = 0; // to keep track of number of inputs
num_t dt;
char dt_ch;
int r, n_repeats;
double dtime;
double dtime_save;
double gflops;
FILE* fin = NULL;
FILE* fout = NULL;
n_repeats = N_REPEAT; // This macro will get from Makefile.
if (argc < 3)
{
printf("Usage: ./test_asumv_XX.x input.csv output.csv\n");
exit(1);
}
fin = fopen(argv[1], "r");
if (fin == NULL)
{
printf("Error opening the file %s\n", argv[1]);
exit(1);
}
fout = fopen(argv[2], "w");
if (fout == NULL)
{
printf("Error opening output file %s\n", argv[2]);
exit(1);
}
fprintf(fout, "Func Dt n incx gflops\n");
dim_t n;
inc_t incx;
char tmp[256]; // to store function name, line no present in logs.
// {S,D,C,Z} {n incx}
while (fscanf(fin, "%s %c " INT_FS INT_FS "\n",
tmp, &dt_ch, &n, &incx) == 4)
{
#ifdef PRINT
fprintf (stdout, "Input = %s %c " INT_FS INT_FS "%6.3f\n",
tmp, dt_ch, n, incx, gflops);
#endif
if (dt_ch == 'D' || dt_ch == 'd') dt = BLIS_DOUBLE;
else if (dt_ch == 'Z' || dt_ch == 'z') dt = BLIS_DCOMPLEX;
else if (dt_ch == 'S' || dt_ch == 's') dt = BLIS_FLOAT;
else if (dt_ch == 'C' || dt_ch == 'c') dt = BLIS_SCOMPLEX;
else
{
printf("Invalid data type %c\n", dt_ch);
continue;
}
// Create objects with required sizes and strides.
//
// The ?asum routines perform a vector operation defined as
// the sum of the absolute values of the elements of a vector.
//
// where:
// n is length of vector
// x is an n-element vector, Array size at least (1+(n-1)*abs(incx)).
bli_obj_create( dt, n, 1, incx, 1, &x );
bli_obj_create( dt, 1, 1, 0, 0, &res );
#ifdef AOCL_MATRIX_INITIALISATION
bli_randm( &x );
#endif
dtime_save = DBL_MAX;
for ( r = 0; r < n_repeats; ++r )
{
dtime = bli_clock();
#ifdef PRINT
bli_printm( "x", &x, "%4.1f", "" );
#endif
#ifdef BLIS
bli_asumv( &x,
&res);
#else
// Data type independent variables
f77_int nn = bli_obj_length( &x );
f77_int incx = bli_obj_vector_inc( &x );
if ( bli_is_float( dt ) )
{
float* xp = bli_obj_buffer( &x );
float* resp = bli_obj_buffer( &res );
#ifdef CBLAS
*resp = cblas_sasum( nn,
xp, incx );
#else
*resp = sasum_( &nn,
xp, &incx );
#endif
}
else if ( bli_is_double( dt ) )
{
double* xp = bli_obj_buffer( &x );
double* resp = bli_obj_buffer( &res );
#ifdef CBLAS
*resp = cblas_dasum( nn,
xp, incx );
#else
*resp = dasum_( &nn,
xp, &incx );
#endif
}
else if ( bli_is_scomplex( dt ) )
{
scomplex* xp = bli_obj_buffer( &x );
float* resp = bli_obj_buffer( &res );
#ifdef CBLAS
*resp = cblas_scasum( nn,
xp, incx );
#else
*resp = scasum_( &nn,
xp, &incx );
#endif
}
else if ( bli_is_dcomplex( dt ) )
{
dcomplex* xp = bli_obj_buffer( &x );
double* resp = bli_obj_buffer( &res );
#ifdef CBLAS
*resp = cblas_dzasum( nn,
xp, incx );
#else
*resp = dzasum_( &nn,
xp, &incx );
#endif
}
#endif // BLIS Interface
#ifdef PRINT
bli_printm( "res", &res, "%4.1f", "" );
exit(1);
#endif
dtime_save = bli_clock_min_diff( dtime_save, dtime );
}
gflops = n / ( dtime_save * 1.0e9 );
if ( bli_is_complex( dt ) ) gflops *= 2.0;
printf( "data_asumv_%s", BLAS );
p_inc++;
printf("( %2lu, 1:4 ) = [ %4lu %7.2f ];\n",
(unsigned long)(p_inc),
(unsigned long)n,
gflops);
fprintf (fout, "%s %c " INT_FS INT_FS "%6.3f\n", tmp, dt_ch, n, incx, gflops);
fflush(fout);
bli_obj_free( &x );
bli_obj_free( &res );
}
//bli_finalize();
fclose(fin);
fclose(fout);
return 0;
}

28
bench/inputasumv.txt Normal file
View File

@@ -0,0 +1,28 @@
dasum_ D 200 1
dasum_ D 300 1
dasum_ D 400 1
dasum_ D 500 1
dasum_ D 800 1
dasum_ D 1000 1
dasum_ D 2000 1
sasum_ S 200 1
sasum_ S 300 1
sasum_ S 400 1
sasum_ S 500 1
sasum_ S 800 1
sasum_ S 1000 1
sasum_ S 2000 1
csasum_ C 200 1
csasum_ C 300 1
csasum_ C 400 1
csasum_ C 500 1
csasum_ C 800 1
csasum_ C 1000 1
csasum_ C 2000 1
dzasum_ Z 200 1
dzasum_ Z 300 1
dzasum_ Z 400 1
dzasum_ Z 500 1
dzasum_ Z 800 1
dzasum_ Z 1000 1
dzasum_ Z 2000 1