By Topic

Heterogeneous partitioning of chain structured image processing tasks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Iqbal, M.A. ; Dept. of Electr. Eng., Univ. of Eng. & Technol., Lahore, Pakistan ; Shaaban, M.E.

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. It is shown that a chain structured parallel or pipelined application task can be efficiently partitioned provided the multiple computer system is composed of two heterogenous processors

Published in:

Computer Architectures for Machine Perception, 1993. Proceedings

Date of Conference:

15-17 Dec 1993