메뉴 건너뛰기




Volumn 86, Issue 1, 2003, Pages 33-38

A bandwidth latency tradeoff for broadcast and reduction

Author keywords

Broadcast; Collective communication; Full duplex; Half duplex; Hierarchical Crossbar; Mesh; Parallel algorithms; Reduction; Single ported; Tree

Indexed keywords

ALGORITHMS; BANDWIDTH; DIGITAL ARITHMETIC; INTERPOLATION; TELECOMMUNICATION NETWORKS;

EID: 0037447584     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00473-8     Document Type: Article
Times cited : (20)

References (7)
  • 4
    • 0024735141 scopus 로고
    • Optimum broadcasting and personalized communication in hypercubes
    • Johnsson S.L., Ho C.T. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comput. 38:(9):1989;1249-1268.
    • (1989) IEEE Trans. Comput. , vol.38 , Issue.9 , pp. 1249-1268
    • Johnsson, S.L.1    Ho, C.T.2
  • 6
    • 0000679818 scopus 로고    scopus 로고
    • Optimal and near-optimal algorithms for k-item broadcast
    • Santos E.E. Optimal and near-optimal algorithms for k-item broadcast. J. Parallel Distrib. Comput. 57:1999;121-139.
    • (1999) J. Parallel Distrib. Comput. , vol.57 , pp. 121-139
    • Santos, E.E.1


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