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

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.