On Wed, 7 Sep 2011, Claude Heiland-Allen wrote:
On 07/09/11 12:17, Bill Gribble wrote:
The operation is integration.
Try calling it 'scan' and you might end up with more productive searches, at
least to my mind integration is more about summing over continuous regions
than something discrete like this.
Searching for "data parallel algorithm scan" leads to pages like:
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.85.1876&rep=rep1&type=pdf
If I implemented [#scan] that way on one processor, it would be slower...
that algorithm begins being faster (than the obvious one) if you have
O(log n) processors.
(yes, again forgot to send a mail long ago)
_______________________________________________________________________
| Mathieu Bouchard ---- tél: +1.514.383.3801 ---- Villeray, Montréal, QC
_______________________________________________
[email protected] mailing list
UNSUBSCRIBE and account-management ->
http://lists.puredata.info/listinfo/pd-list
