Piece of code that can kill computer performance [closed]

As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance. Clos开发者_JAVA技巧ed 10 years ago.

I'm searching for code in c# that can kill computer performance (CPU performance, maybe cpu - memory link performance too) as much as it is possible (it will run on 4 core box so I'm going to create 4 threads and run it simultaneously).

Should it work on int / double / numeric data type / should it have some crazy data structures (but it should not take too much memory) .

Do you have any suggestions ?

---

Calculate PI using all processors.

---

You could use parallel Linq to generate a Mandelbrot (Jon Skeet has the code readily available).

---

Have a program that writes copies of its executable to the drive multiple times for each thread. Have each of these copies of the program then triggered by the program. :)

---

If you want to kill a machine's performance, try hitting the disk, because IO interrupts tend to affect everything even on a good CPU scheduler. Something like enumerating a directory of many little files, or writing a lot of big files to disk would do the trick.

---

Why re-invent the wheel? Use existing Load Testing software.

---

Calculate a long sequence of prime numbers. The following link contains code that can be modified to do this..

Program to find prime numbers

---

Call Bitmap.GetPixel, in a loop, in an image processing application.

---

I would say: a naieve (brute force) travelling salesman implementation:

(from wikipedia):

The Travelling Salesman Problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once.

---

Brute force solving of N Queens (see wikipedia) for for example 64 queens.

Because a simple loop like this can be optimized away (sometimes only after a few minutes already running):

while(true) {
  i++;
}

---

You can, as well, resolve a very long encrypted message, encrypted by a key such as 2048 bits. That's a killer.

---

An open-source, multithreaded 3D modeling program rendering an extremely complex lighted scene will pound the strongest system into submission.

---

Okay, how about some infinite recursion in the spirit of StackOverflow?

void deathToAllRobots(int someMeaninglessValue) {
    deathToAllRobots(someMeaninglessValue+1);
}

---

int *x;
while(1)
{
     x = new int[10];
}