Parallel Sort and Reverse in Parallel Template Library (PTL) Algorithms

Parallel Template Library's (PTL) Algorithms components for .NET and Java 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 using a .NET List and a PTLArray container.

This demo is executed on a system with one Intel Core i7 processor with 4 physical cores, or 8 logical cores with hyperthreading. PTL's sequential Sort and Reverse functions were 1.1 times and 54 times faster, respectively, than the Sort and Reverse functions of the .NET List.

PTL differs from the .NET and Java standard libraries because it also offers parallel versions of many algorithms, including Sort and Reverse. 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.

PTL's algorithms are well designed to process large data sets. First, we carefully optimized PTL's sequential algorithms; then, we worked hard on our parallel algorithms to obtain the best possible performance improvement over their sequential counterparts.