ltiPerformanceConfig.h

Go to the documentation of this file.
00001 /*
00002  * Copyright (C) 2004, 2005, 2006
00003  * Lehrstuhl fuer Technische Informatik, RWTH-Aachen, Germany
00004  *
00005  * This file is part of the LTI-Computer Vision Library (LTI-Lib)
00006  *
00007  * The LTI-Lib is free software; you can redistribute it and/or
00008  * modify it under the terms of the GNU Lesser General Public License (LGPL)
00009  * as published by the Free Software Foundation; either version 2.1 of
00010  * the License, or (at your option) any later version.
00011  *
00012  * The LTI-Lib is distributed in the hope that it will be
00013  * useful, but WITHOUT ANY WARRANTY; without even the implied warranty
00014  * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00015  * GNU Lesser General Public License for more details.
00016  *
00017  * You should have received a copy of the GNU Lesser General Public
00018  * License along with the LTI-Lib; see the file LICENSE.  If
00019  * not, write to the Free Software Foundation, Inc., 59 Temple Place -
00020  * Suite 330, Boston, MA 02111-1307, USA.
00021  */
00022 
00023 
00024 /*----------------------------------------------------------------
00025  * project ....: LTI Digital Image/Signal Processing Library
00026  * file .......: ltiPerformaceConfig.h
00027  * authors ....: Peter Doerfler
00028  * organization: LTI, RWTH Aachen
00029  * creation ...: 09.02.2004
00030  * revisions ..: $Id: ltiPerformanceConfig.h,v 1.2 2006/02/07 18:09:49 ltilib Exp $
00031  */
00032 
00033 #ifndef _LTI_PERFORMANCE_CONFIG_H_
00034 #define _LTI_PERFORMANCE_CONFIG_H_
00035 
00036 /**
00037  * \file ltiPerformanceConfig.h
00038  *
00039  * Definition of constants that are used to tweak the performance of
00040  * some algorithm but need not be changed for every call of a
00041  * method. Usually, these constants are architecture dependent, mostly
00042  * cache. The default values in this file were determined on a P4 1600
00043  * with 512 RAM.
00044  */
00045 
00046 
00047 /**
00048  * Multiplication of two matrices in lti::matrix is faster if the
00049  * second matrix is transposed first when that matrix is large. Large
00050  * is defined below.
00051  */
00052 #define _LTI_PERFORMANCE_MATRIX_MATRIX_MULTIPLY 65
00053 
00054 /**
00055  * The QR decomposition algorithm (lti::qrDecomposition) accesses the
00056  * data matrix column wise. Depending on the size it is faster to
00057  * transpose first and transpose the results again.
00058  */
00059 #define _LTI_PERFORMANCE_QR_DECOMPOSITION 50
00060 
00061 /**
00062  * lti::sort uses quicksort down to a certain number of elements to
00063  * sort after which it uses a simple sorting algorithm. The value
00064  * below sets that threshold.
00065  */
00066 #define _LTI_PERFORMANCE_SORT_STOP_QUICKSORT 10
00067 
00068 
00069 #endif