101 lines
2.7 KiB
C
101 lines
2.7 KiB
C
|
/*=============================================================================
|
||
|
|
|
||
|
|
This file is part of FLINT.
|
||
|
|
|
||
|
|
FLINT is free software; you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU General Public License as published by
|
||
|
|
the Free Software Foundation; either version 2 of the License, or
|
||
|
|
(at your option) any later version.
|
||
|
|
|
||
|
|
FLINT is distributed in the hope that it will be useful,
|
||
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
GNU General Public License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU General Public License
|
||
|
|
along with FLINT; if not, write to the Free Software
|
||
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||
|
|
|
||
|
|
=============================================================================*/
|
||
|
|
/******************************************************************************
|
||
|
|
|
||
|
|
Copyright 2009 William Hart
|
||
|
|
Copyright 2010 Fredrik Johansson
|
||
|
|
|
||
|
|
******************************************************************************/
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include "profiler.h"
|
||
|
|
#include "flint.h"
|
||
|
|
#include "nmod_mat.h"
|
||
|
|
#include "ulong_extras.h"
|
||
|
|
|
||
|
|
typedef struct
|
||
|
|
{
|
||
|
|
ulong dim;
|
||
|
|
mp_limb_t modulus;
|
||
|
|
int algorithm;
|
||
|
|
} mat_mul_t;
|
||
|
|
|
||
|
|
void sample(void * arg, ulong count)
|
||
|
|
{
|
||
|
|
mat_mul_t * params = (mat_mul_t *) arg;
|
||
|
|
mp_limb_t n = params->modulus;
|
||
|
|
ulong i, dim = params->dim;
|
||
|
|
int algorithm = params->algorithm;
|
||
|
|
|
||
|
|
nmod_mat_t A, B, C;
|
||
|
|
|
||
|
|
nmod_mat_init(A, dim, dim, n);
|
||
|
|
nmod_mat_init(B, dim, dim, n);
|
||
|
|
nmod_mat_init(C, dim, dim, n);
|
||
|
|
|
||
|
|
prof_start();
|
||
|
|
|
||
|
|
if (algorithm == 0)
|
||
|
|
for (i = 0; i < count; i++)
|
||
|
|
nmod_mat_mul(C, A, B);
|
||
|
|
else if (algorithm == 1)
|
||
|
|
for (i = 0; i < count; i++)
|
||
|
|
nmod_mat_mul_classical(C, A, B);
|
||
|
|
else
|
||
|
|
for (i = 0; i < count; i++)
|
||
|
|
nmod_mat_mul_strassen(C, A, B);
|
||
|
|
|
||
|
|
prof_stop();
|
||
|
|
|
||
|
|
if (C->entries[0] == WORD(5893479483)) abort();
|
||
|
|
|
||
|
|
nmod_mat_clear(A);
|
||
|
|
nmod_mat_clear(B);
|
||
|
|
nmod_mat_clear(C);
|
||
|
|
}
|
||
|
|
|
||
|
|
int main(void)
|
||
|
|
{
|
||
|
|
double min_classical, min_strassen, max;
|
||
|
|
mat_mul_t params;
|
||
|
|
slong dim;
|
||
|
|
|
||
|
|
flint_printf("nmod_mat_mul:\n");
|
||
|
|
|
||
|
|
params.modulus = 40000;
|
||
|
|
|
||
|
|
for (dim = 2; dim <= 512; dim = (slong) ((double) dim * 1.1) + 1)
|
||
|
|
{
|
||
|
|
params.dim = dim;
|
||
|
|
|
||
|
|
params.algorithm = 1;
|
||
|
|
prof_repeat(&min_classical, &max, sample, ¶ms);
|
||
|
|
|
||
|
|
params.algorithm = 2;
|
||
|
|
prof_repeat(&min_strassen, &max, sample, ¶ms);
|
||
|
|
|
||
|
|
flint_printf("dim = %wd, classical %.2f us strassen %.2f us\n",
|
||
|
|
dim, min_classical, min_strassen);
|
||
|
|
}
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|