In a previous paper (1987), the authors proposed a parallel computational scheme that is based on the mathematical decomposition of the equations into their primitive matrix/vector arithmetic operations. It was shown that the mathematical decomposition scheme provides an efficient mechanism to reduce the computational cycle of both the Newton-Euler (N-E) and the Lagrange-Euler (L-E) formulations. In the present paper, the N-E and L-E equations are analyzed from a hardware perspective and the results for each are compared. The analysis shows that N-E is more efficient than L-E from the computational as well as the hardware point of view.