Share Email Print

Proceedings Paper

Job-shop scheduling applied to computer vision
Author(s): Jose M. Sebastian y Zuniga; Fernando Torres-Medina; Rafael Aracil; Oscar Reinoso; Luis Miguel Jimenez; David Garcia
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper presents a method for minimizing the total elapsed time spent by n tasks running on m differents processors working in parallel. The developed algorithm not only minimizes the total elapsed time but also reduces the idle time and waiting time of in-process tasks. This condition is very important in some applications of computer vision in which the time to finish the total process is particularly critical -- quality control in industrial inspection, real- time computer vision, guided robots. The scheduling algorithm is based on the use of two matrices, obtained from the precedence relationships between tasks, and the data obtained from the two matrices. The developed scheduling algorithm has been tested in one application of quality control using computer vision. The results obtained have been satisfactory in the application of different image processing algorithms.

Paper Details

Date Published: 19 September 1997
PDF: 12 pages
Proc. SPIE 3166, Parallel and Distributed Methods for Image Processing, (19 September 1997); doi: 10.1117/12.279613
Show Author Affiliations
Jose M. Sebastian y Zuniga, Univ. Politecnica de Madrid (Spain)
Fernando Torres-Medina, Univ. de Alicante (Spain)
Rafael Aracil, Univ. Politecnica de Madrid (Spain)
Oscar Reinoso, Univ. Politecnica de Madrid (Spain)
Luis Miguel Jimenez, Univ. de Alicante (Spain)
David Garcia, Univ. Politecnica de Madrid (Spain)

Published in SPIE Proceedings Vol. 3166:
Parallel and Distributed Methods for Image Processing
Hongchi Shi; Patrick C. Coffield, Editor(s)

© SPIE. Terms of Use
Back to Top