-
Notifications
You must be signed in to change notification settings - Fork 89
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
dafcf45
commit 6816740
Showing
20 changed files
with
1,189 additions
and
16 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,87 @@ | ||
/* | ||
* Copyright (c) 2024, NVIDIA CORPORATION. | ||
* | ||
* Licensed under the Apache License, Version 2.0 (the "License"); | ||
* you may not use this file except in compliance with the License. | ||
* You may obtain a copy of the License at | ||
* | ||
* http://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, software | ||
* distributed under the License is distributed on an "AS IS" BASIS, | ||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
* See the License for the specific language governing permissions and | ||
* limitations under the License. | ||
*/ | ||
|
||
#include <benchmark_defaults.hpp> | ||
#include <benchmark_utils.hpp> | ||
|
||
#include <cuco/static_multiset.cuh> | ||
#include <cuco/utility/key_generator.cuh> | ||
|
||
#include <nvbench/nvbench.cuh> | ||
|
||
#include <thrust/device_vector.h> | ||
#include <thrust/transform.h> | ||
|
||
using namespace cuco::benchmark; | ||
using namespace cuco::utility; | ||
|
||
/** | ||
* @brief A benchmark evaluating `cuco::static_multiset::retrieve` performance | ||
*/ | ||
template <typename Key, typename Dist> | ||
void static_multiset_retrieve(nvbench::state& state, nvbench::type_list<Key, Dist>) | ||
{ | ||
auto const num_keys = state.get_int64_or_default("NumInputs", defaults::N); | ||
auto const occupancy = state.get_float64_or_default("Occupancy", defaults::OCCUPANCY); | ||
auto const matching_rate = state.get_float64_or_default("MatchingRate", defaults::MATCHING_RATE); | ||
|
||
std::size_t const size = num_keys / occupancy; | ||
|
||
thrust::device_vector<Key> keys(num_keys); | ||
|
||
key_generator gen; | ||
gen.generate(dist_from_state<Dist>(state), keys.begin(), keys.end()); | ||
|
||
gen.dropout(keys.begin(), keys.end(), matching_rate); | ||
|
||
state.add_element_count(num_keys); | ||
|
||
cuco::static_multiset<Key> set{size, cuco::empty_key<Key>{-1}}; | ||
set.insert(keys.begin(), keys.end()); | ||
|
||
auto const output_size = set.count(keys.begin(), keys.end()); | ||
thrust::device_vector<Key> output_match(output_size); | ||
auto output_probe_begin = thrust::discard_iterator{}; | ||
|
||
state.exec(nvbench::exec_tag::sync, [&](nvbench::launch& launch) { | ||
set.retrieve( | ||
keys.begin(), keys.end(), output_probe_begin, output_match.begin(), {launch.get_stream()}); | ||
}); | ||
} | ||
|
||
NVBENCH_BENCH_TYPES(static_multiset_retrieve, | ||
NVBENCH_TYPE_AXES(defaults::KEY_TYPE_RANGE, | ||
nvbench::type_list<distribution::uniform>)) | ||
.set_name("static_multiset_retrieve_uniform_occupancy") | ||
.set_type_axes_names({"Key", "Distribution"}) | ||
.set_max_noise(defaults::MAX_NOISE) | ||
.add_float64_axis("Occupancy", defaults::OCCUPANCY_RANGE); | ||
|
||
NVBENCH_BENCH_TYPES(static_multiset_retrieve, | ||
NVBENCH_TYPE_AXES(defaults::KEY_TYPE_RANGE, | ||
nvbench::type_list<distribution::uniform>)) | ||
.set_name("static_multiset_retrieve_uniform_matching_rate") | ||
.set_type_axes_names({"Key", "Distribution"}) | ||
.set_max_noise(defaults::MAX_NOISE) | ||
.add_float64_axis("MatchingRate", defaults::MATCHING_RATE_RANGE); | ||
|
||
NVBENCH_BENCH_TYPES(static_multiset_retrieve, | ||
NVBENCH_TYPE_AXES(defaults::KEY_TYPE_RANGE, | ||
nvbench::type_list<distribution::uniform>)) | ||
.set_name("static_multiset_retrieve_uniform_multiplicity") | ||
.set_type_axes_names({"Key", "Distribution"}) | ||
.set_max_noise(defaults::MAX_NOISE) | ||
.add_int64_axis("Multiplicity", defaults::MULTIPLICITY_RANGE); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,82 @@ | ||
/* | ||
* Copyright (c) 2024, NVIDIA CORPORATION. | ||
* | ||
* Licensed under the Apache License, Version 2.0 (the "License"); | ||
* you may not use this file except in compliance with the License. | ||
* You may obtain a copy of the License at | ||
* | ||
* http://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, software | ||
* distributed under the License is distributed on an "AS IS" BASIS, | ||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
* See the License for the specific language governing permissions and | ||
* limitations under the License. | ||
*/ | ||
|
||
#include <cuco/static_multiset.cuh> | ||
|
||
#include <thrust/device_vector.h> | ||
#include <thrust/functional.h> | ||
#include <thrust/logical.h> | ||
#include <thrust/sequence.h> | ||
|
||
#include <iostream> | ||
#include <limits> | ||
|
||
/** | ||
* @file host_bulk_example.cu | ||
* @brief Demonstrates usage of the static_multiset "bulk" host APIs. | ||
* | ||
* The bulk APIs are only invocable from the host and are used for doing operations like `insert` or | ||
* `retrieve` on a multiset of keys. | ||
* | ||
*/ | ||
int main(void) | ||
{ | ||
using key_type = int; | ||
|
||
// Empty slots are represented by reserved "sentinel" values. These values should be selected such | ||
// that they never occur in your input data. | ||
key_type constexpr empty_key_sentinel = -1; | ||
|
||
// Number of keys to be inserted | ||
std::size_t constexpr num_keys = 50'000; | ||
|
||
// Compute capacity based on a 50% load factor | ||
auto constexpr load_factor = 0.5; | ||
std::size_t const capacity = std::ceil(num_keys / load_factor); | ||
|
||
// Constructs a set with at least `capacity` slots using -1 as the empty keys sentinel. | ||
cuco::static_multiset<key_type> multiset{capacity, cuco::empty_key{empty_key_sentinel}}; | ||
|
||
// Create a sequence of keys {0, 1, 2, .., i} | ||
// We're going to insert each key twice so we only need 'num_keys / 2' distinct keys. | ||
thrust::device_vector<key_type> keys(num_keys / 2); | ||
thrust::sequence(keys.begin(), keys.end(), 0); | ||
|
||
// Inserts all keys into the hash set | ||
multiset.insert(keys.begin(), keys.end()); | ||
// Insert the same set of keys again, so each distinct key should occur twice in the multiset | ||
multiset.insert(keys.begin(), keys.end()); | ||
|
||
// Counts the occurrences of matching keys contained in the multiset. | ||
std::size_t const counted_output_size = multiset.count(keys.begin(), keys.end()); | ||
|
||
// Storage for result | ||
thrust::device_vector<key_type> output_probes(counted_output_size); | ||
thrust::device_vector<key_type> output_matches(counted_output_size); | ||
|
||
// Retrieve all matching keys | ||
auto const [output_probes_end, _] = | ||
multiset.retrieve(keys.begin(), keys.end(), output_probes.begin(), output_matches.begin()); | ||
std::size_t const retrieved_output_size = output_probes_end - output_probes.begin(); | ||
|
||
if ((retrieved_output_size == counted_output_size) and (retrieved_output_size == num_keys)) { | ||
std::cout << "Success! Found all keys.\n"; | ||
} else { | ||
std::cout << "Fail! Something went wrong.\n"; | ||
} | ||
|
||
return 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.