메뉴 건너뛰기




Volumn 35, Issue 12, 2009, Pages 581-594

Two-tree algorithms for full bandwidth broadcast, reduction and scan

Author keywords

Bipartite edge coloring; Broadcast; Message passing parallel programming; Parallel prefix (scan); Reduction

Indexed keywords

BROADCAST; BROADCAST MESSAGES; EDGE COLORING; PARALLEL PREFIX; PARALLEL PREFIX (SCAN);

EID: 71549164097     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2009.09.001     Document Type: Article
Times cited : (89)

References (24)
  • 1
    • 0042658059 scopus 로고
    • Broadcasting multiple messages in simultaneous send/receive systems
    • Bar-Noy A., and Kipnis S. Broadcasting multiple messages in simultaneous send/receive systems. Discrete Applied Mathematics 55 2 (1994) 95-105
    • (1994) Discrete Applied Mathematics , vol.55 , Issue.2 , pp. 95-105
    • Bar-Noy, A.1    Kipnis, S.2
  • 2
    • 0347936947 scopus 로고    scopus 로고
    • Optimal multiple message broadcasting in telephone-like communication systems
    • Bar-Noy A., Kipnis S., and Schieber B. Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics 100 1-2 (2000) 1-15
    • (2000) Discrete Applied Mathematics , vol.100 , Issue.1-2 , pp. 1-15
    • Bar-Noy, A.1    Kipnis, S.2    Schieber, B.3
  • 3
    • 0028734038 scopus 로고    scopus 로고
    • M. Barnett, S. Gupta, D.G. Payne, L. Schuler, R. van de Geijn, J. Watts, Building a high-performance collective communication library, in: Supercomputing'94, 1994, pp. 107-116.
    • M. Barnett, S. Gupta, D.G. Payne, L. Schuler, R. van de Geijn, J. Watts, Building a high-performance collective communication library, in: Supercomputing'94, 1994, pp. 107-116.
  • 4
    • 20444467676 scopus 로고    scopus 로고
    • E.W. Chan, M.F. Heimlich, A. Purkayastha, R.A. van de Geijn, On optimizing collective communication, in: Cluster 2004, 2004.
    • E.W. Chan, M.F. Heimlich, A. Purkayastha, R.A. van de Geijn, On optimizing collective communication, in: Cluster 2004, 2004.
  • 5
    • 0030243005 scopus 로고    scopus 로고
    • A high-performance, portable implementation of the MPI message passing interface standard
    • Gropp W., Lusk E., Doss N., and Skjellum A. A high-performance, portable implementation of the MPI message passing interface standard. Parallel Computing 22 6 (1996) 789-828
    • (1996) Parallel Computing , vol.22 , Issue.6 , pp. 789-828
    • Gropp, W.1    Lusk, E.2    Doss, N.3    Skjellum, A.4
  • 9
    • 38449113776 scopus 로고    scopus 로고
    • Process cooperation in multiple message broadcast
    • Recent Advances in Parallel Virtual Machine and Message Passing Interface. 14th European PVM/MPI Users' Group Meeting, Springer-Verlag
    • Jia B. Process cooperation in multiple message broadcast. Recent Advances in Parallel Virtual Machine and Message Passing Interface. 14th European PVM/MPI Users' Group Meeting. Lecture Notes in Computer Science vol. 4757 (2007), Springer-Verlag 27-35
    • (2007) Lecture Notes in Computer Science , vol.4757 , pp. 27-35
    • Jia, B.1
  • 10
    • 0024735141 scopus 로고
    • Optimum broadcasting and personalized communication in hypercubes
    • Johnsson S.L., and Ho C.-T. Optimum broadcasting and personalized communication in hypercubes. IEEE Transactions on Computers 38 9 (1989) 1249-1268
    • (1989) IEEE Transactions on Computers , vol.38 , Issue.9 , pp. 1249-1268
    • Johnsson, S.L.1    Ho, C.-T.2
  • 11
    • 71549173458 scopus 로고    scopus 로고
    • T. Kieritz, Doppelte Fibonacchi-Bäume, Unpublished manuscript, Universität Karlsruhe, 2008.
    • T. Kieritz, Doppelte Fibonacchi-Bäume, Unpublished manuscript, Universität Karlsruhe, 2008.
  • 12
    • 21844509408 scopus 로고
    • Multiple message broadcasting in communication networks
    • Kwon O.-H., and Chwa K.-Y. Multiple message broadcasting in communication networks. Networks 26 (1995) 253-261
    • (1995) Networks , vol.26 , pp. 253-261
    • Kwon, O.-H.1    Chwa, K.-Y.2
  • 13
    • 0001166707 scopus 로고
    • Pipelined parallel prefix computations, and sorting on a pipelined hypercube
    • Mayr E.W., and Plaxton C.G. Pipelined parallel prefix computations, and sorting on a pipelined hypercube. Journal of Parallel and Distributed Computing 17 (1993) 374-380
    • (1993) Journal of Parallel and Distributed Computing , vol.17 , pp. 374-380
    • Mayr, E.W.1    Plaxton, C.G.2
  • 15
    • 34548696258 scopus 로고    scopus 로고
    • More efficient reduction algorithms for message-passing parallel systems
    • Recent Advances in Parallel Virtual Machine and Message Passing Interface. 11th European PVM/MPI Users' Group Meeting, Springer-Verlag
    • Rabenseifner R., and Träff J.L. More efficient reduction algorithms for message-passing parallel systems. Recent Advances in Parallel Virtual Machine and Message Passing Interface. 11th European PVM/MPI Users' Group Meeting. Lecture Notes in Computer Science vol. 3241 (2004), Springer-Verlag 36-46
    • (2004) Lecture Notes in Computer Science , vol.3241 , pp. 36-46
    • Rabenseifner, R.1    Träff, J.L.2
  • 17
    • 0037447584 scopus 로고    scopus 로고
    • A bandwidth latency tradeoff for broadcast and reduction
    • Sanders P., and Sibeyn J.F. A bandwidth latency tradeoff for broadcast and reduction. Information Processing Letters 86 1 (2003) 33-38
    • (2003) Information Processing Letters , vol.86 , Issue.1 , pp. 33-38
    • Sanders, P.1    Sibeyn, J.F.2
  • 18
    • 33750229934 scopus 로고    scopus 로고
    • Parallel prefix (scan) algorithms for MPI
    • Recent Advances in Parallel Virtual Machine and Message Passing Interface. 13th European PVM/MPI Users' Group Meeting, Springer-Verlag
    • Sanders P., and Träff J.L. Parallel prefix (scan) algorithms for MPI. Recent Advances in Parallel Virtual Machine and Message Passing Interface. 13th European PVM/MPI Users' Group Meeting. Lecture Notes in Computer Science vol. 4192 (2006), Springer-Verlag 49-57
    • (2006) Lecture Notes in Computer Science , vol.4192 , pp. 49-57
    • Sanders, P.1    Träff, J.L.2
  • 19
    • 0000679818 scopus 로고    scopus 로고
    • Optimal and near-optimal algorithms for k-item broadcast
    • Santos E.E. Optimal and near-optimal algorithms for k-item broadcast. Journal of Parallel and Distributed Computing 57 2 (1999) 121-139
    • (1999) Journal of Parallel and Distributed Computing , vol.57 , Issue.2 , pp. 121-139
    • Santos, E.E.1
  • 22
    • 33646129147 scopus 로고    scopus 로고
    • A simple work-optimal broadcast algorithm for message-passing parallel systems
    • Recent Advances in Parallel Virtual Machine and Message Passing Interface. 11th European PVM/MPI Users' Group Meeting, Springer-Verlag
    • Träff J.L. A simple work-optimal broadcast algorithm for message-passing parallel systems. Recent Advances in Parallel Virtual Machine and Message Passing Interface. 11th European PVM/MPI Users' Group Meeting. Lecture Notes in Computer Science vol. 3241 (2004), Springer-Verlag 173-180
    • (2004) Lecture Notes in Computer Science , vol.3241 , pp. 173-180
    • Träff, J.L.1
  • 23
    • 44449164332 scopus 로고    scopus 로고
    • Optimal broadcast for fully connected processor-node networks
    • Träff J.L., and Ripke A. Optimal broadcast for fully connected processor-node networks. Journal of Parallel and Distributed Computing 68 7 (2008) 887-901
    • (2008) Journal of Parallel and Distributed Computing , vol.68 , Issue.7 , pp. 887-901
    • Träff, J.L.1    Ripke, A.2


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