/*
* Copyright (c) 2009-2011, Peter Abeles. All Rights Reserved.
*
* This file is part of Efficient Java Matrix Library (EJML).
*
* EJML is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* EJML 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with EJML. If not, see <http://www.gnu.org/licenses/>.
*/
package org.ejml.alg.dense.mult;
import org.ejml.data.DenseMatrix64F;
import org.ejml.ops.CommonOps;
import org.ejml.ops.RandomMatrices;
import java.util.Random;
/**
*
* Some notes:
*
* Other libraries implement there multiplication the same as my aux implementation, but theirs run faster.
* That is because they use 2D arrays, this allows them to only increment one variable in their inner
* most loop. While in mine I have to increment two. Thus there is an additional N^3 addition operations.
*
* @author Peter Abeles
*/
public class BenchmarkMatrixMatrixMultTransA {
static Random rand = new Random(234234);
static int TRIALS_MULT = 10000000;
public static long mult( DenseMatrix64F matA , DenseMatrix64F matB ,
DenseMatrix64F matResult , int numTrials) {
long prev = System.currentTimeMillis();
for( int i = 0; i < numTrials; i++ ) {
CommonOps.multTransA(matA,matB,matResult);
}
long curr = System.currentTimeMillis();
return curr-prev;
}
public static long multSmall( DenseMatrix64F matA , DenseMatrix64F matB ,
DenseMatrix64F matResult , int numTrials) {
long prev = System.currentTimeMillis();
for( int i = 0; i < numTrials; i++ ) {
MatrixMatrixMult.multTransA_small(matA,matB,matResult);
}
long curr = System.currentTimeMillis();
return curr-prev;
}
public static long multReorder( DenseMatrix64F matA , DenseMatrix64F matB ,
DenseMatrix64F matResult , int numTrials) {
long prev = System.currentTimeMillis();
for( int i = 0; i < numTrials; i++ ) {
MatrixMatrixMult.multTransA_reorder(matA,matB,matResult);
}
long curr = System.currentTimeMillis();
return curr-prev;
}
public static void performTests( int numRows , int numCols , int numK,
int numTrials )
{
DenseMatrix64F matA = RandomMatrices.createRandom(numRows,numCols,rand);
DenseMatrix64F matB = RandomMatrices.createRandom(numCols,numK,rand);
DenseMatrix64F matResult = RandomMatrices.createRandom(numRows,numK,rand);
System.out.printf("Mult: %7d Small %7d Reord %7d\n",
mult(matA,matB,matResult,numTrials),
multSmall(matA,matB,matResult,numTrials),
multReorder(matA,matB,matResult,numTrials));
System.gc();
}
public static void main( String args[] ) {
int size[] = new int[]{2,4,10,20,50,100,200,500,1000};//,2000,4000};
int count[] = new int[]{40000000,10000000,1000000,100000,10000,1000,100,8,2,1,1};
int sizeTall[] = new int[]{1,2,4,10,20,50,100,200,500,1000};
int countTall[] = new int[]{3000,2400,1500,1000,200,200,100,50,10,5};
System.out.println("******* Square:\n");
for( int i = 0; i < size.length; i++ ) {
System.out.println("\nWidth = "+size[i]);
performTests(size[i],size[i],size[i],count[i]);
}
System.out.println("\n******* Wide A:");
for( int i = 0; i < sizeTall.length; i++ ) {
System.out.println("\nHeight = "+sizeTall[i]);
performTests(sizeTall[i],1500,100,countTall[i]);
}
System.out.println("\n******* Tall A:");
for( int i = 0; i < sizeTall.length; i++ ) {
System.out.println("\nWidth = "+sizeTall[i]);
performTests(1500,sizeTall[i],100,countTall[i]);
}
System.out.println("\n******* Wide B:");
for( int i = 0; i < sizeTall.length; i++ ) {
System.out.println("\nHeight = "+sizeTall[i]);
performTests(100,sizeTall[i],1500,countTall[i]);
}
System.out.println("\n******* Tall B:");
for( int i = 0; i < sizeTall.length; i++ ) {
System.out.println("\nWidth = "+sizeTall[i]);
performTests(100,1500,sizeTall[i],countTall[i]);
}
}
}
|