SPT: Difference between revisions

Line 16:

The search code itself (in SPT), according to the constructed matrix, takes up only 5-6MB in memory. And it doesn't increase.

When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase.

When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase. The longer the numbers, the more memory they require in the primesieve matrix. One of our tasks takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule. There are cruncher computers that count in 20 minutes and also computers that count in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]

The longer the numbers, the more memory they require in the primesieve matrix.

One of our tasks takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule.

There are cruncher computers that count in 20 minutes and also computers that count in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]

The SPT application is based on '''''[http://www.primepuzzles.net/problems/prob_062.htm Problem 62. Symmetric k-tuples of consecutive primes]''''' presented by Natalia Makarova.

@@ Line 16: / Line 16: @@
 The search code itself (in SPT), according to the constructed matrix, takes up only 5-6MB in memory. And it doesn't increase.
-When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase.
+When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase. The longer the numbers, the more memory they require in the primesieve matrix. One of our tasks takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule. There are cruncher computers that count in 20 minutes and also computers that count in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]
-The longer the numbers, the more memory they require in the primesieve matrix.
-One of our tasks takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule.
-There are cruncher computers that count in 20 minutes and also computers that count in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]
 The SPT application is based on '''''[http://www.primepuzzles.net/problems/prob_062.htm Problem 62. Symmetric k-tuples of consecutive primes]''''' presented by Natalia Makarova.