Language: Fortran

---

Program of L.Karailiev for prime numbers generation is described. It uses a classical algorithm of Eratosthenes sieve. The authorʹs interface was modified by A.P.Sapozhnikov to simplify the usage of several processors under MPI-technology. The productivity of program is explored. It proved to be near to its optimal value of O(N*ln(N)). All corresponding Fortran-sources are given.

Sources and detailed description (in Russian) of Primus are submitted.

---