A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="https://link.springer.com/content/pdf/10.1007%2Fs11265-015-1045-x.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Data Flow Algorithms for Processors with Vector Extensions
<span title="2015-11-04">2015</span>
<i title="Springer Nature">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wgplegupdndx5o6decidr2va24" style="color: black;">Journal of Signal Processing Systems</a>
</i>
Preserved Fulltext
Full use of the parallel computation capabilities of present and expected CPUs and GPUs requires use of vector extensions. Yet many actors in data flow systems for digital signal processing have internal state (or, equivalently, an edge that loops from the actor back to itself) that impose serial dependencies between actor invocations that make vectorizing across actor invocations impossible. Ideally, issues of inter-thread coordination required by serial data dependencies should be handled by
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11265-015-1045-x">doi:10.1007/s11265-015-1045-x</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sasmbadjbvbinel63egagtehxm">fatcat:sasmbadjbvbinel63egagtehxm</a>
</span>
more »
... ode written by parallel programming experts that is separate from code specifying signal processing operations. The purpose of this paper is to present one approach for so doing in the case of actors that maintain state. We propose a methodology for using the parallel scan (also known as prefix sum) pattern to create algorithms for multiple simultaneous invocations of such an actor that results in vectorizable code. Two examples of applying this methodology are given: (1) infinite impulse response filters and (2) finite state machines. The correctness and performance of the resulting IIR filters and one class of FSMs are studied.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030092223/https://link.springer.com/content/pdf/10.1007%2Fs11265-015-1045-x.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/bb/f9/bbf9b4271b363abb2ab0f72d9df9e08dea9f107a.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11265-015-1045-x">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>