Implements many common algorithms that operate on ranges of iterators.
The Iterator Algorithms component contains parallel versions of many common algorithms that operate on ranges of iterators (e.g. Transform, Compare, Accumulate, AdjacentDifference, InnerProduct, Find, AdjacentFind, Search, Intersect, Union, Sort, etc.).
High performance parallelism no longer requires low-level programming; it can be achieved in pure .NET and Java with Progeneric’s Parallel Template Library (PTL).™ Mainstream software developers that are more comfortable with high-level programming languages such as C# and Java can use PTL to take advantage of today’s multicore and many-core processors for dramatic performance improvements.
PTL has a low learning curve, which allows developers to gain performance without losing productivity. Developers don’t need to learn or use new syntax or code annotations to use PTL. They can quickly add parallelism to their applications while maintaining their sequential thinking because PTL isolates developers from the complexity of parallel programming (e.g. threads, locking, synchronization, cache coherency) through ready-to-use parallel functions. Developers will already be familiar with many of PTL’s functions because it contains functionality found in the standard libraries of most programming languages that has been optimized for parallelism.
PTL is divided into several components. These components are completely decoupled, which allows developers to easily extend PTL’s design for more specific needs (e.g. developers can write custom algorithms that work with PTL’s containers and custom containers that work with PTL’s algorithms).
Copyright © 2014 Progeneric Systems, Inc. All Rights Reserved.