메뉴 건너뛰기




Volumn 68, Issue 4, 1998, Pages 179-183

Pruned three-dimensional toroidal networks

Author keywords

Cayley graph; Interconnection networks; Manhattan street network; Processor array; Pruning strategy; Torus

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; PROGRAM PROCESSORS;

EID: 0042263939     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00164-1     Document Type: Article
Times cited : (16)

References (10)
  • 2
    • 34250833453 scopus 로고
    • A group-theoretic model for symmetric interconnection networks
    • S.B. Akers, B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. Comput. 38 (1989) 555-566.
    • (1989) IEEE Trans. Comput. , vol.38 , pp. 555-566
    • Akers, S.B.1    Krishnamurthy, B.2
  • 4
    • 0027549875 scopus 로고
    • Design and analysis of multidimensional Manhattan street networks
    • T.Y. Chung, D.P. Agrawal, Design and analysis of multidimensional Manhattan street networks, IEEE Trans. Comm. 41 (1993) 295-298.
    • (1993) IEEE Trans. Comm. , vol.41 , pp. 295-298
    • Chung, T.Y.1    Agrawal, D.P.2
  • 5
    • 0029724470 scopus 로고    scopus 로고
    • A new technique for 3D domain decomposition on multicomputers which reduces message passing
    • Honolulu, HI, April
    • J. Gil, A. Wagner, A new technique for 3D domain decomposition on multicomputers which reduces message passing, in: Proc. Internat. Parallel Processing Symp., Honolulu, HI, April 1996, pp. 831-835.
    • (1996) Proc. Internat. Parallel Processing Symp. , pp. 831-835
    • Gil, J.1    Wagner, A.2
  • 6
    • 0030652072 scopus 로고    scopus 로고
    • A class of fixed-degree Cayley-graph interconnection networks derived by pruning k-ary n-cubes
    • Bloomingdale, IL, August
    • D.-M Kwai, B. Parhami, A class of fixed-degree Cayley-graph interconnection networks derived by pruning k-ary n-cubes, in: Proc. Internat. Conf. on Parallel Processing, Bloomingdale, IL, August 1997.
    • (1997) Proc. Internat. Conf. on Parallel Processing
    • Kwai, D.-M.1    Parhami, B.2
  • 7
    • 0027578596 scopus 로고
    • Symmetry in interconnection networks based on Cayley graphs of permutation group: A survey
    • S. Lakshmivarahan, J.-S. Jwo, S.K. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutation group: a survey, Parallel Comput. 19 (1993) 361-401.
    • (1993) Parallel Comput. , vol.19 , pp. 361-401
    • Lakshmivarahan, S.1    Jwo, J.-S.2    Dhall, S.K.3
  • 8
    • 0023344668 scopus 로고
    • Routing in the Manhattan street network
    • N.F. Maxemchuk, Routing in the Manhattan street network, IEEE Trans. Comm. 35 (1987) 503-512.
    • (1987) IEEE Trans. Comm. , vol.35 , pp. 503-512
    • Maxemchuk, N.F.1
  • 10
    • 0019008628 scopus 로고
    • Communication structures for large networks of microcomputers
    • L.D. Wittie, Communication structures for large networks of microcomputers, IEEE Trans. Comput. 30 (1981) 264-273.
    • (1981) IEEE Trans. Comput. , vol.30 , pp. 264-273
    • Wittie, L.D.1


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