root / testing / matgen / HPL_rand.c
Historique | Voir | Annoter | Télécharger (4,53 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 | double HPL_rand( void ) |
| 54 | 1 | equemene | #else
|
| 55 | 1 | equemene | double HPL_rand()
|
| 56 | 1 | equemene | #endif
|
| 57 | 1 | equemene | {
|
| 58 | 1 | equemene | /*
|
| 59 | 1 | equemene | * Purpose
|
| 60 | 1 | equemene | * =======
|
| 61 | 1 | equemene | *
|
| 62 | 1 | equemene | * HPL_rand generates the next number in the random sequence. This
|
| 63 | 1 | equemene | * function ensures that this number lies in the interval (-0.5, 0.5].
|
| 64 | 1 | equemene | *
|
| 65 | 1 | equemene | * The static array irand contains the information (2 integers) required
|
| 66 | 1 | equemene | * to generate the next number in the sequence X(n). This number is
|
| 67 | 1 | equemene | * computed as X(n) = (2^32 * irand[1] + irand[0]) / d - 0.5, where the
|
| 68 | 1 | equemene | * constant d is the largest 64 bit positive unsigned integer. The array
|
| 69 | 1 | equemene | * irand is then updated for the generation of the next number X(n+1)
|
| 70 | 1 | equemene | * in the random sequence as follows X(n+1) = a * X(n) + c. The
|
| 71 | 1 | equemene | * constants a and c should have been preliminarily stored in the arrays
|
| 72 | 1 | equemene | * ias and ics as 2 pairs of integers. The initialization of ias, ics
|
| 73 | 1 | equemene | * and irand is performed by the function HPL_setran.
|
| 74 | 1 | equemene | *
|
| 75 | 1 | equemene | * ---------------------------------------------------------------------
|
| 76 | 1 | equemene | */
|
| 77 | 1 | equemene | /*
|
| 78 | 1 | equemene | * .. Local Variables ..
|
| 79 | 1 | equemene | */
|
| 80 | 1 | equemene | int j[2]; |
| 81 | 1 | equemene | /* ..
|
| 82 | 1 | equemene | * .. Executable Statements ..
|
| 83 | 1 | equemene | */
|
| 84 | 1 | equemene | HPL_setran( 3, j );
|
| 85 | 1 | equemene | /*
|
| 86 | 1 | equemene | * return number between -0.5 and 0.5
|
| 87 | 1 | equemene | */
|
| 88 | 1 | equemene | return( HPL_HALF -
|
| 89 | 1 | equemene | (((j[0] & 65535) + ((unsigned)j[0] >> 16) * HPL_POW16) / HPL_DIVFAC * HPL_HALF + |
| 90 | 1 | equemene | (j[1] & 65535) + ((unsigned)j[1] >> 16) * HPL_POW16) / HPL_DIVFAC * HPL_HALF ); |
| 91 | 1 | equemene | /*
|
| 92 | 1 | equemene | * End of HPL_rand
|
| 93 | 1 | equemene | */
|
| 94 | 1 | equemene | } |