메뉴 건너뛰기




Volumn 1300 LNCS, Issue , 1997, Pages 285-293

Handling memory cache policy with integer points countings

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84882729664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002746     Document Type: Conference Paper
Times cited : (10)

References (16)
  • 1
    • 0029373981 scopus 로고
    • Automatic partitioning of parallel loops and data arrays for distributed shared-memory multiprocessors
    • Sept.
    • A. Agarwal, D.A. Kranz and V. Natarajan. Automatic Partitioning of Parallel Loops and Data Arrays for Distributed Shared-Memory Multiprocessors. IEEE Trans, on Parall, and Distrib. Syst., Vol. 6, NO. 9, Sept. 1995.
    • (1995) IEEE Trans, on Parall, and Distrib. Syst. , vol.6 , Issue.9
    • Agarwal, A.1    Kranz, D.A.2    Natarajan, V.3
  • 2
    • 2542428530 scopus 로고    scopus 로고
    • An efficient allocation strategy for mapping affine recurrences into space and time optimal regular processor arrays
    • C. Jesshope, V. Jossifov and W. Wilhelmi editors Potsdam, Germany, Sept. 1994, Akademie Verlag
    • Ph. Clauss: An efficient allocation strategy for mapping affine recurrences into space and time optimal regular processor arrays. In C. Jesshope, V. Jossifov and W. Wilhelmi editors, Int. Conf. PARCELLA'94, pages 257-266, Potsdam, Germany, Sept. 1994, Akademie Verlag. http://icps.u-strasbg. fr/pub-94/pub-94-15.ps.Z
    • Int. Conf. PARCELLA'94 , pp. 257-266
    • Clauss, Ph.1
  • 3
    • 0029717349 scopus 로고    scopus 로고
    • Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs
    • Philadelphia, May Also available as Research Report ICPS 96-03
    • Ph. Clauss: Counting Solutions to Linear and Nonlinear Constraints through Ehrhart polynomials: Applications to Analyze and Transform Scientific Programs. 10th ACM Int. Conf. on Supercomputing, Philadelphia, May 1996. Also available as Research Report ICPS 96-03. http://icps.u-strasbg.fr/pub-96/pub-96- 03.ps.gz
    • (1996) 10th ACM Int. Conf. on Supercomputing
    • Clauss, Ph.1
  • 4
    • 0029754522 scopus 로고    scopus 로고
    • Parametric analysis of polyhedral iteration spaces
    • Chicago, Illinois, August Also available as Research Report ICPS 96-04
    • Ph. Clauss and V. Loechner: Parametric Analysis of Polyhedral Iteration Spaces. IEEE Int. Conf. on Application Specific Array Processors, ASAP'96, Chicago, Illinois, August 1996. Also available as Research Report ICPS 96-04. http://icps.u-strasbg.fr/pub-96/pub-96-04.ps.gz
    • (1996) IEEE Int. Conf. on Application Specific Array Processors, ASAP'96
    • Clauss, Ph.1    Loechner, V.2
  • 5
    • 84882607503 scopus 로고    scopus 로고
    • Parametric analysis of polyhedral iteration spaces (extended version)
    • To appear Kluwer Academic Pub.
    • Ph. Clauss and V. Loechner: Parametric Analysis of Polyhedral Iteration Spaces (extended version). To appear in Journal of VLSI Signal Processing, Kluwer Academic Pub., 1997.
    • (1997) Journal of VLSI Signal Processing
    • Clauss, Ph.1    Loechner, V.2
  • 6
    • 0028565287 scopus 로고    scopus 로고
    • Optimal mapping of systolic algorithms by regular instruction shifts
    • San Francisco, California, IEEE Computer Society Press
    • Ph. Clauss and G.-R. Perrin: Optimal mapping of systolic algorithms by regular instruction shifts. Int. Conf. on Application-Specific Array Processors, ASAP'94, pages 224-235, San Francisco, California, IEEE Computer Society Press. http://icps.u-strasbg.fr/pub-94/pub-94-08.ps.Z
    • Int. Conf. on Application-Specific Array Processors, ASAP'94 , pp. 224-235
    • Clauss, Ph.1    Perrin, G.-R.2
  • 7
    • 4344650688 scopus 로고
    • Polynômes arithmétiques et Méthode des Polyèdres en Combinatoire
    • Birkhauser Verlag, Basel/Stuttgart
    • E. Ehrhart: Polynômes arithmétiques et Méthode des Polyèdres en Combinatoire. International Series of Numerical Mathematics, Vol.35, Birkhauser Verlag, Basel/Stuttgart, 1977.
    • (1977) International Series of Numerical Mathematics , vol.35
    • Ehrhart, E.1
  • 9
    • 84882585096 scopus 로고    scopus 로고
    • Probabilistic memory disambiguation and its application to data speculation
    • D.-C. R. Ju, J.-F. Collard and K. Oukbir: Probabilistic Memory Disambiguation and its Application to Data Speculation. Research Report PRiSM 96-010, 1996. ftp://ftp.prism.uvsq.fr/pub/reports/1996/1996.010.ps.gz
    • (1996) Research Report PRiSM 96-010
    • Ju, D.-C.R.1    Collard, J.-F.2    Oukbir, K.3
  • 12
    • 84882605073 scopus 로고
    • Compiler optimizations for cache locality and coherence
    • Department of Computer Science, April
    • W. Li: Compiler Optimizations for Cache Locality and Coherence. Technical report 504, University of Rochester, Department of Computer Science, April 1994.
    • (1994) Technical Report 504, University of Rochester
    • Li, W.1
  • 13
    • 84882711223 scopus 로고    scopus 로고
    • Parameterized polyhedra and their vertices
    • V. Loechner and D. K. Wilde: Parameterized polyhedra and their vertices. Research Report ICPS 96-09, 1996. http://icps.u-strasbg.fr/pub-96/pub-96-09.ps. gz
    • (1996) Research Report ICPS 96-09
    • Loechner, V.1    Wilde, D.K.2
  • 14
    • 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. Communications of the ACM, 8:102-114, August 1992.
    • (1992) Communications of the ACM , vol.8 , pp. 102-114
    • Pugh, W.1


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