메뉴 건너뛰기




Volumn 24, Issue 3, 1996, Pages 265-289

A simple algorithm for the generation of efficient loop structures

Author keywords

Hierarchical domain descriptor (hdd); Iteration counting; Parametric polyhedron

Indexed keywords

CODES (SYMBOLS); HIERARCHICAL SYSTEMS; ITERATIVE METHODS; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS;

EID: 0030164596     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03356751     Document Type: Article
Times cited : (7)

References (23)
  • 1
    • 84976766536 scopus 로고
    • Scanning polyhedra with DO loops. in ACM, editor
    • June
    • C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops. In ACM, editor, PPPP 91, ACM SIGPLAN, pp. 39-50 (June 1991).
    • (1991) PPPP 91, ACM SIGPLAN , pp. 39-50
    • Ancourt, C.1    Irigoin, F.2
  • 3
    • 84935531789 scopus 로고
    • Unimodularity considered non-essential
    • L. Bouge, M.Cosnard, Y. Robert, and D. Trystram, (eds.), LNCS 634. Springer-Verlag
    • M. Barnett and C. Lengauer, Unimodularity considered non-essential. In L. Bouge, M.Cosnard, Y. Robert, and D. Trystram, (eds.), CONPAR 92-VAPP V, LNCS 634. Springer-Verlag, pp. 659-664 (1992).
    • (1992) CONPAR 92-VAPP v , pp. 659-664
    • Barnett, M.1    Lengauer, C.2
  • 5
    • 85027405036 scopus 로고
    • Fast and efficient generation of loop bounds
    • September
    • Z. Chamski, Fast and efficient generation of loop bounds. ParCo93, pp. 265-272 (September 1993).
    • (1993) ParCo93 , pp. 265-272
    • Chamski, Z.1
  • 6
    • 0027960048 scopus 로고
    • Nested loop sequences: Towards efficient loop structures in automatic parallelization
    • IEEE, January Also available as Technical Report IRISA PI-772
    • Z. Chamski, Nested loop sequences: Towards efficient loop structures in automatic parallelization. 27th Hawaii Int'l. Co/, on System Sciences, Vol. II: Software Technology, pp. 14-22. IEEE, (January 1994). Also available as Technical Report IRISA PI-772.
    • (1994) 27th Hawaii Int'l. Co/, on System Sciences, Vol. II: Software Technology , pp. 14-22
    • Chamski, Z.1
  • 8
    • 33750571578 scopus 로고
    • Code generation in automatic parallelizers
    • LIPCNRS-ENS LYON, July
    • J. F. Collard, Code generation in automatic parallelizers. Technical Report 93-21, LIPCNRS-ENS LYON, (July 1993).
    • (1993) Technical Report 93-21
    • Collard, J.F.1
  • 9
    • 0040942198 scopus 로고
    • Construction of DO loops from systems of affine constraints
    • Technical Report 93-15, LIP-CNRS-ENS LYON, May To appear in
    • J. F. Collard, P. Feautrier, and T. Risset, Construction of DO loops from systems of affine constraints. Technical Report 93-15, LIP-CNRS-ENS LYON, (May 1993). (To appear in Parallel Processing Letters.)
    • (1993) Parallel Processing Letters
    • Collard, J.F.1    Feautrier, P.2    Risset, T.3
  • 10
    • 33750546171 scopus 로고
    • Code generation for multiple mappings
    • Department Computer Science, University of Maryland July
    • W. Kelly, W. Pugh, and E. Rosser, Code generation for multiple mappings. Technical Report CS-TR-3317, Department Computer Science, University of Maryland (July 1994).
    • (1994) Technical Report CS-TR-3317
    • Kelly, W.1    Pugh, W.2    Rosser, E.3
  • 13
    • 0028062532 scopus 로고
    • Estimation of nested loop execution time by integer arithmetics in convex polyhedra
    • April
    • N. Tawbi, Estimation of nested loop execution time by integer arithmetics in convex polyhedra, Proc. of the 1994 Int'l. Parallel Processing Symp. (April 1994).
    • (1994) Proc. of the 1994 Int'l. Parallel Processing Symp
    • Tawbi, N.1
  • 14
    • 85033047126 scopus 로고    scopus 로고
    • Counting solutions to presburger formulas: How and why. Department of Computer Science. Technical Report CS-TR-3234, University of Maryland, March 1994. This paper will appear in the
    • W. Pugh, Counting solutions to presburger formulas: How and why. Department of Computer Science. Technical Report CS-TR-3234, University of Maryland, March 1994. This paper will appear in the Proc. of the 1994 ACM SIGPLAN Con/, on Programming Language Design and Implementation.
    • Proc. of the 1994 ACM SIGPLAN Con/, on Programming Language Design and Implementation.
    • Pugh, W.1
  • 18
    • 85050195224 scopus 로고
    • Automatic task graph generation techniques
    • H. El-Rewini and B. D. Shriver, (eds.), IEEE Computer Society Press, January (To appear in Parallel Processing Letters.)
    • M. Cosnard and M. Loi, Automatic task graph generation techniques. In H. El-Rewini and B. D. Shriver, (eds.), 28th Hawaii Int'l. Conf. on System Sciences, Vol. II: Software Technology, pp. 113-122. IEEE Computer Society Press, (January 1995). (To appear in Parallel Processing Letters.)
    • (1995) 28th Hawaii Int'l. Conf. on System Sciences, Vol. II: Software Technology , pp. 113-122
    • Cosnard, M.1    Loi, M.2
  • 19
    • 84976676720 scopus 로고
    • The Omega test: A fast and practical integer programming algorithm for dependence analysis
    • August
    • W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis. Comm. ACM 8:102-114 (August 1992).
    • (1992) Comm. ACM , vol.8 , pp. 102-114
    • Pugh, W.1
  • 21
    • 0001023389 scopus 로고
    • Parametric integer programming
    • September
    • P. Feautrier, Parametric integer programming. RAIRO Recherche Operationelle, 22:243-268 (September 1988).
    • (1988) RAIRO Recherche Operationelle , vol.22 , pp. 243-268
    • Feautrier, P.1


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