engleski

LOCAL SEARCH ALGORITHM FOR SCHEDULING OF ROBOT DYNAMICS CALCULATION ON A PARALLEL COMPUTER

This paper presents an algorithm for finding 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 dynamics formulation is decomposed. Results show good speedups and processor use efficiency with moderate number of scheduling algorithm iterations.

parallel processing; scheduling; robotics; allocation; dynamics

nije evidentirano