1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
/*
Brahe is a heterogenous collection of mathematical tools, written in Standard C.
Copyright 2011 Scott Robert Ladd. All rights reserved.
Brahe is user-supported open source software. Its continued development is dependent
on financial support from the community. You can provide funding by visiting the Brahe
website at:
http://www.coyotegulch.com
You may license Brahe in one of two fashions:
1) Simplified BSD License (FreeBSD License)
Redistribution and use in source and binary forms, with or without modification, are
permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of
conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice, this list
of conditions and the following disclaimer in the documentation and/or other materials
provided with the distribution.
THIS SOFTWARE IS PROVIDED BY SCOTT ROBERT LADD ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SCOTT ROBERT LADD OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
The views and conclusions contained in the software and documentation are those of the
authors and should not be interpreted as representing official policies, either expressed
or implied, of Scott Robert Ladd.
2) Closed-Source Proprietary License
If your project is a closed-source or proprietary project, the Simplified BSD License may
not be appropriate or desirable. In such cases, contact the Brahe copyright holder to
arrange your purchase of an appropriate license.
The author can be contacted at:
scott.ladd@coyotegulch.com
scott.ladd@gmail.com
http:www.coyotegulch.com
*/
#include "../src/prng.h"
#include <stdio.h>
#include <time.h>
static const size_t TEST_SIZE = 100000000;
static const size_t NUM_BUCKETS = 13;
double test_prng(brahe_prng_type_t prng_type)
{
uint32_t total, dummy;
size_t i;
double n, l, s;
int counts[NUM_BUCKETS];
brahe_prng_state_t prng_state;
struct timespec start, stop;
switch (prng_type)
{
case BRAHE_PRNG_MARSENNE_TWISTER:
printf("\n>>>> MARSENNE TWISTER <<<<\n");
break;
case BRAHE_PRNG_KISS:
printf("\n>>>> KISS <<<<\n");
break;
case BRAHE_PRNG_MWC1038:
printf("\n>>>> MWC1038 <<<<\n");
break;
case BRAHE_PRNG_CMWC4096:
printf("\n>>>> CMWC4096 <<<<\n");
break;
case BRAHE_PRNG_ISAAC:
printf("\n>>>> ISAAC <<<<\n");
break;
}
// create the generator
brahe_prng_init(&prng_state,prng_type,BRAHE_UNKNOWN_SEED);
// each real function
printf("\nrand_real1 - interval [0,1]\n");
s = 1.1;
l = -0.1;
for (i = 0; i < TEST_SIZE; ++i)
{
n = brahe_prng_real1(&prng_state);
if (n < s) s = n;
if (n > l) l = n;
}
printf(" largest = %15.14f\n smallest = %15.14f\n", l, s);
// each real function
printf("\nrand_real2 - interval [0,1)\n");
s = 1.1;
l = -0.1;
for (i = 0; i < TEST_SIZE; ++i)
{
n = brahe_prng_real2(&prng_state);
if (n < s) s = n;
if (n > l) l = n;
}
printf(" largest = %15.14f\n smallest = %15.14f\n", l, s);
// each real function
printf("\nrand_real3 - interval (0,1)\n");
s = 1.1;
l = -0.1;
for (i = 0; i < TEST_SIZE; ++i)
{
n = brahe_prng_real3(&prng_state);
if (n < s) s = n;
if (n > l) l = n;
}
printf(" largest = %15.14f\n smallest = %15.14f\n", l, s);
// each real function
printf("\nrand_real53 - interval [0,1) - 53-bit precision\n");
s = 1.1;
l = -0.1;
for (i = 0; i < TEST_SIZE; ++i)
{
n = brahe_prng_real53(&prng_state);
if (n < s) s = n;
if (n > l) l = n;
}
printf(" largest = %15.14f\n smallest = %15.14f\n", l, s);
// check ranges
for (i = 0; i < NUM_BUCKETS; ++i)
counts[i] = 0;
for (i = 0; i < TEST_SIZE; ++i)
++counts[brahe_prng_index(&prng_state,NUM_BUCKETS)];
printf("\n");
total = 0;
for (i = 0; i < NUM_BUCKETS; ++i)
{
printf("counts %3d = %10d\n", i, counts[i]);
total += counts[i];
}
printf(" total = %10d\n", total);
// get starting time
clock_gettime(CLOCK_REALTIME,&start);
// test generation speed
for (i = 0; i < TEST_SIZE; ++i)
dummy = brahe_prng_next(&prng_state);
// calculate run time
clock_gettime(CLOCK_REALTIME,&stop);
// free resources
brahe_prng_free(&prng_state);
// done
return ((stop.tv_sec - start.tv_sec) + (double)(stop.tv_nsec - start.tv_nsec) / 1000000000.0);
}
int main()
{
double mtwister_time = test_prng(BRAHE_PRNG_MARSENNE_TWISTER);
double kissrng_time = test_prng(BRAHE_PRNG_KISS);
double mwc1038_time = test_prng(BRAHE_PRNG_MWC1038);
double cmwc4096_time = test_prng(BRAHE_PRNG_CMWC4096);
double isaac_time = test_prng(BRAHE_PRNG_ISAAC);
printf("\nALGORITHM TIMING (random numbers / second)\n\n");
printf(" Marsenne Twister = %5.2f (%10.0f/sec)\n", mtwister_time, ((double)TEST_SIZE / mtwister_time));
printf(" KISS = %5.2f (%10.0f/sec)\n", kissrng_time, ((double)TEST_SIZE / kissrng_time));
printf(" MWC1038 = %5.2f (%10.0f/sec)\n", mwc1038_time, ((double)TEST_SIZE / mwc1038_time));
printf(" CMWC4096 = %5.2f (%10.0f/sec)\n", cmwc4096_time, ((double)TEST_SIZE / cmwc4096_time));
printf(" ISAAC = %5.2f (%10.0f/sec)\n", isaac_time, ((double)TEST_SIZE / isaac_time));
return 0;
}
|
