diff options
| author | Sebastiano Tronto <sebastiano@tronto.net> | 2024-04-29 21:59:51 +0200 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano@tronto.net> | 2024-04-29 21:59:51 +0200 |
| commit | 2f19e94b0ce78d6ccc9eedbf04b8a3460fd05565 (patch) | |
| tree | bc3a8cea30ecca96ed7ed779a1a4149ef9baa068 /sort-benchmark/integers | |
| download | taming-cpp-2f19e94b0ce78d6ccc9eedbf04b8a3460fd05565.tar.gz taming-cpp-2f19e94b0ce78d6ccc9eedbf04b8a3460fd05565.zip | |
Sort benchmarks
Diffstat (limited to 'sort-benchmark/integers')
| -rw-r--r-- | sort-benchmark/integers/Makefile | 20 | ||||
| -rw-r--r-- | sort-benchmark/integers/notes.txt | 11 | ||||
| -rw-r--r-- | sort-benchmark/integers/sort.c | 29 | ||||
| -rw-r--r-- | sort-benchmark/integers/sort.cpp | 25 | ||||
| -rw-r--r-- | sort-benchmark/integers/sort_parallel.cpp | 28 |
5 files changed, 113 insertions, 0 deletions
diff --git a/sort-benchmark/integers/Makefile b/sort-benchmark/integers/Makefile new file mode 100644 index 0000000..56a37ee --- /dev/null +++ b/sort-benchmark/integers/Makefile | |||
| @@ -0,0 +1,20 @@ | |||
| 1 | CC = gcc | ||
| 2 | CPP = g++ | ||
| 3 | OPT = -O3 | ||
| 4 | VAR = -DARRAYSIZE=100000000 | ||
| 5 | |||
| 6 | all: sort_c sort_cpp sort_parallel_cpp | ||
| 7 | |||
| 8 | sort_c: | ||
| 9 | ${CC} ${OPT} ${VAR} -std=c11 -o sort sort.c | ||
| 10 | ./sort | ||
| 11 | |||
| 12 | sort_cpp: | ||
| 13 | ${CPP} ${OPT} ${VAR} -std=c++20 -o sort sort.cpp | ||
| 14 | ./sort | ||
| 15 | |||
| 16 | sort_parallel_cpp: | ||
| 17 | ${CPP} ${OPT} ${VAR} -std=c++20 -o sort sort_parallel.cpp -ltbb | ||
| 18 | ./sort | ||
| 19 | |||
| 20 | .PHONY: sort_c sort_cpp sort_parallel_cpp | ||
diff --git a/sort-benchmark/integers/notes.txt b/sort-benchmark/integers/notes.txt new file mode 100644 index 0000000..7984803 --- /dev/null +++ b/sort-benchmark/integers/notes.txt | |||
| @@ -0,0 +1,11 @@ | |||
| 1 | - Getting the parallel version to work was a pain. Two major gotchas: | ||
| 2 | (1) -ltbb had to be added *at the end* of the command line | ||
| 3 | (2) clang requires a libstdc++ option to make this work | ||
| 4 | of course everything was terrible to decipher with C++ compile errors | ||
| 5 | being the mess they are. | ||
| 6 | - For measuring time I could also use | ||
| 7 | clock_t begin = clock(); | ||
| 8 | ... | ||
| 9 | clock_t end = clock(); | ||
| 10 | double time = (dobule)(end - begin) / CLOCKS_PER_SEC; | ||
| 11 | but it does not work with the parallel version (it meausres CPU clocks). | ||
diff --git a/sort-benchmark/integers/sort.c b/sort-benchmark/integers/sort.c new file mode 100644 index 0000000..2a23d9d --- /dev/null +++ b/sort-benchmark/integers/sort.c | |||
| @@ -0,0 +1,29 @@ | |||
| 1 | #define _POSIX_C_SOURCE 200809L /* Required to use clock_gettime */ | ||
| 2 | |||
| 3 | #include <stdio.h> | ||
| 4 | #include <stdlib.h> | ||
| 5 | #include <time.h> | ||
| 6 | |||
| 7 | int a[ARRAYSIZE]; | ||
| 8 | |||
| 9 | int compar(const void *x, const void *y) { return *(int *)x - *(int *)y; } | ||
| 10 | |||
| 11 | int main() { | ||
| 12 | srand(time(NULL)); | ||
| 13 | for (int i = 0; i < ARRAYSIZE; i++) a[i] = rand() % 1000000000; | ||
| 14 | |||
| 15 | struct timespec begin; | ||
| 16 | clock_gettime(CLOCK_MONOTONIC, &begin); | ||
| 17 | |||
| 18 | qsort(a, ARRAYSIZE, sizeof(int), compar); | ||
| 19 | |||
| 20 | struct timespec end; | ||
| 21 | clock_gettime(CLOCK_MONOTONIC, &end); | ||
| 22 | double time = end.tv_sec - begin.tv_sec + | ||
| 23 | (end.tv_nsec - begin.tv_nsec) / 1000000000.0; | ||
| 24 | |||
| 25 | printf("(%d) C time for %d numbers: %lfs\n", | ||
| 26 | a[ARRAYSIZE/2], ARRAYSIZE, time); | ||
| 27 | |||
| 28 | return 0; | ||
| 29 | } | ||
diff --git a/sort-benchmark/integers/sort.cpp b/sort-benchmark/integers/sort.cpp new file mode 100644 index 0000000..3434d7f --- /dev/null +++ b/sort-benchmark/integers/sort.cpp | |||
| @@ -0,0 +1,25 @@ | |||
| 1 | #include <algorithm> | ||
| 2 | #include <cstdlib> | ||
| 3 | #include <ctime> | ||
| 4 | #include <iostream> | ||
| 5 | |||
| 6 | int a[ARRAYSIZE]; | ||
| 7 | |||
| 8 | int main(void) { | ||
| 9 | srand(time(NULL)); | ||
| 10 | for (auto &x : a) x = rand() % 1000000000; | ||
| 11 | |||
| 12 | struct timespec begin; | ||
| 13 | clock_gettime(CLOCK_MONOTONIC, &begin); | ||
| 14 | |||
| 15 | std::sort(a, a+ARRAYSIZE, | ||
| 16 | [](const int &x, const int &y) { return x < y; }); | ||
| 17 | |||
| 18 | struct timespec end; | ||
| 19 | clock_gettime(CLOCK_MONOTONIC, &end); | ||
| 20 | double time = end.tv_sec - begin.tv_sec + | ||
| 21 | (end.tv_nsec - begin.tv_nsec) / 1000000000.0; | ||
| 22 | |||
| 23 | std::cout << "(" << a[ARRAYSIZE/2] << ") C++ time for " << ARRAYSIZE | ||
| 24 | << " numbers: " << time << "s\n"; | ||
| 25 | } | ||
diff --git a/sort-benchmark/integers/sort_parallel.cpp b/sort-benchmark/integers/sort_parallel.cpp new file mode 100644 index 0000000..5de4158 --- /dev/null +++ b/sort-benchmark/integers/sort_parallel.cpp | |||
| @@ -0,0 +1,28 @@ | |||
| 1 | /* Requires Thread Building Blocks (libtbb-dev on Debian) */ | ||
| 2 | |||
| 3 | #include <algorithm> | ||
| 4 | #include <cstdlib> | ||
| 5 | #include <ctime> | ||
| 6 | #include <execution> | ||
| 7 | #include <iostream> | ||
| 8 | |||
| 9 | int a[ARRAYSIZE]; | ||
| 10 | |||
| 11 | int main(void) { | ||
| 12 | srand(time(NULL)); | ||
| 13 | for (auto &x : a) x = rand() % 1000000000; | ||
| 14 | |||
| 15 | struct timespec begin; | ||
| 16 | clock_gettime(CLOCK_MONOTONIC, &begin); | ||
| 17 | |||
| 18 | std::sort(std::execution::par, a, a+ARRAYSIZE, | ||
| 19 | [](const int &x, const int &y) { return x < y; }); | ||
| 20 | |||
| 21 | struct timespec end; | ||
| 22 | clock_gettime(CLOCK_MONOTONIC, &end); | ||
| 23 | double time = end.tv_sec - begin.tv_sec + | ||
| 24 | (end.tv_nsec - begin.tv_nsec) / 1000000000.0; | ||
| 25 | |||
| 26 | std::cout << "(" << a[ARRAYSIZE/2] << ") C++ time for " << ARRAYSIZE | ||
| 27 | << " numbers (parallel): " << time << "s\n"; | ||
| 28 | } | ||
