All-to-All Communication on the Connection Machine CM-200

@article{Mathur1995AlltoAllCO,
  title={All-to-All Communication on the Connection Machine CM-200},
  author={Kapil K. Mathur and S. Lennart Johnsson},
  journal={Scientific Programming},
  year={1995},
  volume={4},
  pages={251-273}
}
Detailed algorithms for all{to{all broadcast and reduction are given for arrays mapped by binary or binary{reeected Gray code encoding to the processing nodes of binary cube networks. Algorithms are also given for the local computation of the array indices for the communicated data, thereby reducing the demand for communications bandwidth. For the Connection Machine system CM{200, Hamiltonian cycle based all{to{all communication algorithms yield a performance that is a factor of two to ten… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Data structures and algorithms for the nite element method on a data parallel supercomputer

  • S. Lennart Johnsson, Kapil K. Mathur
  • International Journal of Numerical Methods in…
  • 1990
1 Excerpt

Embeddings of 3-dimensional grids into optimal hypercubes

  • M. Y. Chan
  • Pro- ceedings of the Fourth Conference on…
  • 1990
1 Excerpt

Fortran D language speci cation

  • Geo rey Fox, S. Hiranandani, +4 authors M. Wu
  • Technical Report TR90-141,
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…