Problems for "splitting numbers" for benchmarks?

Question

Algorithms

Examples that come to mind are breadth-first search on a larger graph, AES encryption-decryption/LZW compression-decompression 4 GB of data in memory, sum of squares of numbers from 1 to 100,000. Help complete the list.

Answer 1

You have strange associations with "number splitting": your examples are entirely integer.
I would suggest matrix inversion, difur numerical solution, ray tracing.

Answer 2

Calculation of the number of Pi and others, archiving / dev / random

Answer 3

genome/protein assembly, SAT solver

Answer 4

A benchmark without understanding what the end user will use this hardware for is a bit pointless. Maybe it makes sense to first analyze what the average user will do 80% of the time, and make a benchmark out of this?