Abstract
With the continual growth in number of cores on the Central Processing Unit (CPU), developers will need to focus more and more on concurrent programming to get the desired performance boost that in the past have come logically with the increased clock-rate.
Today there are numerous of different libraries and mechanisms for synchronization and parallelization in Java, and in this thesis we will attempt to test the efficiency and run time of two different types of sorting algorithms on machines with multi-core processors using the concurrent tools provided by Java.
We will also be looking into the overhead that occur by using the various mechanisms, to help establish the correlations between the mechanisms overhead and performance gain.