engleski

A Scheduling Procedure for Executing Automatic Control Tasks on Parallel and Distributed Systems

This paper presents an algorithm for finding out a near optimal solution for placement of computational processes on a multiple processor system. This problem is known to be NP-Complete. As an example robot’ s control formulation is decomposed. Results show good speedups and processor use efficiency with moderate number of scheduling algorithm iterations .The algorithm is suitable for closely coupled multiple processor systems as well for loosely coupled distributed systems because it takes into account inter-processor communication delays.

parallel processing; distributed systems; scheduling; robotics; production systems

nije evidentirano