2023-11-27 12:45:19 +00:00
|
|
|
#include "../../../squiggle.h"
|
|
|
|
#include "../../../squiggle_more.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
/* Question: can we parallelize this?
|
|
|
|
A = normal(5,2)
|
|
|
|
B = min(A)
|
|
|
|
B * 20
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Option 1: parallelize taking from n samples */
|
|
|
|
// Question being asked: what is the distribution of sampling 1000 times and taking the min?
|
2023-11-29 23:10:22 +00:00
|
|
|
double sample_min_of_n(uint64_t * seed, int n)
|
|
|
|
{
|
2023-11-27 12:45:19 +00:00
|
|
|
double min = sample_normal(5, 2, seed);
|
2023-11-29 23:10:22 +00:00
|
|
|
for (int i = 0; i < (n - 2); i++) {
|
2023-11-27 12:45:19 +00:00
|
|
|
double sample = sample_normal(5, 2, seed);
|
2023-11-29 23:10:22 +00:00
|
|
|
if (sample < min) {
|
2023-11-27 12:45:19 +00:00
|
|
|
min = sample;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return min;
|
|
|
|
}
|
2023-11-29 23:10:22 +00:00
|
|
|
double sample_min_of_1000(uint64_t * seed)
|
|
|
|
{
|
2023-11-27 12:45:19 +00:00
|
|
|
return sample_min_of_n(seed, 1000);
|
2023-11-29 23:10:22 +00:00
|
|
|
}
|
2023-11-27 12:45:19 +00:00
|
|
|
|
|
|
|
int n_samples = 1000000, n_threads = 16;
|
|
|
|
double* results = malloc(n_samples * sizeof(double));
|
2023-11-29 23:08:36 +00:00
|
|
|
sampler_parallel(sample_min_of_1000, results, n_threads, n_samples);
|
2023-11-27 12:45:19 +00:00
|
|
|
printf("Mean of the distribution of (taking the min of 1000 samples of a normal(5,2)): %f\n", array_mean(results, n_samples));
|
|
|
|
free(results);
|
|
|
|
|
|
|
|
/* Option 2: take the min from n samples cleverly using parallelism */
|
|
|
|
// Question being asked: can we take the min of n samples cleverly?
|
2023-11-29 23:10:22 +00:00
|
|
|
double sample_n_parallel(int n)
|
|
|
|
{
|
2023-11-27 12:45:19 +00:00
|
|
|
|
|
|
|
int n_threads = 16;
|
|
|
|
int quotient = n / 16;
|
|
|
|
int remainder = n % 16;
|
|
|
|
|
|
|
|
uint64_t seed = 1000;
|
|
|
|
double result_remainder = sample_min_of_n(&seed, remainder);
|
2023-11-29 23:10:22 +00:00
|
|
|
|
|
|
|
double sample_min_of_quotient(uint64_t * seed)
|
|
|
|
{
|
2023-11-27 12:45:19 +00:00
|
|
|
return sample_min_of_n(seed, quotient);
|
|
|
|
}
|
|
|
|
double* results_quotient = malloc(quotient * sizeof(double));
|
2023-11-29 22:51:58 +00:00
|
|
|
sampler_parallel(sample_min_of_quotient, results_quotient, n_threads, quotient);
|
2023-11-27 12:45:19 +00:00
|
|
|
|
|
|
|
double min = results_quotient[0];
|
2023-11-29 23:10:22 +00:00
|
|
|
for (int i = 1; i < quotient; i++) {
|
|
|
|
if (min > results_quotient[i]) {
|
2023-11-27 12:45:19 +00:00
|
|
|
min = results_quotient[i];
|
|
|
|
}
|
|
|
|
}
|
2023-11-29 23:10:22 +00:00
|
|
|
if (min > result_remainder) {
|
2023-11-29 23:08:36 +00:00
|
|
|
min = result_remainder;
|
2023-11-27 12:45:19 +00:00
|
|
|
}
|
|
|
|
free(results_quotient);
|
|
|
|
return min;
|
|
|
|
}
|
|
|
|
printf("Minimum of 1M samples of normal(5,2): %f\n", sample_n_parallel(1000000));
|
|
|
|
}
|