A new technique for 3-D domain decomposition on multicomputers which reduces message-passing

@article{Gil1996ANT,
  title={A new technique for 3-D domain decomposition on multicomputers which reduces message-passing},
  author={Joseph Gil and Alan S. Wagner},
  journal={Proceedings of International Conference on Parallel Processing},
  year={1996},
  pages={831-835}
}
Algorithms for many geometric and physical problems rely on a decomposition of 3D space. The cubical decomposition that is typically used can lead to costly communication overheads when implemented on multicomputers since each cubical cell is adjacent to, and may interact with, as many as 26 neighbouring cells. We explore an alternate decomposition based on truncated octahedra that, along with other advantages, reduces message passing. The cost of implementing the communication structure… CONTINUE READING

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

Network Performance of Pruned Hierarchical Torus Network

  • 2009 Sixth IFIP International Conference on Network and Parallel Computing
  • 2009

A Unified Formulation of Honeycomb and Diamond Networks

  • IEEE Trans. Parallel Distrib. Syst.
  • 2001
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

Hexagonal lattice geometry for monte car 10 calculations

M. Nakagawa
  • Ann . Nuclear Energy
  • 1988

Issues in the study of graph embeddings

H. Noltemeier
  • 1981

Regular Polytopes

H. Coxeter
  • 1947