|
cuDDL
|
Part cuDDL of count disjoint parts of an all-to-all search. More...
Public Attributes | |
| uint32_t | index = 0U |
| uint32_t | count = 1U |
Part cuDDL of count disjoint parts of an all-to-all search.
Running every part, for example one per process, covers each pair exactly once. Parts take query tiles in alternating order (0, 1, ..., count - 1, count - 1, ..., 0, ...), so the shrinking tiles of the upper triangle spread evenly across parts.
Definition at line 839 of file reference_database.cuh.
| uint32_t cuddl::all_to_all_shard::count = 1U |
Definition at line 841 of file reference_database.cuh.
| uint32_t cuddl::all_to_all_shard::index = 0U |
Definition at line 840 of file reference_database.cuh.