|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| K.W. Doty, "New Designs for Dense Processor Interconnection Networks," IEEE Transactions on Computers, vol. 33, no. 5, pp. 447-450, May, 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1984.1676461, author = {K.W. Doty}, title = {New Designs for Dense Processor Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {5}, issn = {0018-9340}, year = {1984}, pages = {447-450}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676461}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - New Designs for Dense Processor Interconnection Networks IS - 5 SN - 0018-9340 SP447 EP450 EPD - 447-450 A1 - K.W. Doty, PY - 1984 KW - network topology KW - Chordal rings KW - diameter KW - (d KW - k) graphs KW - multicomputer systems VL - 33 JA - IEEE Transactions on Computers ER - | |||
Distributed computer systems can be modeled using graph theory to evaluate potential network topologies. A good network from a communication standpoint should have a small diameter because this allows all pairs of processors to communicate quickly. This paper presents a new construction method for interconnection networks, which is a generalization of the chordal ring networks of Arden and Lee. The graphs produced by this method are the largest known for many degrees and diameters.
Index Terms:
network topology, Chordal rings, diameter, (d, k) graphs, multicomputer systems
Citation:
K.W. Doty, "New Designs for Dense Processor Interconnection Networks," IEEE Transactions on Computers, vol. 33, no. 5, pp. 447-450, May 1984, doi:10.1109/TC.1984.1676461
Usage of this product signifies your acceptance of the Terms of Use.