Parallel Programming Pattern 1: Superscalar Sequences and Task Graphs Share your comment!

Intel’s Michael McCool wrote a series of blog posts in the past about structured patterns as a basis for high-level parallel programming. He writes that, together, these patterns constitute a minimal yet broadly applicable set of components for deterministic parallel programming. The first pattern he presents in the 12-part series is one that at first glance is serial: the sequence. However, he writes, a sequence of operations in a program, if it can be reordered while respecting data dependencies, can in fact express fairly general forms of task parallelism.

To read the full blog post, click here.

http://software.intel.com/en-us/blogs/2009/05/26/parallel-pattern-1-superscalar-sequences-and-task-graphs/

Posted on by Mike McCool (Intel®)
1 comments
emaa777
emaa777

Proper but yet,What is basic fundaments for paralellísm and semicondiction-parabel? One sometimes discoveres para-ts in quadration= Alot of PR-values. I am not an expert  anyway.