Author: Frank Jakobsen
-
Embarrassingly parallel solutions
Calculating the Mandelbrot set (which I covered in my previous post) lends itself to parallel processing. The value for each pixel is not dependant on the value of other pixels, and is controlled by the iterative algorithm with a few parameters that are common to all pixels right from the start. This type of parallelism…
-
Notes on using WordPress
This web-site is my first public web-site, and following the advice of my web-hotel, I have based it on WordPress. This post is about my experiences with this, and it may be updated from time to time with new insights. Installation was a very easy one-click setup, and it included the current default theme Twenty…
-
Primes, parallelism, and caches Part 2
Summer’s come to an end and it’s time again to pick up indoor activities – like exploring the world of computer programming with C++. My previous and very first post was about investigating what a modern computer can do, using Eratosthenes’ Sieve as an example that stretched the PC to its limits using single thread…
-
Primes, parallelism and caches Part I
Our first excursion is going to be into using the parallel processing capabilities of a modern PC. To have an interesting problem to work with, I will make programs to count the number of prime numbers less than a specified big number, like 100,000,000,000 (100 billions, or 1011). Which, by the way, is 4,118,054,813. The…