diff options
author | Adrian Kummerlaender | 2021-09-07 20:42:14 +0200 |
---|---|---|
committer | Adrian Kummerlaender | 2021-09-07 20:45:59 +0200 |
commit | 03c9a7b60cd34358b9df7bb8ce31b5692d40555b (patch) | |
tree | 06e83510db0af07e255690f0ee54ef6439b006b4 /tangle/benchmark-ldc.cu | |
parent | 8691f6f7306914d8fc9d5afc8a347ebf5ce0a7d7 (diff) | |
download | LiterateLB-03c9a7b60cd34358b9df7bb8ce31b5692d40555b.tar LiterateLB-03c9a7b60cd34358b9df7bb8ce31b5692d40555b.tar.gz LiterateLB-03c9a7b60cd34358b9df7bb8ce31b5692d40555b.tar.bz2 LiterateLB-03c9a7b60cd34358b9df7bb8ce31b5692d40555b.tar.lz LiterateLB-03c9a7b60cd34358b9df7bb8ce31b5692d40555b.tar.xz LiterateLB-03c9a7b60cd34358b9df7bb8ce31b5692d40555b.tar.zst LiterateLB-03c9a7b60cd34358b9df7bb8ce31b5692d40555b.zip |
Remove double precision storage support for benchmark
Single precision only requires half the bandwidth and is
generally good enough for applications.
Diffstat (limited to 'tangle/benchmark-ldc.cu')
-rw-r--r-- | tangle/benchmark-ldc.cu | 21 |
1 files changed, 3 insertions, 18 deletions
diff --git a/tangle/benchmark-ldc.cu b/tangle/benchmark-ldc.cu index 4de0ae5..1400547 100644 --- a/tangle/benchmark-ldc.cu +++ b/tangle/benchmark-ldc.cu @@ -8,9 +8,9 @@ #include <iostream> +using T = float; using DESCRIPTOR = descriptor::D3Q19; -template <typename T> void simulate(descriptor::Cuboid<DESCRIPTOR> cuboid, std::size_t nStep) { cudaSetDevice(0); @@ -58,7 +58,7 @@ void simulate(descriptor::Cuboid<DESCRIPTOR> cuboid, std::size_t nStep) { } int main(int argc, char* argv[]) { - if (argc < 3 || argc > 4) { + if (argc != 3) { std::cerr << "Invalid parameter count" << std::endl; return -1; } @@ -66,22 +66,7 @@ int main(int argc, char* argv[]) { const std::size_t n = atoi(argv[1]); const std::size_t steps = atoi(argv[2]); - unsigned precision = 4; - if (argc == 4) { - precision = atoi(argv[3]); - } - - switch (precision) { - case 4: - simulate<float>({ n, n, n}, steps); - break; - case 8: - simulate<double>({ n, n, n}, steps); - break; - default: - std::cerr << "Invalid precision" << std::endl; - return -1; - } + simulate({ n, n, n}, steps); return 0; } |