메뉴 건너뛰기




Volumn , Issue , 1997, Pages 23-32

(De) composition rules for parallel scan and reduction

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKES; COLLECTIVE OPERATIONS; COMPOSITION RULE; DATA PARALLELISM; DISTRIBUTED MEMORY; PARALLEL MODELS; PARTIAL REDUCTION; PERFORMANCE GAIN;

EID: 85040006255     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MPPM.1997.715958     Document Type: Conference Paper
Times cited : (13)

References (19)
  • 2
    • 0024647596 scopus 로고
    • Algebraic identities for program calculation
    • R. Bird. Algebraic identities for program calculation. The Computer J., 32(2):122-126, 1989.
    • (1989) The Computer J. , vol.32 , Issue.2 , pp. 122-126
    • Bird, R.1
  • 3
    • 0029312008 scopus 로고    scopus 로고
    • Calculating recurrences using the Bird-Meertens formalism
    • W. Cai and D. Skillicorn. Calculating recurrences using the Bird-Meertens formalism. Parallel Processing Letters, 5(2):179-190.
    • Parallel Processing Letters , vol.5 , Issue.2 , pp. 179-190
    • Cai, W.1    Skillicorn, D.2
  • 7
    • 84947938236 scopus 로고    scopus 로고
    • Systematic efficient parallelization of scan and other list homomorphisms
    • L. Bouge et al., editors, Springer-Verlag
    • S. Gorlatch. Systematic efficient parallelization of scan and other list homomorphisms. In L. Bouge et al., editors, Parallel Processing. Euro-Par'96, Lecture Notes in Computer Science 1124, pages 401-408. Springer-Verlag, 1996.
    • (1996) Parallel Processing. Euro-Par'96, Lecture Notes in Computer Science 1124 , pp. 401-408
    • Gorlatch, S.1
  • 9
    • 0039052451 scopus 로고    scopus 로고
    • Optimizing compositions of scans and reductions in parallel program derivation
    • Universitat Passau, May
    • S. Gorlatch. Optimizing compositions of scans and reductions in parallel program derivation. Technical Report MIP-9711, Universitat Passau, May 1997. Available at http://www.fmi.uni-passau.de/cl/papers/Gor97b.html.
    • (1997) Technical Report MIP-9711
    • Gorlatch, S.1
  • 10
    • 0342406370 scopus 로고    scopus 로고
    • Formal derivation of divide-and-conquer programs: A case study in the multidimensional FFT's
    • D. Mery, editor
    • S. Gorlatch and H. Bischof. Formal derivation of divide-and-conquer programs: A case study in the multidimensional FFT's. In D. Mery, editor, Formal Methods for Parallel Programming: Theory and Applications. Workshop at IPPS'97, pages 80-94, 1997. Available at http://www.fmi.uni-passau.de/cl/papers/GorBi97.html.
    • (1997) Formal Methods for Parallel Programming: Theory and Applications. Workshop at IPPS'97 , pp. 80-94
    • Gorlatch, S.1    Bischof, H.2
  • 15
    • 0028548321 scopus 로고
    • Powerlist: A structure for parallel recursion
    • J. Misra. Powerlist: a structure for parallel recursion. ACM TOPLAS, 16(6):1737-1767, 1994.
    • (1994) ACM TOPLAS , vol.16 , Issue.6 , pp. 1737-1767
    • Misra, J.1
  • 16
    • 0019563297 scopus 로고
    • The cube-connected cycles: A versatile network for parallel computation
    • F. Preparata and J. Vuillemin. The cube-connected cycles: A versatile network for parallel computation. Communications of the ACM, 24(5):300-309, 1981.
    • (1981) Communications of the ACM , vol.24 , Issue.5 , pp. 300-309
    • Preparata, F.1    Vuillemin, J.2


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