Abstract
Many schemes in the field of computer vision and image processing, present potential for parallel implementations through one of the three major paradigms: geometric parallelism, algorithmic parallelism, and processor farming. Static process scheduling techniques are used successfully to exploit geometric and algorithmic parallelism, whilst dynamic process scheduling is better suited in dealing with the independent processes inherent in the processor farming paradigm. This paper considers the application of parallel, or multicomputers to a class of problems exhibiting spatial data characteristic of the geometric paradigm and is best suited to a static scheduling scheme. However, by using the processor farming paradigm, a dynamic scheduling technique is developed to suit the MIMD structure of the multi-computers. The specific problem chosen for the investigation is the recognition and classification of microscopic wear particles generated by wear mechanisms. Experiments are performed on static and dynamic schemes, and are compared in terms of total processing time, speedup, and efficiency.
Original language | English |
---|---|
Title of host publication | 3rd International Conference on Digital Information Processing and Communications, ICDIPC 2013 |
Publisher | Society of Digital Information and Wireless Communications (SDIWC) |
Pages | 439-453 |
Number of pages | 15 |
Publication status | Published - 2013 |
Event | 3rd International Conference on Digital Information Processing and Communications, ICDIPC 2013 - Dubai, United Arab Emirates Duration: Jan 30 2013 → Feb 1 2013 |
Other
Other | 3rd International Conference on Digital Information Processing and Communications, ICDIPC 2013 |
---|---|
Country/Territory | United Arab Emirates |
City | Dubai |
Period | 1/30/13 → 2/1/13 |
Keywords
- Computer vision
- Parallel processing
- Recognition
- Scheduling
- Wear particles
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems
- Signal Processing