Automatic scheduling for parallel forward dynamics computation of open Kinematic chains

1Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

Recent progress in the algorithm as well as the processor power have made the dynamics simulation of complex kinematic chains more realistic in various fields such as human motion simulation and molecular dynamics. The computation can be further accelerated by employing parallel processing on multiple processors. In fact, parallel processing environment is becoming more affordable thanks to recent release of multiplecore processors. Although several parallel algorithms for the forward dynamics computation have been proposed in literature, there still remains the problem of automatic scheduling, or load distribution, for handling arbitrary kinematic chains on a given parallel processing environment. In this paper, we propose a method for finding the schedule that minimizes the computation time. We test the method using three human character models with different complexities and show that parallel processing on two processors reduces the computation time by 35-36%.

Cite

CITATION STYLE

APA

Yamane, K., & Nakamura, Y. (2008). Automatic scheduling for parallel forward dynamics computation of open Kinematic chains. In Robotics: Science and Systems (Vol. 3, pp. 193–199). MIT Press Journals. https://doi.org/10.15607/rss.2007.iii.025

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free