Heterogeneous partitioning of chain structured image processing tasks

Show full item record

Title: Heterogeneous partitioning of chain structured image processing tasks
Author: Iqbal, M. Ashraf; Shaaban, Muhammad
Abstract: Many computer vision tasks, such as image understanding, pattern recognition, dynamic scene analysis, etc., can be cast as pipelined algorithms. These tasks can be decomposed into a set of subtasks which are by their nature heterogeneous; at the lowest level, image processing operations have a massive SIMD type of parallelism, while high level image understanding computations exhibit coarse grain MIMD type characteristics. By partitioning the application task onto different machines that communicate via high speed links, each level or stage of processing can be executed simultaneously on the machine to which it is best suited. Such a network of heterogeneous machines may be able to provide a total completion time that is shorter than the execution time that can be obtained by running the entire program on any single machine. In this paper we show that a chain structured parallel or pipelined application task can be efficiently partitioned provided the multiple computer system is composed of two heterogeneous processors.
Record URI: http://hdl.handle.net/1850/11554
Date: 1993-12

Files in this item

Files Size Format View
MShaabanConfProc12-1993.pdf 1.007Mb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse