## Parallelizing simple algorithms series

In the following weeks, I will try to write some posts about parallelizing simple algorithms with the Erlang programming language. The main motivation for executing program instructions in parallel is to complete the computation faster than the sequential equivalent solution. As it is used, when someone wants to present the “parallelization power” of a programming language/model, the **Fibonacci numbers** are used. So, following this conversion, my first post will be about parallelizing the calculation of the Fibonacci integer sequence.

Read the rest of this entry »

## Parallelizing simple algorithms : Fibonacci

It took me a little more than I expected, but finally I managed to write the first post for the Parallelizing simple algorithms series.

As I “promised”, I will start these series by parallelizing the **Fibonacci Number** sequence generation. As you probably already know, Fibonacci numbers are the integer sequence produced by the following relationship:

F`= 0 F`

_{0}`= 1 F`

_{1}`= F`

_{n}`+ F`

_{n-2}

_{n-1}

The resulting sequence is: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, . . .