28 January 2008 Parallel processing of multi-dimensional data with causal neighborhood dependencies
Author Affiliations +
Abstract
In this paper, we investigate the problem of enabling block level parallelism, for multi-dimensional data sets, with arbitrary but static causal dependency between blocks that constitute the data set. As the use of video and other multi-dimensional data sets becomes more common place and the algorithms used to process them become more complex, there is greater need for effective parallelization schemes. We describe a method for synchronizing the execution of multiple processors to respect the dependency structure and calculate the total processing time as a function of the number of parallel processors. We also provide an algorithm to calculate the optimal starting times for each processor which enables them to continuously process blocks without the need for synchronizing with other processors, under the assumption that the time to process each block is fixed.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Deepak S. Turaga, Deepak S. Turaga, Krishna Ratakonda, Krishna Ratakonda, } "Parallel processing of multi-dimensional data with causal neighborhood dependencies", Proc. SPIE 6822, Visual Communications and Image Processing 2008, 682219 (28 January 2008); doi: 10.1117/12.766977; https://doi.org/10.1117/12.766977
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

Parallel Processing Of Attributes Of Digital Lines
Proceedings of SPIE (March 01 1989)
Remote sensing image parallel processing system
Proceedings of SPIE (October 29 2009)
A parallel processing system of images
Proceedings of SPIE (November 03 2005)
Parallelism in the decoding of MPEG digital video
Proceedings of SPIE (December 28 1999)

Back to Top