root / testing / matgen / HPL_dmatgen.c @ 9
Historique | Voir | Annoter | Télécharger (5,64 ko)
| 1 | 1 | equemene | /*
|
|---|---|---|---|
| 2 | 1 | equemene | * -- High Performance Computing Linpack Benchmark (HPL)
|
| 3 | 1 | equemene | * HPL - 2.0 - September 10, 2008
|
| 4 | 1 | equemene | * Antoine P. Petitet
|
| 5 | 1 | equemene | * University of Tennessee, Knoxville
|
| 6 | 1 | equemene | * Innovative Computing Laboratory
|
| 7 | 1 | equemene | * (C) Copyright 2000-2008 All Rights Reserved
|
| 8 | 1 | equemene | *
|
| 9 | 1 | equemene | * -- Copyright notice and Licensing terms:
|
| 10 | 1 | equemene | *
|
| 11 | 1 | equemene | * Redistribution and use in source and binary forms, with or without
|
| 12 | 1 | equemene | * modification, are permitted provided that the following conditions
|
| 13 | 1 | equemene | * are met:
|
| 14 | 1 | equemene | *
|
| 15 | 1 | equemene | * 1. Redistributions of source code must retain the above copyright
|
| 16 | 1 | equemene | * notice, this list of conditions and the following disclaimer.
|
| 17 | 1 | equemene | *
|
| 18 | 1 | equemene | * 2. Redistributions in binary form must reproduce the above copyright
|
| 19 | 1 | equemene | * notice, this list of conditions, and the following disclaimer in the
|
| 20 | 1 | equemene | * documentation and/or other materials provided with the distribution.
|
| 21 | 1 | equemene | *
|
| 22 | 1 | equemene | * 3. All advertising materials mentioning features or use of this
|
| 23 | 1 | equemene | * software must display the following acknowledgement:
|
| 24 | 1 | equemene | * This product includes software developed at the University of
|
| 25 | 1 | equemene | * Tennessee, Knoxville, Innovative Computing Laboratory.
|
| 26 | 1 | equemene | *
|
| 27 | 1 | equemene | * 4. The name of the University, the name of the Laboratory, or the
|
| 28 | 1 | equemene | * names of its contributors may not be used to endorse or promote
|
| 29 | 1 | equemene | * products derived from this software without specific written
|
| 30 | 1 | equemene | * permission.
|
| 31 | 1 | equemene | *
|
| 32 | 1 | equemene | * -- Disclaimer:
|
| 33 | 1 | equemene | *
|
| 34 | 1 | equemene | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 35 | 1 | equemene | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 36 | 1 | equemene | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 37 | 1 | equemene | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
|
| 38 | 1 | equemene | * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 39 | 1 | equemene | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 40 | 1 | equemene | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 41 | 1 | equemene | * DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 42 | 1 | equemene | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 43 | 1 | equemene | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 44 | 1 | equemene | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 45 | 1 | equemene | * ---------------------------------------------------------------------
|
| 46 | 1 | equemene | */
|
| 47 | 1 | equemene | /*
|
| 48 | 1 | equemene | * Include files
|
| 49 | 1 | equemene | */
|
| 50 | 1 | equemene | #include "hpl.h" |
| 51 | 1 | equemene | |
| 52 | 1 | equemene | #ifdef STDC_HEADERS
|
| 53 | 1 | equemene | void HPL_dmatgen
|
| 54 | 1 | equemene | ( |
| 55 | 1 | equemene | const int M, |
| 56 | 1 | equemene | const int N, |
| 57 | 1 | equemene | double * A,
|
| 58 | 1 | equemene | const int LDA, |
| 59 | 1 | equemene | const int ISEED |
| 60 | 1 | equemene | ) |
| 61 | 1 | equemene | #else
|
| 62 | 1 | equemene | void HPL_dmatgen
|
| 63 | 1 | equemene | ( M, N, A, LDA, ISEED ) |
| 64 | 1 | equemene | const int M; |
| 65 | 1 | equemene | const int N; |
| 66 | 1 | equemene | double * A;
|
| 67 | 1 | equemene | const int LDA; |
| 68 | 1 | equemene | const int ISEED; |
| 69 | 1 | equemene | #endif
|
| 70 | 1 | equemene | {
|
| 71 | 1 | equemene | /*
|
| 72 | 1 | equemene | * Purpose
|
| 73 | 1 | equemene | * =======
|
| 74 | 1 | equemene | *
|
| 75 | 1 | equemene | * HPL_dmatgen generates (or regenerates) a random matrix A.
|
| 76 | 1 | equemene | *
|
| 77 | 1 | equemene | * The pseudo-random generator uses the linear congruential algorithm:
|
| 78 | 1 | equemene | * X(n+1) = (a * X(n) + c) mod m as described in the Art of Computer
|
| 79 | 1 | equemene | * Programming, Knuth 1973, Vol. 2.
|
| 80 | 1 | equemene | *
|
| 81 | 1 | equemene | * Arguments
|
| 82 | 1 | equemene | * =========
|
| 83 | 1 | equemene | *
|
| 84 | 1 | equemene | * M (input) const int
|
| 85 | 1 | equemene | * On entry, M specifies the number of rows of the matrix A.
|
| 86 | 1 | equemene | * M must be at least zero.
|
| 87 | 1 | equemene | *
|
| 88 | 1 | equemene | * N (input) const int
|
| 89 | 1 | equemene | * On entry, N specifies the number of columns of the matrix A.
|
| 90 | 1 | equemene | * N must be at least zero.
|
| 91 | 1 | equemene | *
|
| 92 | 1 | equemene | * A (output) double *
|
| 93 | 1 | equemene | * On entry, A points to an array of dimension (LDA,N). On exit,
|
| 94 | 1 | equemene | * this array contains the coefficients of the randomly
|
| 95 | 1 | equemene | * generated matrix.
|
| 96 | 1 | equemene | *
|
| 97 | 1 | equemene | * LDA (input) const int
|
| 98 | 1 | equemene | * On entry, LDA specifies the leading dimension of the array A.
|
| 99 | 1 | equemene | * LDA must be at least max(1,M).
|
| 100 | 1 | equemene | *
|
| 101 | 1 | equemene | * ISEED (input) const int
|
| 102 | 1 | equemene | * On entry, ISEED specifies the seed number to generate the
|
| 103 | 1 | equemene | * matrix A. ISEED must be at least zero.
|
| 104 | 1 | equemene | *
|
| 105 | 1 | equemene | * ---------------------------------------------------------------------
|
| 106 | 1 | equemene | */
|
| 107 | 1 | equemene | /*
|
| 108 | 1 | equemene | * .. Local Variables ..
|
| 109 | 1 | equemene | */
|
| 110 | 1 | equemene | int iadd[2], ia1[2], ic1[2], iran1[2], |
| 111 | 1 | equemene | jseed[2], mult[2]; |
| 112 | 1 | equemene | int i, incA = LDA - M, j;
|
| 113 | 1 | equemene | /* ..
|
| 114 | 1 | equemene | * .. Executable Statements ..
|
| 115 | 1 | equemene | */
|
| 116 | 1 | equemene | if( ( M <= 0 ) || ( N <= 0 ) ) return; |
| 117 | 1 | equemene | /*
|
| 118 | 1 | equemene | * Initialize the random sequence
|
| 119 | 1 | equemene | */
|
| 120 | 1 | equemene | mult [0] = HPL_MULT0; mult [1] = HPL_MULT1; |
| 121 | 1 | equemene | iadd [0] = HPL_IADD0; iadd [1] = HPL_IADD1; |
| 122 | 1 | equemene | jseed[0] = ISEED; jseed[1] = 0; |
| 123 | 1 | equemene | |
| 124 | 1 | equemene | HPL_xjumpm( 1, mult, iadd, jseed, iran1, ia1, ic1 );
|
| 125 | 1 | equemene | HPL_setran( 0, iran1 ); HPL_setran( 1, ia1 ); HPL_setran( 2, ic1 ); |
| 126 | 1 | equemene | /*
|
| 127 | 1 | equemene | * Generate an M by N matrix
|
| 128 | 1 | equemene | */
|
| 129 | 1 | equemene | for( j = 0; j < N; A += incA, j++ ) |
| 130 | 1 | equemene | for( i = 0; i < M; A++, i++ ) *A = HPL_rand(); |
| 131 | 1 | equemene | /*
|
| 132 | 1 | equemene | * End of HPL_dmatgen
|
| 133 | 1 | equemene | */
|
| 134 | 1 | equemene | } |