Presolving is a preprocessing step performed by optimisation solvers to improve performance. However, these solvers cannot easily exploit high-level model structure as available in modelling languages such as MiniZinc or Essence. We present an integrated approach that performs presolving as a separate pass during the compilation from high-level optimisation models to solverlevel programs. The compiler produces a representation of the model that is suitable for presolving by retaining some of the high-level structure. It then uses information learned during presolving to generate the final solver-level representation. Our approach introduces the novel concept of variable paths that identify variables which are common across multiple compilat...
Today's simulations are typically not a single application but cover an entire tool chain. There is...
The authors discuss the design of hypre, an object-oriented library for the solution of extremely la...
Many real-life problems can be tackled as Structured Mixed Integer Linear Programs(MILP). The workfl...
Presolving is a preprocessing step performed by optimisation solvers to improve performance. However...
We present a case study examining the creation of an efficient preconditioner for solution of incom...
Partial redundancy elimination (PRE) is one of the most widespread optimizations in compilers. Howev...
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--95-010) / BLDSC - Bri...
International audienceThis paper presents a technique for representing the high level semantics of p...
Abstract. Optimizations in a traditional compiler are applied sequentially, with each optimization d...
Partial redundancy elimination [10] (PRE) is a class of compiler optimizations that identifies and r...
This paper describes the design and implementation of an optimizing compiler that automatically gene...
Solving large sparse linear systems is a time-consuming step in basin modeling or reservoir simulati...
The solution of large and sparse linear systems is one of the main computational kernels in CFD appl...
Partial redundancy elimination (PRE) subsumes the classical optimizations of loop invariant movement...
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-pred...
Today's simulations are typically not a single application but cover an entire tool chain. There is...
The authors discuss the design of hypre, an object-oriented library for the solution of extremely la...
Many real-life problems can be tackled as Structured Mixed Integer Linear Programs(MILP). The workfl...
Presolving is a preprocessing step performed by optimisation solvers to improve performance. However...
We present a case study examining the creation of an efficient preconditioner for solution of incom...
Partial redundancy elimination (PRE) is one of the most widespread optimizations in compilers. Howev...
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--95-010) / BLDSC - Bri...
International audienceThis paper presents a technique for representing the high level semantics of p...
Abstract. Optimizations in a traditional compiler are applied sequentially, with each optimization d...
Partial redundancy elimination [10] (PRE) is a class of compiler optimizations that identifies and r...
This paper describes the design and implementation of an optimizing compiler that automatically gene...
Solving large sparse linear systems is a time-consuming step in basin modeling or reservoir simulati...
The solution of large and sparse linear systems is one of the main computational kernels in CFD appl...
Partial redundancy elimination (PRE) subsumes the classical optimizations of loop invariant movement...
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-pred...
Today's simulations are typically not a single application but cover an entire tool chain. There is...
The authors discuss the design of hypre, an object-oriented library for the solution of extremely la...
Many real-life problems can be tackled as Structured Mixed Integer Linear Programs(MILP). The workfl...