24 lines
907 B
Plaintext
24 lines
907 B
Plaintext
Many programming languages allow you to specify computations to be run in parallel.
|
|
While [[Concurrent computing]] is focused on concurrency,
|
|
the purpose of this task is to distribute time-consuming calculations
|
|
on as many CPUs as possible.
|
|
|
|
Assume we have a collection of numbers, and want to find the one
|
|
with the largest minimal prime factor
|
|
(that is, the one that contains relatively large factors).
|
|
To speed up the search, the factorization should be done
|
|
in parallel using separate threads or processes,
|
|
to take advantage of multi-core CPUs.
|
|
|
|
Show how this can be formulated in your language.
|
|
Parallelize the factorization of those numbers,
|
|
then search the returned list of numbers and factors
|
|
for the largest minimal factor,
|
|
and return that number and its prime factors.
|
|
|
|
For the prime number decomposition
|
|
you may use the solution of the [[Prime decomposition]] task.
|
|
|
|
{{omit from|J}}
|
|
|