summaryrefslogtreecommitdiffstats
path: root/dis/original/Update
diff options
context:
space:
mode:
authorJoshua Bakita <bakitajoshua@gmail.com>2019-10-19 10:50:11 -0400
committerJoshua Bakita <bakitajoshua@gmail.com>2019-10-19 10:50:11 -0400
commit7e6ceb16b53fdbdb2a27cf3ade15d32177ff811f (patch)
treed6cf9044570b8b9707e89260d7267bcd69e163e7 /dis/original/Update
parent386b7d3366f1359a265da207a9cafa3edf553b64 (diff)
Add DIS benchmarks
Diffstat (limited to 'dis/original/Update')
-rw-r--r--dis/original/Update/DISstressmarkRNG.h190
-rw-r--r--dis/original/Update/update.c133
2 files changed, 323 insertions, 0 deletions
diff --git a/dis/original/Update/DISstressmarkRNG.h b/dis/original/Update/DISstressmarkRNG.h
new file mode 100644
index 0000000..4aa2620
--- /dev/null
+++ b/dis/original/Update/DISstressmarkRNG.h
@@ -0,0 +1,190 @@
1#include <math.h>
2
3#define IA 16807
4#define IM 2147483647
5#define AM (1.0/IM)
6#define IQ 127773
7#define IR 2836
8#define NTAB 32
9#define NDIV (1+(IM-1)/NTAB)
10#define EPS 1.2e-7
11#define RNMX (1.0-EPS)
12
13static long iy=0;
14static long iv[NTAB];
15static long iseed;
16
17int ABS(int x){
18 if (x>= 0) return x;
19 else
20 return (-x);
21}
22
23int sign(int x){
24 if (x >= 0) return 1;
25 else
26 return (-1);
27}
28
29int MAX(int x, int y){
30 if (x>= y) return x;
31 else
32 return y;
33}
34
35int MIN(int x, int y){
36 if (x<= y) return x;
37 else
38 return y;
39}
40
41void randInit(long idum)
42{
43 long j;
44 long k;
45
46 assert (idum <= 0);
47 assert (iy == 0);
48
49 iseed = idum;
50 if (-(iseed)<1){
51 iseed = 1;
52 }
53 else {
54 iseed = -(iseed);
55 }
56 for (j=NTAB+7; j>=0; j--){
57 k = (iseed)/IQ;
58 iseed = IA*(iseed-k*IQ)-IR*k;
59 if (iseed < 0){
60 iseed += IM;
61 }
62 if (j < NTAB){
63 iv[j] = iseed;
64 }
65 }
66 iy = iv[0];
67}
68
69float randNum()
70{
71 long j;
72 long k;
73 float temp;
74
75 assert (iy != 0);
76
77 k = (iseed)/IQ;
78 iseed = IA*(iseed-k*IQ)-IR*k;
79
80 if (iseed < 0){
81 iseed += IM;
82 }
83 j = iy/NDIV;
84 iy = iv[j];
85 iv[j] = iseed;
86
87 temp = AM * iy;
88
89 if (temp > RNMX){
90 return RNMX;
91 }
92 else {
93 return temp;
94 }
95}
96
97
98float randomFloat(float lowest_float, float highest_float)
99{
100 float value;
101 float range;
102
103assert (lowest_float < highest_float);
104
105range = highest_float - lowest_float;
106value = randNum()*(highest_float - lowest_float) + lowest_float;
107assert(value >= lowest_float);
108assert(value <= highest_float);
109
110return value;
111
112}
113
114float randomNonZeroFloat(float lowest_float, float highest_float, float epsilon)
115{
116
117 double range;
118 float value;
119
120
121 assert (lowest_float < 0);
122 assert (highest_float > 0);
123 assert (epsilon > 0);
124 assert ((epsilon < -lowest_float) && (epsilon < highest_float));
125
126 range = highest_float - lowest_float;
127 value = (randNum() * range)+lowest_float;
128
129 if (ABS(value) < epsilon)
130 {
131 if (value > 0) value = value + epsilon;
132 else if (value < 0) value = value - epsilon;
133
134 }
135
136 assert (value >= lowest_float);
137 assert (value <= highest_float);
138
139 return value;
140}
141
142unsigned int randomUInt(int lowest_uint, int highest_uint)
143{
144 float range;
145 unsigned int value;
146 float temp;
147
148 range =(float)(highest_uint - lowest_uint + 1);
149 temp = randNum();
150 value =(unsigned int)( floor(temp * range) + lowest_uint);
151
152 assert (value >= lowest_uint);
153 assert (value <= highest_uint);
154
155 return value;
156}
157
158unsigned int randomNonZeroUInt(int lowest_uint, int highest_uint)
159{
160 float range;
161 unsigned int value;
162 float temp;
163
164 range =(float)(highest_uint - lowest_uint + 1);
165 value = 0;
166 while(value == 0){
167 temp = randNum();
168
169 value =(unsigned int)( floor(temp * range) + lowest_uint);
170 }
171
172 assert (value >= lowest_uint);
173 assert (value <= highest_uint);
174
175 return value;
176}
177
178int randInt(int lowest_uint, int highest_uint)
179{
180 float range;
181 int value;
182
183 range = highest_uint - lowest_uint + 1;
184 value = (int)(floor(randNum() * range) + lowest_uint);
185
186 assert (value >= lowest_uint);
187 assert (value <= highest_uint);
188
189 return value;
190}
diff --git a/dis/original/Update/update.c b/dis/original/Update/update.c
new file mode 100644
index 0000000..51e1530
--- /dev/null
+++ b/dis/original/Update/update.c
@@ -0,0 +1,133 @@
1/*
2 * Sample code for the DIS Update Stressmark
3 *
4 * This source code is the completely correct source code based on
5 * the example codes provided by Atlantic Aerospace Division, Titan
6 * Systems Corporation, 2000.
7 *
8 * If you just compile and generate the executables from this source
9 * code, this code would be enough. However, if you wish to get a complete
10 * understanding of this stressmark, it is strongly suggested that you
11 * read the Benchmark Analysis and Specifications Document Version 1.0
12 * before going on since the detailed comments are given in this documents.
13 * the comments are not repeated here.
14 */
15
16#include <stdio.h>
17#include <stdlib.h>
18#include <time.h>
19#include<assert.h>
20#include "DISstressmarkRNG.h"
21
22#define MIN_FIELD_SIZE 16
23
24#define MAX_FIELD_SIZE 16777216
25
26#define MIN_WINDOW_SIZE 1
27
28#define MAX_WINDOW_SIZE 15
29
30#define MIN_HOP_LIMIT 1
31
32#define MAX_HOP_LIMIT 4294967295U
33
34#define MIN_SEED -2147483647
35
36#define MAX_SEED -1
37
38/*
39 *main()
40 */
41
42int main(){
43
44 unsigned int *field;
45 unsigned int f;
46 unsigned int index;
47 unsigned short int w;
48 unsigned int maxhops;
49 int seed;
50 time_t startTime;
51 unsigned int initial;
52 unsigned int minStop;
53 unsigned int maxStop;
54 unsigned int hops;
55 unsigned int l;
56
57 fscanf(stdin, "%u %u %u %d %u %u %u",
58 &f, &l, &maxhops, &seed, &initial, &minStop, &maxStop);
59
60 assert((f >= MIN_FIELD_SIZE) && (f <= MAX_FIELD_SIZE));
61 w = (unsigned int )l;
62 assert((w >= MIN_WINDOW_SIZE) && (w <= MAX_WINDOW_SIZE));
63 assert(w%2 == 1);
64 assert(f > w);
65 assert((maxhops >= MIN_HOP_LIMIT) && (maxhops <= MAX_HOP_LIMIT));
66 assert((seed >= MIN_SEED) && (seed <= MAX_SEED));
67 assert((initial >= 0) && (initial < f));
68 assert((minStop >= 0) && (minStop < f));
69 assert((maxStop >= 0) && (maxStop < f));
70
71 if ((field = (unsigned int *)malloc(f*sizeof(int))) == NULL)
72 return (-1);
73
74 randInit(seed);
75 for (l=0; l<f; l++){
76 field[l] = randInt(0, f-w);
77 }
78
79 startTime = time(NULL);
80
81 hops = 0;
82 index = initial;
83
84 while ((hops < maxhops) &&
85 (!((index >= minStop) &&
86 (index < maxStop)))){
87 int sum;
88
89 unsigned int ll, lll;
90 unsigned int max, min;
91 unsigned int partition;
92 unsigned int high;
93 max = MAX_FIELD_SIZE;
94 min = 0;
95 high = 0;
96 sum = 0;
97
98 for (ll=0; ll<w; ll++){
99 unsigned int balance;
100 unsigned int x;
101 x = field[index+ll];
102 sum += x;
103
104 if (x > max) high++;
105 else if (x >min){ /* start else* */
106 partition = x;
107 balance = 0;
108 for (lll=ll+1; lll<w; lll++){
109 if (field[index+lll] > partition) balance++;
110 }
111 if (balance+high == w/2) break;
112 else if (balance+high>w/2){
113 min = partition;
114 }/* end if */
115 else{
116 max = partition;
117 high++;
118 } /* end else */
119 }
120 if (min == max) break;
121 }/* end else* */
122 field[index] = sum % (f-w);
123 index = (partition+hops)%(f-w);
124 hops++;
125 }/* end for loop */
126
127 startTime = time(NULL) - startTime;
128
129 fprintf(stdout, "%u hops\n", hops);
130 fprintf(stderr, "total time = %u seconds.\n", (unsigned int)startTime);
131 free(field);
132 return(1);
133}