Parallel and Distributed Processing Symposium, International (2001)
San Francisco, California, USA
Apr. 23, 2001 to Apr. 27, 2001
<p>In this paper we show how an extensive library of data parallel low level image processing operations is created with minimal effort. We discuss how many commonly used image processing operations are implemented in parallel by concatenation of communication routines, basic memory operations, and so-called "parallelizable patterns".</p> <p>A parallelizable pattern constitutes the maximum amount of work in a sequential image processing operation that can be applied in a parallel operation as well - with-out having to communicate to obtain non-local data. Apart from being relatively simple to implement, a parallel library built in this manner is extensible and easily maintainable, as code redundancy is avoided as much as possible.</p>
F. Seinstra and D. Koelma, "The Lazy Programmer?s Approach to Building a Parallel Image Processing Library," Parallel and Distributed Processing Symposium, International(IPDPS), San Francisco, California, USA, 2001, pp. 30115b.