Proceedings of Conference on Computer Architectures for Machine Perception
DOI: 10.1109/camp.1995.521059
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling of low level computer vision algorithms on networks of heterogeneous machines

Abstract: Defining an optimal schedule for arbitrary algorithms on a network of heterogeneous machnes is an NP complete problem. By focusing on data parallel deterministic neighborhood computer vision algorithms, a minimum time schedule can be defined in polynomial time. The scheduling model allows for any speed machine to participate in the concurrent computation but makes the assumption of a masterklave control mechanism using a linear communication network. Several vision algorithms are presented which adhere to the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…This is crucial as shadows reduce the clarity of the image and extrapolates its dimensions and requires a more complex algorithm to process the image and also reduces the accuracy as rounding off is required if shadows are involved. Also, using clear images makes the processing easier and scheduling [3] them in a processor is done more efficiently for a clear image.…”
Section: Process Resolutionmentioning
confidence: 99%
“…This is crucial as shadows reduce the clarity of the image and extrapolates its dimensions and requires a more complex algorithm to process the image and also reduces the accuracy as rounding off is required if shadows are involved. Also, using clear images makes the processing easier and scheduling [3] them in a processor is done more efficiently for a clear image.…”
Section: Process Resolutionmentioning
confidence: 99%
“…The communication mode is exclusive and thus, the primary processor can send or receive data to or from only one secondary node at a time. With optimal scheduling, after each node performs its computation, there may not be any idling [25]. However, this assumption is valid only if the load is finely divisible.…”
Section: Optimality Conditionmentioning
confidence: 99%