Parallel merge-sort leveraging futures in Racket
Written by Dominik Joe Pantůček on 2019-10-10
Computers can perform more and more operations per second but that does not make them much faster without any further effort. In the past, the clock speed was the best measure of processor's performance. With multi-core and multi-processor systems, this is no longer true and the programmers need to pay attention how to access computers' performance. Read on to find out how in Racket - a modern Scheme dialect - it is quite easy to leverage parallel processing to speed sorting up.
