메뉴 건너뛰기




Volumn 11, Issue 7, 2000, Pages 720-728

Matrix multiplication and data routing using a partitioned optical passive stars network

Author keywords

[No Author keywords available]

Indexed keywords

OPTICAL PASSIVE STARS NETWORKS;

EID: 0034226293     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.877830     Document Type: Article
Times cited : (19)

References (9)
  • 4
    • 0000456144 scopus 로고
    • Parallel Matrix and Graph Algorithms
    • E. Dekel, D. Nassimi, and S. Sahni, "Parallel Matrix and Graph Algorithms," SIAM J. on Computing, vol. 10, no. 4, pp. 657-675, 1981.
    • (1981) SIAM J. on Computing , vol.10 , Issue.4 , pp. 657-675
    • Dekel, E.1    Nassimi, D.2    Sahni, S.3
  • 6
    • 0005931832 scopus 로고    scopus 로고
    • Realizing Common Communication Patterns in Partitioned Optical Passive Star (POPS) Networks
    • G. Graventreter and R. Melhem, "Realizing Common Communication Patterns in Partitioned Optical Passive Star (POPS) Networks," EEE Trans. Computers, pp. 998-1,013, 1998.
    • (1998) EEE Trans. Computers
    • Graventreter, G.1    Melhem, R.2
  • 7
    • 0017995340 scopus 로고
    • Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
    • J. Lenfant, "Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations," IEEE Trans. Computers, vol. 27, no. 7, pp. 637-647, 1978.
    • (1978) IEEE Trans. Computers , vol.27 , Issue.7 , pp. 637-647
    • Lenfant, J.1
  • 8
    • 0742309927 scopus 로고    scopus 로고
    • The Communication Capabilities of Partitioned Optical Passive Star Networks
    • K. Li, Y. Pan, and S. Zheng, eds. Kluwer Academic Publishers
    • R. Melhem, G. Graventreter, D. Chiarulli, and S. Levitan, "The Communication Capabilities of Partitioned Optical Passive Star Networks," Parallel Computing Using Optical Interconnections, K. Li, Y. Pan, and S. Zheng, eds. Kluwer Academic Publishers, pp. 77-98, 1998.
    • (1998) Parallel Computing Using Optical Interconnections , pp. 77-98
    • Melhem, R.1    Graventreter, G.2    Chiarulli, D.3    Levitan, S.4
  • 9
    • 0018915492 scopus 로고
    • An Optimal Routing Algorithm for Mesh-Connected Parallel Computers
    • D. Nassimi and S. Sahni, "An Optimal Routing Algorithm for Mesh-Connected Parallel Computers," J. ACM, vol. 27, no. 1, pp. 6-29, 1980.
    • (1980) J. ACM , vol.27 , Issue.1 , pp. 6-29
    • Nassimi, D.1    Sahni, S.2


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