summaryrefslogtreecommitdiffstats
path: root/dis/Pointer/pointer.c
diff options
context:
space:
mode:
authorJoshua Bakita <jbakita@cs.unc.edu>2020-10-16 16:55:14 -0400
committerJoshua Bakita <jbakita@cs.unc.edu>2020-10-16 16:55:14 -0400
commit6ea9939e0610a809f6f47d13ec68df00d1ca0afc (patch)
treefe4a2eee3ddcf77e2367309dcd75a232b76dcd62 /dis/Pointer/pointer.c
parente9285d0cdea756a2830f0ace378e4197b36869aa (diff)
Move the DIS benchmarks up a directory and update hardcoded paths
Note that this repo does not attempt to keep a copy of the original DIS benchmark distributions. UNC real-time has another repo for that.
Diffstat (limited to 'dis/Pointer/pointer.c')
-rw-r--r--dis/Pointer/pointer.c159
1 files changed, 159 insertions, 0 deletions
diff --git a/dis/Pointer/pointer.c b/dis/Pointer/pointer.c
new file mode 100644
index 0000000..5671697
--- /dev/null
+++ b/dis/Pointer/pointer.c
@@ -0,0 +1,159 @@
1/*
2 * Sample code for the DIS Pointer 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#include <stdio.h>
16#include <time.h>
17#include <assert.h>
18#include <stdlib.h>
19#include "DISstressmarkRNG.h"
20#include "extra.h"
21
22#define MIN_FIELD_SIZE 16
23#define MAX_FIELD_SIZE (16777216*4) // Modifed from original
24#define MIN_WINDOW_SIZE 1
25#define MAX_WINDOW_SIZE 15
26#define MIN_HOP_LIMIT 1
27
28#define MAX_HOP_LIMIT 4294967295U
29
30#define MIN_SEED -2147483647
31#define MAX_SEED -1
32#define MIN_THREADS 1
33#define MAX_THREADS 256
34
35/*
36 * main()
37 */
38int main(int argc, char** argv){
39
40 unsigned int *field;
41 unsigned int f;
42 unsigned short int w;
43 unsigned int maxhops;
44 int seed;
45 unsigned int n;
46
47 clock_t startTime;
48
49 struct threadS{
50 unsigned int initial;
51 unsigned int minStop;
52 unsigned int maxStop;
53 unsigned int hops;
54 }*thread;
55
56 unsigned int l;
57 SET_UP
58
59 assert(fscanf(stdin, "%lu %u %lu %ld %u",
60 &f, &l, &maxhops, &seed, &n) == 5);
61
62 assert ((f >= MIN_FIELD_SIZE) && (f <= MAX_FIELD_SIZE));
63 w = (unsigned int) l;
64 assert ((w >= MIN_WINDOW_SIZE) && (w <= MAX_WINDOW_SIZE));
65 assert (w % 2 == 1);
66 assert (f > w);
67 assert ((maxhops >= MIN_HOP_LIMIT) && (maxhops <= MAX_HOP_LIMIT));
68 assert ((seed >= MIN_SEED) && (seed <= MAX_SEED));
69
70 assert ((n >= MIN_THREADS) && (n <= MAX_THREADS));
71 if ((thread = (struct threadS *)malloc(n*sizeof(struct threadS))) == NULL)
72 return (-1);
73
74 for (l=0; l<n; l++){
75 assert(fscanf(stdin, "%lu %lu %lu",
76 &(thread[l].initial), &(thread[l].minStop), &(thread[l].maxStop)) == 3);
77 assert ((thread[l].initial >= 0) && (thread[l].initial < f));
78 assert ((thread[l].minStop >= 0) && (thread[l].minStop < f));
79 assert ((thread[l].maxStop >= 0) && (thread[l].maxStop < f));
80 }
81
82 if ((field = (unsigned int *)malloc(f*sizeof(int))) == NULL)
83 return (-1);
84
85 randInit(seed);
86 for (l=0; l<f; l++){
87 field[l] = randInt(0, f-w);
88}
89startTime = time(NULL);
90clock();
91
92for (l=0; l<n; l++)
93{
94 START_LOOP
95 unsigned int index;
96 unsigned int minStop, maxStop;
97 unsigned int hops;
98
99 hops = 0;
100 minStop = thread[l].minStop;
101 maxStop = thread[l].maxStop;
102 index = thread[l].initial;
103 while ((hops < maxhops) &&
104 (!((index >= minStop) &&
105 (index < maxStop)))){
106
107 unsigned int ll, lll;
108 unsigned int max, min;
109 unsigned int partition;
110 unsigned int high;
111
112 partition = field[index];
113 max = MAX_FIELD_SIZE;
114 min = 0;
115 high = 0;
116
117 for (ll=0; ll<w; ll++){
118 unsigned int balance;
119 unsigned int x;
120 x = field[index+ll];
121
122 if (x > max) high++;
123 else if (x > min){ /* start else* */
124 partition = x;
125 balance = 0;
126 for (lll=ll+1; lll<w; lll++){
127 if (field[index+lll] > partition) balance++;
128 }/* end for loop */
129
130 if (balance+high == w/2) break;
131 else if (balance+high > w/2){
132 min = partition;
133 }/* end if */
134 else {
135 max = partition;
136 high++;
137 }/* end else */
138 }
139 if (min == max) break;
140 } /* end else* */
141 index = (partition+hops)%(f-w);
142 hops++;
143 }/* end loop ll */
144 thread[l].hops = hops;
145 STOP_LOOP
146} /* end while */
147
148 startTime = time(NULL) - startTime;
149
150 for (l=0; l<n; l++){
151 fprintf(stdout, "%lu hops on thread %d\n", thread[l].hops, l);
152 }
153
154 fprintf(stderr, "total time = %u seconds.\n", (unsigned int)startTime);
155 free (field);
156 free (thread);
157 WRITE_TO_FILE
158
159}