Sharing analysis of arrays, collections, and recursive structures

Precise modeling of the program heap is fundamental for understanding the behavior of a program, and is thus of signiflcant interest for many optimization applications. One of the fundamental properties of the heap that can be used in a range of optimization techniques is the sharing relationships between the elements in an array or collection. If an analysis can determine that the memory locations pointed to by different entries of an array (or collection) are disjoint, then in many cases loops that traverse the array can be vectorized or transformed into a thread-parallel versión. This paper introduces several novel sharing properties over the concrete heap and corresponding abstractions to represent them. In conjunction with an existing shape analysis technique, these abstractions allow us to precisely resolve the sharing relations in a wide range of heap structures (arrays, collections, recursive data structures, composite heap structures) in a computationally efflcient manner. The effectiveness of the approach is evaluated on a set of challenge problems from the JOlden and SPECjvm98 suites. Sharing information obtained from the analysis is used to achieve substantial thread-level parallel speedups.

A technique for recursive invariance detection and selective program specialization

This paper presents a technique for achieving a class of optimizations related to the reduction of checks within cycles. The technique uses both Program Transformation and Abstract Interpretation. After a ñrst pass of an abstract interpreter which detects simple invariants, program transformation is used to build a hypothetical situation that simpliñes some predicates that should be executed within the cycle. This transformation implements the heuristic hypothesis that once conditional tests hold they may continué doing so recursively. Specialized versions of predicates are generated to detect and exploit those cases in which the invariance may hold. Abstract interpretation is then used again to verify the truth of such hypotheses and conñrm the proposed simpliñcation. This allows optimizations that go beyond those possible with only one pass of the abstract interpreter over the original program, as is normally the case. It also allows selective program specialization using a standard abstract interpreter not speciñcally designed for this purpose, thus simplifying the design of this already complex module of the compiler. In the paper, a class of programs amenable to such optimization is presented, along with some examples and an evaluation of the proposed techniques in some application áreas such as floundering detection and reducing run-time tests in automatic logic program parallelization. The analysis of the examples presented has been performed automatically by an implementation of the technique using existing abstract interpretation and program transformation tools.

Optimization of water procurement decisions in an irrigation district: the role of option contracts

Water supply instability is one of the main risks faced by irrigation districts and farmers. Water procurement decision optimisation is essential in order to increase supply reliability and reduce costs. Water markets, such as spot purchases or water supply option contracts, can make this decision process more flexible. We analyse the potential interest in an option contract for an irrigation district that has access to several water sources. We apply a stochastic recursive mathematical programming model to simulate the water procurement decisions of an irrigation district?s board operating in a context of water supply uncertainty in south-eastern Spain. We analyse what role different option contracts could play in securing its water supply. Results suggest that the irrigation district would be willing to accept the proposed option contract in most cases subject to realistic values of the option contract financial terms. Of nine different water sources, desalination and the option contract are the main substitutes, where the use of either depends on the contract parameters. The contract premium and optioned volume are the variables that have a greater impact on the irrigation district?s decisions. Key words: Segura Basin, stochastic recursive programming, water markets, water supply option contract, water supply risk.