Answers are grounded in this paper and cite their sources.
We have developed a parallel algorithm for microdigital-holographic particle-tracking velocimetry. The algorithm is used in (1) numerical reconstruction of a particle image computer using a digital hologram, and (2) searching for particles. The numerical reconstruction from the digital hologram makes use of the Fresnel diffraction equation and the FFT (fast Fourier transform), whereas the particle search algorithm looks for local maximum graduation in a reconstruction field represented by a 3D matrix. To achieve high performance computing for both calculations (reconstruction and particle search), two memory partitions are allocated to the 3D matrix. In this matrix, the reconstruction part consists of horizontally placed 2D memory partitions on the x-y plane for the FFT, whereas, the particle search part consists of vertically placed 2D memory partitions set along the z axes. Consequently, the scalability can be obtained for the proportion of processor elements, where the benchmarks are carried out for parallel computation by a SGI Altix machine.
No takes yet. Share an insight, caveat, or question.
Satake et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: