This paper addresses the challenge of how to permit tightly coupled parallel applications, optimised for uniform, stable, static environments, execute equally efficiently in environments which exhibit the complete opposite characteristics. Using the $N$-body problem as a case study, both the traditional and proposed grid enabled MPI implementations of the popular ring algorithm are analysed. Results with respect to performance show the latter approach to be competitive on a cluster and significantly more effective in heterogeneous and dynamic environments.
展开▼
机译：本文解决了如何允许紧密耦合并行应用的挑战，针对均匀，稳定，静态环境进行优化，同样有效地在表现出完整相反的特征的环境中。使用$ n $ -body问题作为案例研究，分析了流行的环算法的传统和拟议的网格实现的MPI实现。结果方面表现出在群体上具有竞争力的后一种方法，在异构和动态环境中显着更有效。
展开▼
