Date Added: Jul 2010
Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hash-tables and trees. These data structures come with a range of predefined operations which include sorting, filtering or finding elements. Such bulk operations usually traverse the entire collection and process the elements sequentially. Their implementation often relies on iterators, which are not applicable to parallel operations due to their sequential nature. The authors present an approach to parallelizing collection operations in a generic way, which can be used to factor out common parallel operations in collection libraries.