Since its inception as a student project in 2001, initially just for the handling (as the name implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved …
C Ancourt, F Irigoin - Proceedings of the third ACM SIGPLAN symposium …, 1991 - dl.acm.org
Supercompilers perform complex program transformations which often result in new loop bounds. This paper shows that, under the usual assumptions in automatic parallelization …
SP Amarasinghe, MS Lam - Proceedings of the ACM SIGPLAN 1993 …, 1993 - dl.acm.org
This paper presents several algorithms to solve code generation and optimization problems specific to machines with distributed address spaces. Given a description of how the …
The widespread use of object-oriented languages and Internet security concerns are just the beginning. Add embedded systems, multiple memory banks, highly pipelined units …
Data-flow analysis of scalar variables and data dependence analysis on array elements are two important program analyses used in optimizing and parallelizing compilers. Traditional …
Researchers have identified a core set of program transformations that are effective in array- based loop nest optimization: these loop transformations include interchange, skewing …
Abstract High Performance Fortran (hpf) was developed to support data parallel programming for simd and mimd machines with distributed memory. The programmer is …
High Performance Fortran (HPF) was developed to support data parallel programming for single‐instruction multiple‐data (SIMD) and multiple‐instruction multiple‐data (MIMD) …
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission-critical systems. For such …