What database sharding does: splits data across machines by a partition key

What consistent hashing does: minimizes remapping when nodes join/leave

Consistent hashing minimizes data redistribution during nodes' addition or removal

How do lock-free data structures manage concurrent access to shared memory in a multithreaded environment?

Lock-free data structures use atomic operations to ensure concurrent access without traditional locking mechanisms

What cooperative groups enable in CUDA: flexible thread synchronization patterns

CUDA allows cooperative groups for flexible thread synchronization patterns via atomic operations and events

What bloom filters do: probabilistically check set membership with no false negatives

Bloom filters: Efficient set membership testing with zero false negatives

What bank conflicts are in shared memory — multiple threads accessing the same bank

Shared memory conflicts arise when multiple threads concurrently access the same bank in a banking system

What CAP theorem states: you can have at most 2 of consistency, availability, partition tolerance

CAP theorem: Consistency, Availability, Partition Tolerance; only 2 can be fully achieved simultaneously