Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am trying to develop a benchmark to stress the CPUs on the Server for some HPC (High Performance computing) application. Please help me with some Algorithm that is believed to very CPU intensive. I saw algorithms to calculate primes using Newton's method - any better idea than this ?

share|cite|improve this question
Have you considered using some known synthetic benchmark program (e.g. Whetstone/Dhrystone)? – Henning Makholm Apr 23 '12 at 13:41
Can you share a link to your example? – draks ... Apr 23 '12 at 13:47
Also note, that most CPU's are multi-core nowadays, which means that you should either run the same algorithm on multiple threads, or choose one that utilizes the parallelism. – nbubis Apr 23 '12 at 14:13
What, specifically, are you out to test? Some CPUs perform better than others for what concerns floating point operations. Others can perform well due to onboard caching, making it ideal for problems which demand a certain amount of memory to run. – Neil Apr 23 '12 at 14:30
up vote 2 down vote accepted

GIMPS is very good at stressing CPUs.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.