메뉴 건너뛰기




Volumn 56, Issue 4, 2007, Pages 502-510

Low diameter interconnections for routing in high-performance parallel systems

Author keywords

Circuit switching; Deterministic routing; Directed graphs; Fixed diameter graphs; Interconnection networks; Low diameter networks

Indexed keywords

COMPUTER CIRCUITS; COMPUTER SYSTEMS; GRAPH THEORY; INTERCONNECTION NETWORKS; NETWORK ROUTING; OPTIMIZATION; SWITCHING THEORY;

EID: 34047183689     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2007.1004     Document Type: Article
Times cited : (6)

References (21)
  • 2
    • 0040273728 scopus 로고
    • "The Impossibility of Directed Moore Graphs"
    • W. Bridges and S. Toueg, "The Impossibility of Directed Moore Graphs," J. Combinatorial Theory, vol. 29, no. 3, pp. 339-341, 1980.
    • (1980) J. Combinatorial Theory , vol.29 , Issue.3 , pp. 339-341
    • Bridges, W.1    Toueg, S.2
  • 3
    • 0039508474 scopus 로고
    • "Vertex Symmetric Digraphs with Small Diameters"
    • F. Comellas and M. Fiol, "Vertex Symmetric Digraphs with Small Diameters," Discrete Applied Math., vol. 58, pp. 1-11, 1995.
    • (1995) Discrete Applied Math. , vol.58 , pp. 1-11
    • Comellas, F.1    Fiol, M.2
  • 4
    • 15944367594 scopus 로고    scopus 로고
    • "Overlay Design Mechanisms for Heterogeneous, Large Scale, Dynamic P2P Systems"
    • V. Dalagiannis, A. Mauthe, and R. Steinmetz, "Overlay Design Mechanisms for Heterogeneous, Large Scale, Dynamic P2P Systems," J. Networks and System Management, vol. 12, no. 3, pp. 371-395, 2004.
    • (2004) J. Networks and System Management , vol.12 , Issue.3 , pp. 371-395
    • Dalagiannis, V.1    Mauthe, A.2    Steinmetz, R.3
  • 5
    • 0000262264 scopus 로고
    • "A Combinatorial Problem"
    • N. De Bruijn, "A Combinatorial Problem," Proc. Akademe Van Wetenschappen, vol. 49, part 2, pp. 758-764, 1946.
    • (1946) Proc. Akademe Van Wetenschappen , vol.49 , Issue.2 , pp. 758-764
    • De Bruijn, N.1
  • 8
    • 0022119450 scopus 로고
    • "Faut-Tolerant Routing in De Bruijn Communication Networks"
    • Sept
    • A. Esfahanian and S. Hakimi, "Faut-Tolerant Routing in De Bruijn Communication Networks," IEEE Trans. Computers, vol. 34, no. 9, pp. 777-788, Sept. 1985.
    • (1985) IEEE Trans. Computers , vol.34 , Issue.9 , pp. 777-788
    • Esfahanian, A.1    Hakimi, S.2
  • 11
    • 0026884871 scopus 로고
    • "The Partial Line Digraph Technique in the Design of Large Interconnection Networks"
    • July
    • M. Fiol and A. Llado, "The Partial Line Digraph Technique in the Design of Large Interconnection Networks," IEEE Trans. Computers, vol. 41, no. 7, pp. 848-857, July 1992.
    • (1992) IEEE Trans. Computers , vol.41 , Issue.7 , pp. 848-857
    • Fiol, M.1    Llado, A.2
  • 13
    • 0023828026 scopus 로고
    • "ShuffleNet: An Application of Generalized Perfect Shuffle to Multihop Lightwave Networks"
    • Mar
    • M. Hluchyi and M. Karol, "ShuffleNet: An Application of Generalized Perfect Shuffle to Multihop Lightwave Networks," Proc. INFOCOM '88, Mar. 1988.
    • (1988) Proc. INFOCOM '88
    • Hluchyi, M.1    Karol, M.2
  • 14
    • 0020795920 scopus 로고
    • "A Design for Directed Graphs with Minimum Diameter"
    • Aug
    • M. Imase and M. Itoh, "A Design for Directed Graphs with Minimum Diameter," IEEE Trans. Computers, vol. 32, no. 8, pp. 782-784, Aug. 1983.
    • (1983) IEEE Trans. Computers , vol.32 , Issue.8 , pp. 782-784
    • Imase, M.1    Itoh, M.2
  • 15
    • 0005256874 scopus 로고
    • "Bounds on Directed (d, k) Graphs"
    • AFcKL-68-0668 final report
    • W. Kautz, "Bounds on Directed (d, k) Graphs," Theory of Cellular Logic Networks and Machines, AFcKL-68-0668 final report, pp. 20-28, 1968.
    • (1968) Theory of Cellular Logic Networks and Machines , pp. 20-28
    • Kautz, W.1
  • 16
    • 0028416281 scopus 로고
    • "Reconfiguration with Time Division Multiplexed MINs for Multiprocessor Communications"
    • Apr
    • C. Qiao and R. Melhem, "Reconfiguration with Time Division Multiplexed MINs for Multiprocessor Communications," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 4, pp. 337-352, Apr. 1994.
    • (1994) IEEE Trans. Parallel and Distributed Systems , vol.5 , Issue.4 , pp. 337-352
    • Qiao, C.1    Melhem, R.2
  • 17
    • 33845402264 scopus 로고    scopus 로고
    • "Analyzing Ultra-Scale Application Communication Requirements for a Reconfigurable Hybrid Interconnect"
    • Nov
    • J. Shalf, S. Kamil, L. Oliker, and D. Skinner, "Analyzing Ultra-Scale Application Communication Requirements for a Reconfigurable Hybrid Interconnect," Proc. Supercomputing '05, Nov. 2005.
    • (2005) Proc. Supercomputing '05
    • Shalf, J.1    Kamil, S.2    Oliker, L.3    Skinner, D.4
  • 19
    • 0015017871 scopus 로고
    • "Parallel Processing with the Perfect Shuffle"
    • Feb
    • H. Stone, "Parallel Processing with the Perfect Shuffle," IEEE Trans. Computers, vol. 20, no. 2, pp. 153-161, Feb. 1971.
    • (1971) IEEE Trans. Computers , vol.20 , Issue.2 , pp. 153-161
    • Stone, H.1
  • 20
    • 0026241080 scopus 로고
    • "Faut-Tolerant Networks Based on the De Bruijn Graph"
    • Oct
    • M. Sridhar and C. Ragavendra, "Faut-Tolerant Networks Based on the De Bruijn Graph," IEEE Trans. Computers, vol. 40, no. 10, pp. 1167-1174, Oct. 1991.
    • (1991) IEEE Trans. Computers , vol.40 , Issue.10 , pp. 1167-1174
    • Sridhar, M.1    Ragavendra, C.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.