Name:

Non-work-efficient Parallelism

Problem:

Many problems operates on a set of data by sequentially iterating over the data in particular sequences. There may not be any appearance parallelism in the sequential algorithm, however, if we are open to doing some redundant computation, parallel can be extracted. How do we extract this type of parallelism?

Context:

Forces:

Solution:

Examples:

Scan

Find root in trees

Parallel Brownian Bridge Algorithm

Invariants:

Example:

Known uses:

Related patterns:

References:

Author:

Jike Chong

 
patterns/non-work-efficient_parallelism.txt · Last modified: 2009/05/05 13:04 by jike
 
Except where otherwise noted, content on this wiki is licensed under the following license:CC Attribution-Noncommercial-Share Alike 3.0 Unported
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki