Decentralized (Parallel) Computing
The goal here is to calculate an arbitrarially large set of prime numbers in such a way that the task can be broken up into smaller packets and sent off to other computers and then merged back in.
| Test Description | Time | Multiplicative |
|---|---|---|
| 1 computer benchmark (10k primes) | ~450ms | 1 |
| 1 computer optimal result (10k primes) | ~950ms | 2.11 |
| 1 computer bogorder (10k primes) | ~1600ms | 3.56 |