메뉴 건너뛰기




Volumn 4192 LNCS, Issue , 2006, Pages 49-57

Parallel prefix (scan) algorithms for MPI

Author keywords

Cluster of SMPs; Collective communication; MPI implementation; Pipelining; Prefix sum

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

EID: 33750229934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11846802_15     Document Type: Conference Paper
Times cited : (34)

References (11)
  • 2
    • 0024770039 scopus 로고
    • Scans as primitive parallel operations
    • G. E. Blelloch. Scans as primitive parallel operations. IEEE Transactions on Computers, 38(11):1526-1538, 1989.
    • (1989) IEEE Transactions on Computers , vol.38 , Issue.11 , pp. 1526-1538
    • Blelloch, G.E.1
  • 6
    • 0002953347 scopus 로고    scopus 로고
    • Efficient parallel prefix algorithms on multiport message-passing systems
    • Y.-C. Lin and C.-S. Yeh. Efficient parallel prefix algorithms on multiport message-passing systems. Information Processing Letters, 71:91-95, 1999.
    • (1999) Information Processing Letters , vol.71 , pp. 91-95
    • Lin, Y.-C.1    Yeh, C.-S.2
  • 7
    • 0001166707 scopus 로고
    • Pipelined parallel prefix computations, and sorting on a pipelined hypercube
    • E. W. Mayr and C. G. Plȧxton. Pipelined parallel prefix computations, and sorting on a pipelined hypercube. Journal of Parallel and Distributed Computing, 17:374-380, 1993.
    • (1993) Journal of Parallel and Distributed Computing , vol.17 , pp. 374-380
    • Mayr, E.W.1    Plaxton, C.G.2
  • 8
    • 0037447584 scopus 로고    scopus 로고
    • A bandwidth latency tradeoff for broadcast and reduction
    • P. Sanders and J. F. Sibeyn. A bandwidth latency tradeoff for broadcast and reduction. Information Processing Letters, 86(1):33-38, 2003.
    • (2003) Information Processing Letters , vol.86 , Issue.1 , pp. 33-38
    • Sanders, P.1    Sibeyn, J.F.2
  • 9
    • 0036106373 scopus 로고    scopus 로고
    • Optimal and efficient algorithms for summing and prefix summing on parallel machines
    • E. E. Santos. Optimal and efficient algorithms for summing and prefix summing on parallel machines. Journal of Parallel and Distributed Computing, 62(4):517-543, 2002.
    • (2002) Journal of Parallel and Distributed Computing , vol.62 , Issue.4 , pp. 517-543
    • Santos, E.E.1


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