Abstract
Defining an optimal schedule for arbitrary algorithms on a network of heterogeneous machinesis an NP complete problem. This paper focuses on data parallel deterministic neighborhood computer vision algorithms. This focus enables the polynomial time definition of a schedule which minimizes the distributed execution time by overlapping computation and communication cycles on the network. The scheduling model allows for any speed machine to participate in the concurrent computation but makes theassumption of a master/slave control mechanism using a linear communication network. Several vision algorithms are presented and described in terms of the scheduling model parameters. The theoretical speed up of these algorithms is discussed and empirical data is presented and compared to theoretical results.
Chapter PDF
References
Computer Vision. Dana H. Ballard, Christopher M. Brown. Prentice-Hall, Englewood Cliffs, New Jersey, 1982.
Parallel Algorithms for Machine Intelligence and Vision (Vipin Kumar Editor),“Parallelism in Computer Vision: A Review”, Vipin Chaudhary, J. K. Aggarwal, Springer-Verlag, NY 1990.
Parallel Architectures and Parallel Algorithms for Integrated Vision Systems. Alok N. Choudhary, Janak H. Patel, The Kluwer International Series In Engineering and Computer Science, Kluwer Academic Publishers Boston, 1990.
”SIMD Architectures and Algorithms for Image Processing and Computer Vision”, Robert Cypher and Jorge L. C Sanz, IEEE Trans on ASSP, Vol. 37, No. 12, Dec. 1989.
”Parallel Algorithms for Low Level Vision on the Homogeneous Multiprocessor”, R.V Dantu, N.J Dimopoulos, K.R. Li, R.V Patel, A. J. Al-Khalili, Computers Elect. Eng, Vol. 20 No.1, pp51–60, 1994.
Jack Dongarra, PVM3.3 Users Guide, 1994.
”Parallel Programming Systems For Workstation Clusters”, Yale University Department of Computer Science Research Report, YALEU/DCS/TR-975, August, 1993.
”Generalization of an Automated Visual Inspection System(AVIS)”, Bryan S. Everding, Adam R. Nolan, William G. Wee, SAE Aerospace Atlantic Conference, April 1994.
”Heterogeneous Processing”, Richard F. Freund, Howard Jay Siegel.Computer, June 1993, p 13.
”The Challenges of Heterogeneous Computing”, Richard F. Freund, Proceedings of the Parallel Systems Fair, Cancun, April 1994.
”Efficient Parallel Image Processing Applications On a Network Of Distributed Workstations”, Chi-kin Lee, Mounir Hamdi, Proceedings of the Parallel Systems Fair, Cancun, April 1994.
Vision. A Computational Investigation into the Human Representation and Processing of Visual Information. David Marr, W.H Freeman Press, San Francisco, 1982.
”LINDA and PVM: A comparison between two environments for parallel programming”, Alfonso Matrone, Pasquale Schiano, Vittorio Puoti, Parallel Computing 19(1993) 949–957.
“Performance Issues of an Automated Visual Inspection System(AVIS)”, Bryan S. Everding, Adam R. Nolan, William G. Wee, AIAA Jet Propulsion Conference, June 1994
“Effects of Nondeterminism on the Predicted Speedup of Scheduling Low Level Computer Vision Algorithms on Networks of Heterogeneous Machines”, A. R. Nolan, B. Everding, W. G. Wee, 5th International Conference on Parallel Computing, Belgium, September, 1995.
Digital Signal Processing. Oppenheim, A.V., and Schafer, R.W., Englewood Cliffs, NJ, Prentice-Hall,. 1975.
“Mapping Vision Algorithms to Parallel Architectures”, Quentin Stout, Proceeding of the IEEE, Vol. 76. No. 8. August, 1988.
”DARPA Image Understanding Benchmark for Parallel Computers”, Charles Weems, Edward Riseman, Allen Hanson, Azriel Rosenfeld, Journal of Parallel and Distributed Computing, Vol. 11 No. 1 Jan. 1991, pp 1–24.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nolan, A.R., Everding, B. (1995). Polynomial time scheduling of low level computer vision algorithms on networks of heterogeneous machines. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020488
Download citation
DOI: https://doi.org/10.1007/BFb0020488
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive