The design of a task parallel library Export

@article{citeulike:6017606, abstract = {The Task Parallel Library (TPL) is a library for .NET that makes it easy to take advantage of potential parallelism in a program. The library relies heavily on generics and delegate expressions to provide custom control structures expressing structured parallelism such as map-reduce in user programs. The library implementation is built around the notion of a task as a finite CPU-bound computation. To capture the ubiquitous apply-to-all pattern the library also introduces the novel concept of a replicable task. Tasks and replicable tasks are assigned to threads using work stealing techniques, but unlike traditional implementations based on the THE protocol, the library uses a novel data structure called a 'duplicating queue'. A surprising feature of duplicating queues is that they have sequentially inconsistent behavior on architectures with weak memory models, but capture this non-determinism in a benign way by sometimes duplicating elements. TPL ships as part of the Microsoft Parallel Extensions for the .NET framework 4.0, and forms the foundation of Parallel LINQ queries (however, note that the productized TPL library may differ in significant ways from the basic design described in this article).}, address = {New York, NY, USA}, author = {Leijen, Daan and Schulte, Wolfram and Burckhardt, Sebastian}, citeulike-article-id = {6017606}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1639949.1640106}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1639949.1640106}, doi = {10.1145/1639949.1640106}, issn = {0362-1340}, journal = {SIGPLAN Not.}, keywords = {language, manycore, parallelization}, number = {10}, pages = {227--242}, posted-at = {2009-10-28 06:57:39}, priority = {2}, publisher = {ACM}, title = {The design of a task parallel library}, url = {http://dx.doi.org/10.1145/1639949.1640106}, volume = {44}, year = {2009} }

TY - JOUR ID - citeulike:6017606 L3 - citeulike-article-id:6017606 N2 - The Task Parallel Library (TPL) is a library for .NET that makes it easy to take advantage of potential parallelism in a program. The library relies heavily on generics and delegate expressions to provide custom control structures expressing structured parallelism such as map-reduce in user programs. The library implementation is built around the notion of a task as a finite CPU-bound computation. To capture the ubiquitous apply-to-all pattern the library also introduces the novel concept of a replicable task. Tasks and replicable tasks are assigned to threads using work stealing techniques, but unlike traditional implementations based on the THE protocol, the library uses a novel data structure called a 'duplicating queue'. A surprising feature of duplicating queues is that they have sequentially inconsistent behavior on architectures with weak memory models, but capture this non-determinism in a benign way by sometimes duplicating elements. TPL ships as part of the Microsoft Parallel Extensions for the .NET framework 4.0, and forms the foundation of Parallel LINQ queries (however, note that the productized TPL library may differ in significant ways from the basic design described in this article). IS - 10 JF - SIGPLAN Not. SN - 0362-1340 AD - New York, NY, USA EP - 242 TI - The design of a task parallel library PB - ACM VL - 44 SP - 227 KW - language KW - manycore KW - parallelization AU - Leijen, Daan AU - Schulte, Wolfram AU - Burckhardt, Sebastian PY - 2009/// UR - http://dx.doi.org/10.1145/1639949.1640106 ER -