personal/time-to-botec
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

make format

Browse Source
This commit is contained in:
NunoSempere 2023-05-29 17:51:24 -04:00
parent 7724115933
commit 5dead1a2c1
1 changed files with 96 additions and 90 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

136
C-optimized/samples.c
View File

@ -1,8 +1,8 @@
#include <math.h> #include <math.h>
#include <omp.h>
#include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
#include <time.h> #include <time.h>
#include <stdio.h>
#include <omp.h>
const float PI = 3.14159265358979323846; const float PI = 3.14159265358979323846;
@ -10,67 +10,73 @@ const float PI = 3.14159265358979323846;
//Array helpers //Array helpers
void array_print(float* array, int length) { void array_print(float* array, int length)
for (int i = 0; i < length; i++)
{ {
for (int i = 0; i < length; i++) {
printf("item[%d] = %f\n", i, array[i]); printf("item[%d] = %f\n", i, array[i]);
} }
printf("\n"); printf("\n");
} }
void array_fill(float* array, int length, float item) { void array_fill(float* array, int length, float item)
{
int i; int i;
#pragma omp private(i) #pragma omp private(i)
{ {
#pragma omp for #pragma omp for
for (i = 0; i < length; i++) for (i = 0; i < length; i++) {
{
array[i] = item; array[i] = item;
} }
} }
} }
float array_sum(float* array, int length) { float array_sum(float* array, int length)
float output = 0.0;
for (int i = 0; i < length; i++)
{ {
float output = 0.0;
for (int i = 0; i < length; i++) {
output += array[i]; output += array[i];
} }
return output; return output;
} }
void array_cumsum(float* array_to_sum, float* array_cumsummed, int length) { void array_cumsum(float* array_to_sum, float* array_cumsummed, int length)
array_cumsummed[0] = array_to_sum[0];
for (int i = 1; i < length; i++)
{ {
array_cumsummed[0] = array_to_sum[0];
for (int i = 1; i < length; i++) {
array_cumsummed[i] = array_cumsummed[i - 1] + array_to_sum[i]; array_cumsummed[i] = array_cumsummed[i - 1] + array_to_sum[i];
} }
} }
float rand_float(float to) { float rand_float(float to)
{
return ((float)rand() / (float)RAND_MAX) * to; return ((float)rand() / (float)RAND_MAX) * to;
} }
float ur_normal() { float ur_normal()
{
float u1 = rand_float(1.0); float u1 = rand_float(1.0);
float u2 = rand_float(1.0); float u2 = rand_float(1.0);
float z = sqrtf(-2.0 * log(u1)) * sin(2 * PI * u2); float z = sqrtf(-2.0 * log(u1)) * sin(2 * PI * u2);
return z; return z;
} }
inline float random_uniform(float from, float to) { inline float random_uniform(float from, float to)
{
return ((float)rand() / (float)RAND_MAX) * (to - from) + from; return ((float)rand() / (float)RAND_MAX) * (to - from) + from;
} }
inline float random_normal(float mean, float sigma) { inline float random_normal(float mean, float sigma)
{
return (mean + sigma * ur_normal()); return (mean + sigma * ur_normal());
} }
inline float random_lognormal(float logmean, float logsigma) { inline float random_lognormal(float logmean, float logsigma)
{
return expf(random_normal(logmean, logsigma)); return expf(random_normal(logmean, logsigma));
} }
inline float random_to(float low, float high) { inline float random_to(float low, float high)
{
const float NORMAL95CONFIDENCE = 1.6448536269514722; const float NORMAL95CONFIDENCE = 1.6448536269514722;
float loglow = logf(low); float loglow = logf(low);
float loghigh = logf(high); float loghigh = logf(high);
@ -79,27 +85,31 @@ inline float random_to(float low, float high) {
return random_lognormal(logmean, logsigma); return random_lognormal(logmean, logsigma);
} }
void array_random_to(float* array, int length, float low, float high) { void array_random_to(float* array, int length, float low, float high)
{
int i; int i;
#pragma omp private(i) #pragma omp private(i)
{ {
#pragma omp for #pragma omp for
for (i = 0; i < length; i++) for (i = 0; i < length; i++) {
{
array[i] = random_to(low, high); array[i] = random_to(low, high);
} }
} }
} }
int split_array_get_my_length(int index, int total_length, int n_threads) { int split_array_get_my_length(int index, int total_length, int n_threads)
{
return (total_length % n_threads > index ? total_length / n_threads + 1 : total_length / n_threads); return (total_length % n_threads > index ? total_length / n_threads + 1 : total_length / n_threads);
} }
//Old version, don't use it!! Optimized version is called mixture_f. This one is just for display //Old version, don't use it!! Optimized version is called mixture_f. This one is just for display
void mixture(float* dists[], float* weights, int n_dists, float* results) { void mixture(float* dists[], float* weights, int n_dists, float* results)
{
float sum_weights = array_sum(weights, n_dists); float sum_weights = array_sum(weights, n_dists);
float* normalized_weights = malloc(n_dists * sizeof(float)); float* normalized_weights = malloc(n_dists * sizeof(float));
for (int i = 0; i < n_dists; i++) {normalized_weights[i] = weights[i] / sum_weights;} for (int i = 0; i < n_dists; i++) {
normalized_weights[i] = weights[i] / sum_weights;
}
float* cummulative_weights = malloc(n_dists * sizeof(float)); float* cummulative_weights = malloc(n_dists * sizeof(float));
array_cumsum(normalized_weights, cummulative_weights, n_dists); array_cumsum(normalized_weights, cummulative_weights, n_dists);
@ -111,40 +121,38 @@ void mixture(float* dists[], float* weights, int n_dists, float* results) {
#pragma omp parallel private(i, p1, p2, index_found, index_counter, sample_index) #pragma omp parallel private(i, p1, p2, index_found, index_counter, sample_index)
{ {
#pragma omp for #pragma omp for
for (i = 0; i < N; i++) for (i = 0; i < N; i++) {
{
p1 = random_uniform(0, 1); p1 = random_uniform(0, 1);
p2 = random_uniform(0, 1); p2 = random_uniform(0, 1);
index_found = 0; index_found = 0;
index_counter = 0; index_counter = 0;
while ((index_found == 0) && (index_counter < n_dists)) while ((index_found == 0) && (index_counter < n_dists)) {
{ if (p1 < cummulative_weights[index_counter]) {
if (p1 < cummulative_weights[index_counter])
{
index_found = 1; index_found = 1;
} else } else {
{
index_counter++; index_counter++;
} }
} }
if (index_found != 0) if (index_found != 0) {
{
sample_index = (int)(p2 * N); sample_index = (int)(p2 * N);
results[i] = dists[index_counter][sample_index]; results[i] = dists[index_counter][sample_index];
} } else
else printf("This shouldn't be able to happen.\n"); printf("This shouldn't be able to happen.\n");
} }
} }
free(normalized_weights); free(normalized_weights);
free(cummulative_weights); free(cummulative_weights);
} }
void mixture_f(float (*samplers[])(void), float* weights, int n_dists, float** results, int n_threads) { void mixture_f(float (*samplers[])(void), float* weights, int n_dists, float** results, int n_threads)
{
float sum_weights = array_sum(weights, n_dists); float sum_weights = array_sum(weights, n_dists);
float* normalized_weights = malloc(n_dists * sizeof(float)); float* normalized_weights = malloc(n_dists * sizeof(float));
for (int i = 0; i < n_dists; i++) {normalized_weights[i] = weights[i] / sum_weights;} for (int i = 0; i < n_dists; i++) {
normalized_weights[i] = weights[i] / sum_weights;
}
float* cummulative_weights = malloc(n_dists * sizeof(float)); float* cummulative_weights = malloc(n_dists * sizeof(float));
array_cumsum(normalized_weights, cummulative_weights, n_dists); array_cumsum(normalized_weights, cummulative_weights, n_dists);
@ -156,16 +164,12 @@ void mixture_f(float (*samplers[])(void), float* weights, int n_dists, float** r
#pragma omp parallel private(i, p1, sample_index, own_length) #pragma omp parallel private(i, p1, sample_index, own_length)
{ {
#pragma omp for #pragma omp for
for (i = 0; i < n_threads; i++) for (i = 0; i < n_threads; i++) {
{
own_length = split_array_get_my_length(i, N, n_threads); own_length = split_array_get_my_length(i, N, n_threads);
for (int j = 0; j < own_length; j++) for (int j = 0; j < own_length; j++) {
{
p1 = random_uniform(0, 1); p1 = random_uniform(0, 1);
for (int k = 0; k < n_dists; k++) for (int k = 0; k < n_dists; k++) {
{ if (p1 < cummulative_weights[k]) {
if (p1 < cummulative_weights[k])
{
results[i][j] = samplers[k](); results[i][j] = samplers[k]();
break; break;
} }
@ -177,65 +181,67 @@ void mixture_f(float (*samplers[])(void), float* weights, int n_dists, float** r
free(cummulative_weights); free(cummulative_weights);
} }
float sample_0() { float sample_0()
{
return 0; return 0;
} }
float sample_1() { float sample_1()
{
return 1; return 1;
} }
float sample_few() { float sample_few()
{
return random_to(1, 3); return random_to(1, 3);
} }
float sample_many() { float sample_many()
{
return random_to(2, 10); return random_to(2, 10);
} }
void split_array_allocate(float** meta_array, int length, int divide_into) { void split_array_allocate(float** meta_array, int length, int divide_into)
{
int own_length; int own_length;
for (int i = 0; i < divide_into; i++) for (int i = 0; i < divide_into; i++) {
{
own_length = split_array_get_my_length(i, length, divide_into); own_length = split_array_get_my_length(i, length, divide_into);
meta_array[i] = malloc(own_length * sizeof(float)); meta_array[i] = malloc(own_length * sizeof(float));
} }
} }
void split_array_free(float** meta_array, int divided_into) { void split_array_free(float** meta_array, int divided_into)
for (int i = 0; i < divided_into; i++)
{ {
for (int i = 0; i < divided_into; i++) {
free(meta_array[i]); free(meta_array[i]);
} }
free(meta_array); free(meta_array);
} }
float split_array_sum(float** meta_array, int length, int divided_into) { float split_array_sum(float** meta_array, int length, int divided_into)
{
int i; int i;
float output; float output;
float* partial_sum = malloc(divided_into * sizeof(float)); float* partial_sum = malloc(divided_into * sizeof(float));
#pragma omp private(i) shared(partial_sum) #pragma omp private(i) shared(partial_sum)
for (int i = 0; i < divided_into; i++) for (int i = 0; i < divided_into; i++) {
{
float own_partial_sum = 0; float own_partial_sum = 0;
int own_length = split_array_get_my_length(i, length, divided_into); int own_length = split_array_get_my_length(i, length, divided_into);
for (int j = 0; j < own_length; j++) for (int j = 0; j < own_length; j++) {
{
own_partial_sum += meta_array[i][j]; own_partial_sum += meta_array[i][j];
} }
partial_sum[i] = own_partial_sum; partial_sum[i] = own_partial_sum;
} }
for (int i = 0; i < divided_into; i++) for (int i = 0; i < divided_into; i++) {
{
output += partial_sum[i]; output += partial_sum[i];
} }
return output; return output;
} }
int main() { int main()
{
clock_t start, end; clock_t start, end;
start = clock(); start = clock();
//initialize randomness //initialize randomness