What algorithm does BIT uses for prime number generation?

Collapse
X
 
  • Time
  • Show
Clear All
new posts
  • sivarocks
    Junior Member
    • Jun 2010
    • 7

    #1

    What algorithm does BIT uses for prime number generation?

    Is it the same as Prime95's 'Mersenne Prime' search by utilizing Fast Fourier Transform?
  • Ian (PassMark)
    Senior Member
    • Feb 2004
    • 822

    #2
    We have developed our own prime number test. It does not use Fast Fourier Transforms.

    Comment

    • sivarocks
      Junior Member
      • Jun 2010
      • 7

      #3
      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?

      Comment

      • David (PassMark)
        Administrator
        • Jan 2003
        • 11099

        #4
        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.

        Comment

        Working...