12 research outputs found

    Mapping Deviation: A Technique to Adapt or to Guard Loop Transformation Intuitions for Legality

    Get PDF
    International audienceParallel architectures are now omnipresent in mainstream electronic devices and exploiting them efficiently is a challenge for all developers. Hence, they need the support of languages, libraries and tools to assist them in the optimization or parallelization task. Compilers can provide a major help by automating this work. However they are very fragile black-boxes. A compiler may take a bad optimization decision because of imprecise heuristics or may turn off an optimization because of imprecise analyses, without providing much control or feedback to the end user. To address this issue, we introduce mapping deviation, a new compiler technique that aims at providing a useful feedback on the semantics of a given program restructuring. Starting from a transformation intuition a user or a compiler wants to apply, our algorithm studies its cor-rectness and can suggest changes or conditions to make it possible rather than being limited to the classical go/no-go answer. This algorithm builds on state-of-the-art polyhedral representation of programs and provides a high flexibility. We present two example applications of this technique: improving semi-automatic optimization tools for programmers and automatically designing runtime tests to check the correctness of a transformation for compilers

    Data-Flow/Dependence Profiling for Structured Transformations

    Get PDF
    International audienceProfiling feedback is an important technique used by developers for performance debugging, where it is usually used to pinpoint performance bottlenecks and also to find optimization opportunities. Assessing the validity and potential benefit of a program transformation requires accurate knowledge of the data flow and dependencies, which can be uncovered by profiling a particular execution of the program. In this work we develop poly-prof, an end-to-end infrastructure for dynamic binary analysis, which produces feedback about the potential to apply complex program rescheduling. Our tool can handle both inter-and intraproce-dural aspects of the program in a unified way, thus providing interprocedural transformation feedback

    Recent dielectronic recombination experiments

    Get PDF
    New recombination experiments with merged cold beams of electrons and atomic ions have been carried out at the storage ring facilities TSR in Heidelberg, ESR in Darmstadt, and CRYRING in Stockholm. A brief overview is given on the recent activities in which the Giessen group was engaged. Topics of this research were dielectronic recombination (DR) of astrophysically relevant ions, recombination of highly charged ions with respect to cooling losses in storage rings, field effects on DR, search for interference effects in photorecombination of ions, correlation effects in DR of low-Z ions, spectroscopy of high-Z ions by DR, and lifetimes of metastable states deduced from DR experiments
    corecore