메뉴 건너뛰기




Volumn 12, Issue 1, 2001, Pages 74-80

A unified formulation of honeycomb and diamond networks

Author keywords

Cayley graph; k ary n cube; Network topology; Processor array; Pruned torus network; VLSI layout

Indexed keywords

CAYLEY GRAPH; DIAMOND NETWORKS; HONEYCOMB NETWORKS; PROCESSOR ARRAY; PRUNED TORUS NETWORK;

EID: 0035110976     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.899940     Document Type: Article
Times cited : (70)

References (21)
  • 3
    • 0029724470 scopus 로고    scopus 로고
    • A New Technique for 3D Domain Decomposition on Multicomputers which Reduces Message Passing
    • Apr.
    • J. Gil and A. Wagner, "A New Technique for 3D Domain Decomposition on Multicomputers which Reduces Message Passing," Proc. Int'l Parallel Processing Symp., pp. 831-835, Apr. 1996.
    • (1996) Proc. Int'l 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
    • Aug.
    • D.-M. Kwai and B. Parhami, "A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-Ary n-Cubes" Proc. Int'l Conf. Parallel Processing, pp. 92-95, Aug. 1997.
    • (1997) Proc. Int'l Conf. Parallel Processing , pp. 92-95
    • Kwai, D.-M.1    Parhami, B.2
  • 7
    • 2942565003 scopus 로고    scopus 로고
    • Comparing Torus, Pruned Torus, and Manhattan Street Networks as Interconnection Architectures for Highly Parallel Computers
    • Nov.
    • D.-M. Kwai and B. Parhami, "Comparing Torus, Pruned Torus, and Manhattan Street Networks as Interconnection Architectures for Highly Parallel Computers," Proc. Int'l Conf. Parallel and Distributed Computing and Systems, pp. 19-22, Nov. 1999.
    • (1999) Proc. Int'l Conf. Parallel and Distributed Computing and Systems , pp. 19-22
    • Kwai, D.-M.1    Parhami, B.2
  • 8
    • 0027578596 scopus 로고
    • Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Group: A Survey
    • S. Lakshmivarahan, J.-S. Jwo, and S.K. Dahl, "Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Group: A Survey," Parallel Computing, vol. 19, pp. 361-401, 1993.
    • (1993) Parallel Computing , vol.19 , pp. 361-401
    • Lakshmivarahan, S.1    Jwo, J.-S.2    Dahl, S.K.3
  • 10
    • 0031245246 scopus 로고    scopus 로고
    • Problems with Comparing Interconnection Networks: Is an Alligator Better than an Armadillo?
    • Oct.-Dec.
    • K.J. Liszka, J.K. Antonio, and H.J. Siegel, "Problems with Comparing Interconnection Networks: Is an Alligator Better than an Armadillo?" IEEE Concurrency, vol. 5, no. 4, pp. 18-28, Oct.-Dec. 1997.
    • (1997) IEEE Concurrency , vol.5 , Issue.4 , pp. 18-28
    • Liszka, K.J.1    Antonio, J.K.2    Siegel, H.J.3
  • 14
    • 0031065376 scopus 로고    scopus 로고
    • APEmille: A Parallel Processor in the Teraflop Range
    • Feb.
    • E. Panizzi, "APEmille: A Parallel Processor in the Teraflop Range," Nuclear Physics, vol. 53, pp. 1014-1016, Feb. 1997.
    • (1997) Nuclear Physics , vol.53 , pp. 1014-1016
    • Panizzi, E.1
  • 16
    • 16244380947 scopus 로고    scopus 로고
    • Challenges in Interconnection Network Design in the Era of Multiprocessor and Massively Parallel Microchips
    • June
    • B. Parhami and D.-M. Kwai, "Challenges in Interconnection Network Design in the Era of Multiprocessor and Massively Parallel Microchips," Proc. Int'l Conf. Comm. Computing, pp. 241-246, June 2000.
    • (2000) Proc. Int'l Conf. Comm. Computing , pp. 241-246
    • Parhami, B.1    Kwai, D.-M.2
  • 18
    • 84968487114 scopus 로고
    • On a Class of Fixed-Point-Free Graphs
    • G. Sabidussi, "On a Class of Fixed-Point-Free Graphs," Proc. American Mathematical Society, vol. 9, pp. 800-804, 1958.
    • (1958) Proc. American Mathematical Society , vol.9 , pp. 800-804
    • Sabidussi, G.1
  • 19
    • 0040347763 scopus 로고    scopus 로고
    • Routing on Triangles, Tori, and Honeycombs
    • Sept.
    • J.F. Sibeyn, "Routing on Triangles, Tori, and Honeycombs," J. Foundations of Computer Science, vol. 8, pp. 269-287, Sept. 1997.
    • (1997) J. Foundations of Computer Science , vol.8 , pp. 269-287
    • Sibeyn, J.F.1
  • 20
    • 0031248377 scopus 로고    scopus 로고
    • Honeycomb Networks: Topological Properties and Communication Algorithms
    • Oct.
    • I. Stojmenovic, "Honeycomb Networks: Topological Properties and Communication Algorithms" IEEE Trans. Parallel and Distributed Systems, vol. 8 pp. 1836-1842, Oct. 1997.
    • (1997) IEEE Trans. Parallel and Distributed Systems , vol.8 , pp. 1836-1842
    • Stojmenovic, I.1
  • 21
    • 0028532773 scopus 로고
    • RH: A Versatile Family of Reduced Hypercube Interconnection Networks
    • Nov.
    • S.G. Ziavras, "RH: A Versatile Family of Reduced Hypercube Interconnection Networks" IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 1210-1220, Nov. 1994.
    • (1994) IEEE Trans. Parallel and Distributed Systems , vol.5 , Issue.11 , pp. 1210-1220
    • Ziavras, S.G.1


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