Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
Introducing symbolic problem solving techniques in the dependence testing phases of a vectorizer
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Dependence of multi-dimensional array references
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Efficient and exact data dependence analysis
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
On the perfect accuracy of an approximate subscript analysis test
ICS '90 Proceedings of the 4th international conference on Supercomputing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Constant propagation with conditional branches
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Dependence Analysis for Supercomputing
Dependence Analysis for Supercomputing
The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization
IEEE Transactions on Parallel and Distributed Systems
Speedup of ordinary programs
Optimizing supercompilers for supercomputers
Optimizing supercompilers for supercomputers
Exact side effects for interprocedural dependence analysis
ICS '93 Proceedings of the 7th international conference on Supercomputing
A New Approach to Parallelization of Serial Nested Loops Using Genetic Algorithms
The Journal of Supercomputing
A New Genetic Algorithm for Loop Tiling
The Journal of Supercomputing
Proceedings of the 20th annual international conference on Supercomputing
Parallel loop generation and scheduling
The Journal of Supercomputing
| Hi-index | 0.00 |
With the development of ever more sophisticated data flow analysis algorithms, traditional data dependence tests based on elementary loop information will not be sufficient in the future. In this paper, quite general algorithms are presented for solving integer linear programming problems. While the properly so called problem solution is performed by a standard algorithm (the dual all integer algorithm), preliminary problem reduction techniques not only serve as a powerful tool for preparing this latter step, but also are often sufficient for solving exactly the data dependence problem.