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.Coordinates; 027 import org.ujmp.core.Matrix; 028 import org.ujmp.core.doublematrix.DoubleMatrix2D; 029 import org.ujmp.core.util.SerializationUtil; 030 031 public class EigBenchmarkTask extends AbstractBenchmarkTask { 032 033 public EigBenchmarkTask(long benchmarkSeed, Class<? extends DoubleMatrix2D> matrixClass, 034 BenchmarkConfig config) { 035 super(benchmarkSeed, matrixClass, config.getEigSizes(), config); 036 } 037 038 @Override 039 public BenchmarkResult task(Class<? extends Matrix> matrixClass, long benchmarkSeed, int run, 040 long[] size) { 041 final long t0, t1, m0, m1; 042 final DoubleMatrix2D m; 043 Matrix[] r; 044 try { 045 m = BenchmarkUtil.createMatrix(matrixClass, size); 046 if (!m.getClass().getName().startsWith("org.ujmp.core") 047 && m.getClass().getDeclaredMethod("eig") == null) { 048 System.out.print("-"); 049 System.out.flush(); 050 return BenchmarkResult.NOTAVAILABLE; 051 } 052 BenchmarkUtil.randSymm(benchmarkSeed, run, 0, m); 053 BenchmarkUtil.purgeMemory(getConfig()); 054 m0 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory(); 055 t0 = System.nanoTime(); 056 r = m.eig(); 057 t1 = System.nanoTime(); 058 m1 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory(); 059 if (r == null) { 060 System.out.print("e"); 061 System.out.flush(); 062 return BenchmarkResult.ERROR; 063 } 064 Matrix result = r[0].mtimes(r[1]).mtimes(r[0].transpose()); 065 double diff = BenchmarkUtil.difference(result, m); 066 result = null; 067 long mem = m1 - m0 - SerializationUtil.sizeOf(r); 068 mem = mem > 0 ? mem : 0; 069 return new BenchmarkResult((t1 - t0) / 1000000.0, diff, mem); 070 } catch (Throwable e) { 071 System.out.print("e"); 072 System.out.flush(); 073 return BenchmarkResult.ERROR; 074 } 075 } 076 077 @Override 078 public String getTaskName() { 079 return "eig"; 080 } 081 082 }