Parallel Sort and Reverse in Parallel Template Library (PTL) Algorithms
PTL differs from the .NET and Java standard libraries because it offers
parallel versions of many useful algorithms, which take advantage of multicore
processors to greatly improve performance.
In this video, we demonstrate
the performance of PTL's Sort and Reverse algorithms 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.