See docs/benchmark-design.md for full details. Allocates a fixed 100 MB data structure and sorts it as a memory-heavy workload. No dependency on AWS SDKs. Writes 5 items to DynamoDB in a batch, then ...
The Fisher-Yates shuffle (also known as the Knuth shuffle) is an algorithm for generating random permutations of a finite sequence. It's named after Ronald Fisher and Frank Yates, who first described ...