On Optimal Placements of Processorsin Fault-Tolerant

@inproceedings{Tori1997OnOP,
  title={On Optimal Placements of Processorsin Fault-Tolerant},
  author={Tori and NetworksMario and Blaum and Jehoshua Bruck and Gustavo D. Pifarr and Jorge L. C. Sanz},
  year={1997}
}
Two and three dimensional k-tori are among the most used topologies in the design of new parallel computers. Traditionally (with the exception of the Tera parallel computer), these networks have been used as fully-populated networks, in the sense that every routing node in the topology is subjected to message injection. However, fully-populated tori and meshes exhibit a theoretical throughput which degrades as the network size increases. In addition, the performance of those networks is… CONTINUE READING

Similar Papers

Citations

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

Lower Bounds on Communication Loads with Optimal Placements in Torus Networks

  • IEEE Trans. Computers
  • 2000
VIEW 9 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Lower bounds on communication loads and optimal placements in torus networks

  • Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing
  • 1998

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes

  • FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing
  • 1993
VIEW 1 EXCERPT

Introduction to Parallel Algorithms and Architectures,

F. T. Leighton
  • 1992
VIEW 1 EXCERPT

Chaos router: architecture and performance

  • [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture
  • 1991
VIEW 1 EXCERPT

Limits on Interconnection Network Performance

  • IEEE Trans. Parallel Distrib. Syst.
  • 1991
VIEW 1 EXCERPT

A

R. Alverson, D. Callahan, D. Cummings, B. Koblenz
  • Porter eld and B. Smith, \The Tera Computer System," ACM Supercomputing
  • 1990
VIEW 1 EXCERPT

P

W. Dally, A. Chien, +4 authors R. Lethin
  • Nuth and S. Wills, \The J-Machine: A Fine Grain Concurrent Computer," IFIP Congress
  • 1989
VIEW 1 EXCERPT