001 /* 002 * Copyright (C) 2008-2010 by Holger Arndt 003 * 004 * This file is part of the Universal Java Matrix Package (UJMP). 005 * See the NOTICE file distributed with this work for additional 006 * information regarding copyright ownership and licensing. 007 * 008 * UJMP is free software; you can redistribute it and/or modify 009 * it under the terms of the GNU Lesser General Public License as 010 * published by the Free Software Foundation; either version 2 011 * of the License, or (at your option) any later version. 012 * 013 * UJMP is distributed in the hope that it will be useful, 014 * but WITHOUT ANY WARRANTY; without even the implied warranty of 015 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 016 * GNU Lesser General Public License for more details. 017 * 018 * You should have received a copy of the GNU Lesser General Public 019 * License along with UJMP; if not, write to the 020 * Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, 021 * Boston, MA 02110-1301 USA 022 */ 023 024 package org.ujmp.core.benchmark; 025 026 import org.ujmp.core.Matrix; 027 import org.ujmp.core.doublematrix.DoubleMatrix2D; 028 import org.ujmp.core.util.SerializationUtil; 029 030 public class LUBenchmarkTask extends AbstractBenchmarkTask { 031 032 public LUBenchmarkTask(long benchmarkSeed, Class<? extends DoubleMatrix2D> matrixClass, 033 BenchmarkConfig config) { 034 super(benchmarkSeed, matrixClass, config.getLUSizes(), config); 035 } 036 037 @Override 038 public BenchmarkResult task(Class<? extends Matrix> matrixClass, long benchmarkSeed, int run, 039 long[] size) { 040 final long t0, t1, m0, m1; 041 final DoubleMatrix2D m; 042 Matrix[] r; 043 try { 044 m = BenchmarkUtil.createMatrix(matrixClass, size); 045 if (!m.getClass().getName().startsWith("org.ujmp.core") 046 && m.getClass().getDeclaredMethod("lu") == null) { 047 System.out.print("-"); 048 System.out.flush(); 049 return BenchmarkResult.NOTAVAILABLE; 050 } 051 BenchmarkUtil.rand(benchmarkSeed, run, 0, m); 052 BenchmarkUtil.purgeMemory(getConfig()); 053 m0 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory(); 054 t0 = System.nanoTime(); 055 r = m.lu(); 056 t1 = System.nanoTime(); 057 m1 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory(); 058 if (r == null) { 059 System.out.print("e"); 060 System.out.flush(); 061 return BenchmarkResult.ERROR; 062 } 063 Matrix result = r[0].mtimes(r[1]).mtimes(r[2]); 064 double diff = BenchmarkUtil.difference(result, m); 065 result = null; 066 long mem = m1 - m0 - SerializationUtil.sizeOf(r); 067 mem = mem > 0 ? mem : 0; 068 return new BenchmarkResult((t1 - t0) / 1000000.0, diff, mem); 069 } catch (Throwable e) { 070 System.out.print("e"); 071 System.out.flush(); 072 return BenchmarkResult.ERROR; 073 } 074 } 075 076 @Override 077 public String getTaskName() { 078 return "LU"; 079 } 080 081 }