diff options
| author | Joshua Bakita <bakitajoshua@gmail.com> | 2019-10-19 10:50:11 -0400 |
|---|---|---|
| committer | Joshua Bakita <bakitajoshua@gmail.com> | 2019-10-19 10:50:11 -0400 |
| commit | 7e6ceb16b53fdbdb2a27cf3ade15d32177ff811f (patch) | |
| tree | d6cf9044570b8b9707e89260d7267bcd69e163e7 /dis/original/Pointer | |
| parent | 386b7d3366f1359a265da207a9cafa3edf553b64 (diff) | |
Add DIS benchmarks
Diffstat (limited to 'dis/original/Pointer')
| -rw-r--r-- | dis/original/Pointer/DISstressmarkRNG.h | 190 | ||||
| -rw-r--r-- | dis/original/Pointer/pointer.c | 155 |
2 files changed, 345 insertions, 0 deletions
diff --git a/dis/original/Pointer/DISstressmarkRNG.h b/dis/original/Pointer/DISstressmarkRNG.h new file mode 100644 index 0000000..4aa2620 --- /dev/null +++ b/dis/original/Pointer/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 | |||
| 13 | static long iy=0; | ||
| 14 | static long iv[NTAB]; | ||
| 15 | static long iseed; | ||
| 16 | |||
| 17 | int ABS(int x){ | ||
| 18 | if (x>= 0) return x; | ||
| 19 | else | ||
| 20 | return (-x); | ||
| 21 | } | ||
| 22 | |||
| 23 | int sign(int x){ | ||
| 24 | if (x >= 0) return 1; | ||
| 25 | else | ||
| 26 | return (-1); | ||
| 27 | } | ||
| 28 | |||
| 29 | int MAX(int x, int y){ | ||
| 30 | if (x>= y) return x; | ||
| 31 | else | ||
| 32 | return y; | ||
| 33 | } | ||
| 34 | |||
| 35 | int MIN(int x, int y){ | ||
| 36 | if (x<= y) return x; | ||
| 37 | else | ||
| 38 | return y; | ||
| 39 | } | ||
| 40 | |||
| 41 | void 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 | |||
| 69 | float 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 | |||
| 98 | float randomFloat(float lowest_float, float highest_float) | ||
| 99 | { | ||
| 100 | float value; | ||
| 101 | float range; | ||
| 102 | |||
| 103 | assert (lowest_float < highest_float); | ||
| 104 | |||
| 105 | range = highest_float - lowest_float; | ||
| 106 | value = randNum()*(highest_float - lowest_float) + lowest_float; | ||
| 107 | assert(value >= lowest_float); | ||
| 108 | assert(value <= highest_float); | ||
| 109 | |||
| 110 | return value; | ||
| 111 | |||
| 112 | } | ||
| 113 | |||
| 114 | float 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 | |||
| 142 | unsigned 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 | |||
| 158 | unsigned 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 | |||
| 178 | int 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/Pointer/pointer.c b/dis/original/Pointer/pointer.c new file mode 100644 index 0000000..0c4966f --- /dev/null +++ b/dis/original/Pointer/pointer.c | |||
| @@ -0,0 +1,155 @@ | |||
| 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 | |||
| 21 | #define MIN_FIELD_SIZE 16 | ||
| 22 | #define MAX_FIELD_SIZE 16777216 | ||
| 23 | #define MIN_WINDOW_SIZE 1 | ||
| 24 | #define MAX_WINDOW_SIZE 15 | ||
| 25 | #define MIN_HOP_LIMIT 1 | ||
| 26 | |||
| 27 | #define MAX_HOP_LIMIT 4294967295U | ||
| 28 | |||
| 29 | #define MIN_SEED -2147483647 | ||
| 30 | #define MAX_SEED -1 | ||
| 31 | #define MIN_THREADS 1 | ||
| 32 | #define MAX_THREADS 256 | ||
| 33 | |||
| 34 | /* | ||
| 35 | * main() | ||
| 36 | */ | ||
| 37 | int main(){ | ||
| 38 | |||
| 39 | unsigned int *field; | ||
| 40 | unsigned int f; | ||
| 41 | unsigned short int w; | ||
| 42 | unsigned int maxhops; | ||
| 43 | int seed; | ||
| 44 | unsigned int n; | ||
| 45 | |||
| 46 | clock_t startTime; | ||
| 47 | |||
| 48 | struct threadS{ | ||
| 49 | unsigned int initial; | ||
| 50 | unsigned int minStop; | ||
| 51 | unsigned int maxStop; | ||
| 52 | unsigned int hops; | ||
| 53 | }*thread; | ||
| 54 | |||
| 55 | unsigned int l; | ||
| 56 | |||
| 57 | fscanf(stdin, "%lu %u %lu %ld %u", | ||
| 58 | &f, &l, &maxhops, &seed, &n); | ||
| 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 | |||
| 68 | assert ((n >= MIN_THREADS) && (n <= MAX_THREADS)); | ||
| 69 | if ((thread = (struct threadS *)malloc(n*sizeof(struct threadS))) == NULL) | ||
| 70 | return (-1); | ||
| 71 | |||
| 72 | for (l=0; l<n; l++){ | ||
| 73 | fscanf(stdin, "%lu %lu %lu", | ||
| 74 | &(thread[l].initial), &(thread[l].minStop), &(thread[l].maxStop)); | ||
| 75 | assert ((thread[l].initial >= 0) && (thread[l].initial < f)); | ||
| 76 | assert ((thread[l].minStop >= 0) && (thread[l].minStop < f)); | ||
| 77 | assert ((thread[l].maxStop >= 0) && (thread[l].maxStop < f)); | ||
| 78 | } | ||
| 79 | |||
| 80 | if ((field = (unsigned int *)malloc(f*sizeof(int))) == NULL) | ||
| 81 | return (-1); | ||
| 82 | |||
| 83 | randInit(seed); | ||
| 84 | for (l=0; l<f; l++){ | ||
| 85 | field[l] = randInt(0, f-w); | ||
| 86 | } | ||
| 87 | |||
| 88 | startTime = time(NULL); | ||
| 89 | clock(); | ||
| 90 | |||
| 91 | for (l=0; l<n; l++) | ||
| 92 | { | ||
| 93 | unsigned int index; | ||
| 94 | unsigned int minStop, maxStop; | ||
| 95 | unsigned int hops; | ||
| 96 | |||
| 97 | hops = 0; | ||
| 98 | minStop = thread[l].minStop; | ||
| 99 | maxStop = thread[l].maxStop; | ||
| 100 | index = thread[l].initial; | ||
| 101 | while ((hops < maxhops) && | ||
| 102 | (!((index >= minStop) && | ||
| 103 | (index < maxStop)))){ | ||
| 104 | |||
| 105 | unsigned int ll, lll; | ||
| 106 | unsigned int max, min; | ||
| 107 | unsigned int partition; | ||
| 108 | unsigned int high; | ||
| 109 | |||
| 110 | partition = field[index]; | ||
| 111 | max = MAX_FIELD_SIZE; | ||
| 112 | min = 0; | ||
| 113 | high = 0; | ||
| 114 | |||
| 115 | for (ll=0; ll<w; ll++){ | ||
| 116 | unsigned int balance; | ||
| 117 | unsigned int x; | ||
| 118 | x = field[index+ll]; | ||
| 119 | |||
| 120 | if (x > max) high++; | ||
| 121 | else if (x > min){ /* start else* */ | ||
| 122 | partition = x; | ||
| 123 | balance = 0; | ||
| 124 | for (lll=ll+1; lll<w; lll++){ | ||
| 125 | if (field[index+lll] > partition) balance++; | ||
| 126 | }/* end for loop */ | ||
| 127 | |||
| 128 | if (balance+high == w/2) break; | ||
| 129 | else if (balance+high > w/2){ | ||
| 130 | min = partition; | ||
| 131 | }/* end if */ | ||
| 132 | else { | ||
| 133 | max = partition; | ||
| 134 | high++; | ||
| 135 | }/* end else */ | ||
| 136 | } | ||
| 137 | if (min == max) break; | ||
| 138 | } /* end else* */ | ||
| 139 | index = (partition+hops)%(f-w); | ||
| 140 | hops++; | ||
| 141 | }/* end loop ll */ | ||
| 142 | thread[l].hops = hops; | ||
| 143 | } /* end while */ | ||
| 144 | |||
| 145 | startTime = time(NULL) - startTime; | ||
| 146 | |||
| 147 | for (l=0; l<n; l++){ | ||
| 148 | fprintf(stdout, "%lu hops on thread %d\n", thread[l].hops, l); | ||
| 149 | } | ||
| 150 | |||
| 151 | fprintf(stderr, "total time = %u seconds.\n", (unsigned int)startTime); | ||
| 152 | free (field); | ||
| 153 | free (thread); | ||
| 154 | |||
| 155 | } | ||
