Search

The article reports on the adaptation of the general framework to run two representative applications on our Organic Grid prototype: the basic local alignment search tool of National Center for Biotechnology Information in Bethesda, Maryland, and the Cannon's algorithm for matrix multiplication. The way computation is organized on the Organic Grid is determined completely on agent behavior. Computation and scheduling are decoupled from the underlying grid infrastructure through encapsulating application code and scheduling functionality into mobile agents.

We discuss the efficient implementation of a collective operation called reduce-scatter, which is defined in the MPI standard. The reduce-scatter is equivalent to the combination of a reduction on vectors of length n with a scatter of the resulting n-vector to all processors.We describe the implementation issues and the performance characterization of two recently proposed algorithms for the reduce-scatter that have been proven to be highly efficient in theory under the assumption of fully connected parallel system.A performance comparison with existing mainstream implementations of the operation is presented which confirms the practical advantage of the new algorithms. Experiments show that the two algorithms have different characteristics which make them complementary in providing a performance gain over standard algorithms.Our study has been carried out on two different platforms: an SP2 and a Myrinet interconnected cluster of Pentium PRO. However, most of the results reported here are not specific for either MPI or the platforms used, and they hold in general for any message passing programming system. [Copyright &y& Elsevier]