Evaluation of parallel decomposition methods for biomechanical optimizations.
As the complexity of musculoskeletal models continues to increase, so will the computational demands of biomechanical optimizations. For this reason, parallel biomechanical optimizations are becoming more common. Most implementations parallelize the optimizer. In this study, an alternate approach is investigated that parallelizes the analysis function (i.e., a kinematic or dynamic simulation) called repeatedly by the optimizer to calculate the cost function and constraints. To evaluate this approach, a system identification problem involving a kinematic ankle joint model was solved using a gradient-based optimizer and three parallel decomposition methods: gradient calculation decomposition, analysis function decomposition, or both methods combined. For a given number of processors, analysis function decomposition exhibited the best performance despite the highest communication and synchronization overhead, while gradient calculation decomposition demonstrated the worst performance due to the fact that the necessary line searches were not performed in parallel. These findings suggest that the method of parallelization most commonly used for biomechanical optimizations may not be the most efficient, depending on the optimization algorithm used. In many applications, the best computational strategy may be to focus on parallelizing the analysis function.
Koh
Byung Il
BI
Department of Electrical & Computer Engineering, University of Florida, Gainesville, FL 32611, USA.
Reinbolt
Jeffrey A
JA
Fregly
Benjamin J
BJ
George
Alan D
AD
D000465:Algorithms; D000843:Ankle Joint / Q000502:physiology*; D001696:Biomechanical Phenomena / Q000379:methods; D003198:Computer Simulation; D003205:Computing Methodologies; D008954:Models, Biological; D009068:Movement / Q000502:physiology*; D009119:Muscle Contraction / Q000502:physiology; D018482:Muscle, Skeletal / Q000502:physiology*; D009716:Numerical Analysis, Computer-Assisted