Evaluating the Mesh-connected Multiprocessor Running a Parallel Algorithm Representing the Gravitational Interaction Between N Bodies

Abstract

In this study, a parallel algorithm to solve the problem of gravitational interaction between N bodies is considered. The peak performance of an 8 × 8 mesh-connected multiprocessor system while implementing the algorithm is evaluated. Further, the mappings of parallel threads of the algorithm onto the multiprocessor are studied based on two criteria for minimizing the communication delay. The corresponding real application performance of the multiprocessor is estimated.