By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nolan, A.R. ; Artificial Intell. & Comput. Vision Lab., Cincinnati Univ., OH, USA ; Everding, B. ; Wee, W.

Defining an optimal schedule for arbitrary algorithms on a network of heterogeneous machines 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 master/slave control mechanism using a linear communication network. Several vision algorithms are presented which adhere to the scheduling model. The theoretical speedup of these algorithms is discussed and empirical data is presented and compared to theoretical results

Published in:

Computer Architectures for Machine Perception, 1995. Proceedings. CAMP '95

Date of Conference:

18-20 Sep 1995