메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 71-76

Efficient all-to-all broadcast schemes in distributed-memory parallel computers

Author keywords

all to all broadcast; distributed parallel computing systems; inter processor communication; star network

Indexed keywords

COMPLEX NETWORKS; MEMORY ARCHITECTURE; PARALLEL PROCESSING SYSTEMS; STARS;

EID: 84949921573     PISSN: 15505243     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCSA.2002.1019136     Document Type: Conference Paper
Times cited : (3)

References (10)
  • 3
    • 85010419070 scopus 로고
    • Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
    • S. G. AKL, K. QIU, AND I. STOJMENOVIC, "Fundamental Algorithms for The Star and Pancake Interconnection Networks With Applications to Computational Geometry", Networks, 1993, vol.23, no. 4, pp. 215-225.
    • (1993) Networks , vol.23 , Issue.4 , pp. 215-225
    • Akl, S.G.1    Qiu, K.2    Stojmenovic, I.3
  • 4
    • 0028743087 scopus 로고
    • Optimal NODUP all-to-all broadcast schemes in distributed computing systems
    • M.-S. CHEN, P. S. YU, AND K.-L. WU, "Optimal NODUP All-to-All Broadcast Schemes in Distributed Computing Systems", IEEE Trans. Parallel and Distributed Systems, 1994, pp. 1275-1284.
    • (1994) IEEE Trans. Parallel and Distributed Systems , pp. 1275-1284
    • Chen, M.-S.1    Yu, P.S.2    Wu, K.-L.3
  • 5
    • 84904335486 scopus 로고
    • Computational properties of mesh connected trees: Versatile architecture for parallel computation
    • K. EFE AND A. FERNANDEZ, "Computational Properties of Mesh Connected Trees: Versatile Architecture for Parallel Computation", Int'l Conference on Parallel Processing, 1994, pp. 72-76.
    • (1994) Int'l Conference on Parallel Processing , pp. 72-76
    • Efe, K.1    Fernandez, A.2
  • 6
    • 84941517445 scopus 로고
    • Intel Corp. iPSC/2 User's Guide, Mar
    • Intel Corp. iPSC/2 User's Guide, Intel Corp., Mar, 1988.
    • (1988) Intel Corp
  • 7
    • 0018518295 scopus 로고
    • Virtual cut-through: A new computer communication switching technique
    • P. Kermani and L. Kleinrock, "Virtual Cut-Through: A New Computer Communication Switching Technique", Comput. Netw. 1979, vol.3, pp. 267-286.
    • (1979) Comput. Netw. , vol.3 , pp. 267-286
    • Kermani, P.1    Kleinrock, L.2
  • 8
    • 0029327970 scopus 로고
    • An optimal broadcasting algorithmwithout message redundancy in star graphs
    • J.-P. Sheu, C.-T.Wu, and T.-S. Chen, "An Optimal Broadcasting AlgorithmWithout Message Redundancy in Star Graphs", IEEE Trans. Parallel and Distributed Systems 1995, vol.6, no. 6, pp. 653-658.
    • (1995) IEEE Trans. Parallel and Distributed Systems , vol.6 , Issue.6 , pp. 653-658
    • Sheu, J.-P.1    Wu, C.-T.2    Chen, T.-S.3
  • 10
    • 0031389144 scopus 로고    scopus 로고
    • Toward optimal broadcast in a star graph using multiple spanning trees
    • Y.-C. TSENG AND J.-P. SHEU, "Toward Optimal Broadcast in A Star Graph Using Multiple Spanning Trees", IEEE Trans. Computers 1997, vol. 46, pp. 593-599.
    • (1997) IEEE Trans Computers , vol.46 , pp. 593-599
    • Tseng, Y.-C.1    Sheu, J.-P.2


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