β Scribed by BERNASCHI, MASSIMO; IANNELLO, GIULIO
No coin nor oath required. For personal study only.
Collective communication operations (CCOs) are one of the most powerful tools for parallel processing on distributed memory architectures. From the theoretical viewpoint there has been a major effort in the design of optimal algorithms for these operations, especially for massive parallel processors (MPPs). However, in spite of the increasing availability of MPPs, there are just a few limited experimental checks of the different theories, so the assessment of their real value is not easy. The aim of the present paper is to address such issues for the most common CCOs, considering practical algorithms that can be included in a generic communication library. The main result is a new algorithm for building a quasi-optimal broadcast tree that is much simpler than, and as efficient as, previously available algorithms. To investigate the advantages and drawbacks of the proposed algorithms, a large set of experimental data has been collected on an IBM SP2 parallel system. The data demonstrate the efficiency of our approach in a number of interesting cases. Finally, all the experimental results have been related to the model used in designing the algorithms.
π SIMILAR VOLUMES
## Abstract A theory of design of chemical reactors is developed for twoβphase fluid systems where the rates of chemical reaction are low relative to the rates of mass transfer. Equations are presented for batch, column, and continuous stirred tank operations. Experimental data on the continuous hy