Thursday, April 9, 2009

Concurrent Quicksort in Erlang and F#

Moore’s Law is no more applicable ( http://en.wikipedia.org/wiki/Moore's_law ) since processors are not getting faster and faster. We have now multicore-processors and developers are confronted with new reality. There are dedicated frameworks like Parallel Extension ,Task Parallel Library(by-product of Microsoft Robotics) for Microsoft.net or dedicated programming languages such as Erlang, but the crucial ingredient for success is to modify algorithms to work parallel as possible. We can gauge achieved improvements by applying Amdahls Law(http://en.wikipedia.org/wiki/Amdahl). I am going to implement these algorithms in F# and Erlang.
Please read  more www.paul-abraham.com/ConcurrentProgramming.doc