Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
Reid Porter , Los Alamos National Laboratory, NM 87545, USA
Zachary K. Baker , Los Alamos National Laboratory, NM 87545, USA
Vector and data-flow processors are particularly strong at dense, regular computation. Sparse, irregular data layouts cause problems because their unpredictable data access patterns prevent computational pipelines from filling effectively. A number of algorithms in image processing have been proposed which are not dense, and instead apply local neighborhood operations to a sparse, irregular set of points.
Reid Porter, Zachary K. Baker, "Rotationally invariant sparse patch matching on GPU and FPGA", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-8, 2008, doi:10.1109/IPDPS.2008.4536515