|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Chiuyuan Chen, F.k. Hwang, "The Minimum Distance Diagram of Double-Loop Networks," IEEE Transactions on Computers, vol. 49, no. 9, pp. 977-979, September, 2000. | |||
| BibTex | x | ||
| @article{ 10.1109/12.869331, author = {Chiuyuan Chen and F.k. Hwang}, title = {The Minimum Distance Diagram of Double-Loop Networks}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {9}, issn = {0018-9340}, year = {2000}, pages = {977-979}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.869331}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - The Minimum Distance Diagram of Double-Loop Networks IS - 9 SN - 0018-9340 SP977 EP979 EPD - 977-979 A1 - Chiuyuan Chen, A1 - F.k. Hwang, PY - 2000 KW - Double-loop network KW - L-shape KW - diameter KW - sieve method. VL - 49 JA - IEEE Transactions on Computers ER - | |||
Abstract—It is well-known that the minimum distance diagram of a double-loop network yields an L-shape. It is important to know, for a given L-shape, whether there exists a double-loop network realizing it. Necessary and sufficient conditions were given before, but were said to be cumbersome. They also need some clarification. We give new conditions and a simple proof. We also prove that all double-loop networks realizing the same L-shape are isomorphic as the existing proof was given in a Spanish dissertation.
[1] M.A. Fiol, “Applications of Graph Theory to Interconnection Networks,” PhD dissertation, Polytechnic Univ. of Barcelona, Spain, 1982.
[2] M.A. Fiol, M. Valero, J.L.A. Yebra, I. Alegre, and T. Lang, “Optimization of Double-Loop Structures for Local Networks,” Proc. 19th Int'l Symp. MIMI '82, pp. 37-41, 1982.
[3] M.A. Fiol, J.L.A. Yebra, I. Alegre, and M. Valero, “A Discrete Optimization Problem in Local Networks and Data Alignment,” IEEE Trans. Computers, vol. 36, no. 6, pp. 702-713, June 1987.
[4] J. Shen and Q. Li, “Two Theorems on Double-Loop Networks,” unpublished manuscript, 1994.
[5] C.K. Wong and D. Coppersmith, “A Combinatorial Problem Related to Multimodule Organizations,” J. ACM, vol. 21, pp. 392-402, July 1974.