Announcement

Collapse
No announcement yet.

What algorithm does BIT uses for prime number generation?

Collapse
X
 
  • Filter
  • Time
  • Show
Clear All
new posts

  • David (PassMark)
    replied
    If you wanted to generate prime numbers to finding a new Mersenne prime numbers, then use Prime95. This is what is was designed for.

    However if you want to test your CPU under load then just use BurnInTest.

    Leave a comment:


  • sivarocks
    replied
    How different is it? Would it be advisable to run both prime95 and BIT (cpu test only) concurrently to stress test a cpu? Or is it considered redundant to have both prime number testing as both would be focusing on FPU?

    Leave a comment:


  • Ian (PassMark)
    replied
    We have developed our own prime number test. It does not use Fast Fourier Transforms.

    Leave a comment:


  • What algorithm does BIT uses for prime number generation?

    Is it the same as Prime95's 'Mersenne Prime' search by utilizing Fast Fourier Transform?
Working...
X