Category Archives: PTL Algorithms

Parallel Sort & Reverse Algorithms of PTL Array vs. .NET List

The next video in our Parallel Template Library (PTL) video series is our “Parallel Sort and Reverse in PTL Algorithms” video. PTL differs from the .NET standard library because its Array and Iterator Algorithms components offer parallel versions of many useful algorithms, which take advantage of multicore processors to greatly improve their performance.

In this video, we demonstrate the performance of PTL’s Sort and Reverse algorithms for large data sets (1 billion elements) using a .NET List and a PTLArray container. On a quad-core processor, PTL’s parallel Sort was 4.5 times faster than the sequential Sort of the .NET List, and PTL’s parallel Reverse was 109 times faster than the sequential Reverse of the .NET List.

We executed our demo application on a system with one Intel Core i7 processor with 4 physical cores (8 logical cores with hyperthreading) and 32 GB of memory. We also restarted the demo application after each test to run each test independently and get a fair comparison.


LinkedInGoogle+TwitterFacebookGoogle GmailShare