메뉴 건너뛰기




Volumn 1300 LNCS, Issue , 1997, Pages 328-337

Solutions to the communication minimization problem for afflne recurrence equations

Author keywords

Automatic parallelization techniques; Communication optimization; System of recurrence equations

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 21744457389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002752     Document Type: Conference Paper
Times cited : (4)

References (10)
  • 1
    • 0029754522 scopus 로고    scopus 로고
    • Parametric analysis of polyhedral iteration spaces
    • Chicago, Illinois, August
    • Clauss, Ph., Loechner, V.: Parametric Analysis of Polyhedral Iteration Spaces. ASAP'96, Chicago, Illinois, August 1996.
    • (1996) ASAP'96
    • Clauss, Ph.1    Loechner, V.2
  • 2
    • 84957642752 scopus 로고
    • Mapping affine loop nests: New results
    • Milan, LNCS 919
    • Dion, M., Robert, Y.: Mapping affine loop nests: New results. HPCN'95, Milan, LNCS 919, 184-189, 1995.
    • (1995) HPCN'95 , pp. 184-189
    • Dion, M.1    Robert, Y.2
  • 3
    • 84882687559 scopus 로고
    • A graph-theoretic approach to the alignment problem
    • Darte, A., Robert, Y.: A graph-theoretic approach to the alignment problem. Parallel Processing Letters. 4(3), 1994.
    • (1994) Parallel Processing Letters , vol.4 , Issue.3
    • Darte, A.1    Robert, Y.2
  • 4
    • 0028513278 scopus 로고
    • Towards automatic distribution
    • Feautrier, P.: Towards automatic distribution. Parallel Processing Letters. 4(3): 233-244, 1994.
    • (1994) Parallel Processing Letters , vol.4 , Issue.3 , pp. 233-244
    • Feautrier, P.1
  • 5
    • 85029516676 scopus 로고
    • Loop parallelization in the polytope model
    • LNCS 715
    • Lengauer, Ch.: Loop parallelization in the polytope model. CONCUR'93, LNCS 715, 398-416, 1993.
    • (1993) CONCUR'93 , pp. 398-416
    • Lengauer, Ch.1
  • 7
    • 0029181814 scopus 로고
    • Mappings for communication minimization using distribution and alignment
    • Limassol, Cyprus, ACM Press
    • Mongenet, C: Mappings for communication minimization using distribution and alignment. PACT'95, Limassol, Cyprus, ACM Press, 185-193, 1995.
    • (1995) PACT'95 , pp. 185-193
    • Mongenet, C.1
  • 8
    • 84882593665 scopus 로고    scopus 로고
    • Affine dependence classification for communications minimization
    • Mongenet, C: Affine dependence classification for communications minimization. Research Report ICPS 96-08. http://icps.u-strasbg.fr/pubT96/
    • Research Report ICPS 96-08
    • Mongenet, C.1
  • 9
    • 85025486280 scopus 로고
    • A geometrical coding to compile affine recurrence equations on regular arrays
    • Anaheim, California
    • Mongenet, C, Clauss, Ph., Perrin, G. R.: A geometrical coding to compile affine recurrence equations on regular arrays. IPPS'91, Anaheim, California, 1991.
    • (1991) IPPS'91
    • Mongenet, C.1    Clauss, Ph.2    Perrin, G.R.3
  • 10
    • 51249173427 scopus 로고
    • The mapping of linear., recurrence equations on regular arrays
    • Quinton, P., Van Dongen, V.: The Mapping of Linear., Recurrence Equations on Regular Arrays. Journal of VLSI Signal Processing, 1:95-113, 1989.
    • (1989) Journal of VLSI Signal Processing , vol.1 , pp. 95-113
    • Quinton, P.1    Van Dongen, V.2


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