Partitioning of image processing tasks on heterogeneous computer systems

Show simple item record Iqbal, M. Ashraf Iqbal, Saeed Shaaban, Muhammad 2009-11-11T15:25:59Z 2009-11-11T15:25:59Z 1994-04
dc.identifier.citation Proceedings of the Third Workshop on Heterogeneous Computing, pp. 43-50, April 1994 en_US
dc.description.abstract Many computer vision tasks can be decomposed into a set of subtasks which are by their nature heterogeneous. By partitioning such 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. A fundamental problem with heterogeneous computing, however, is the difficulty of optimally partitioning an application program across the machines. In this paper we address the problem of partitioning a chain or a tree structured parallel or pipelined program over a two processor heterogeneous system and show that it is possible to approximately solve this problem. The algorithm, presented in this paper, is based on a fully polynomial time approximation scheme. en_US
dc.language.iso en_US en_US
dc.relation RIT Scholars content from RIT Digital Media Library has moved from to RIT Scholar Works, please update your feeds & links!
dc.title Partitioning of image processing tasks on heterogeneous computer systems en_US
dc.type Proceedings en_US

Files in this item

Files Size Format View
MShaabanConfProc04-1994.pdf 741.2Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML

Advanced Search