The Experts below are selected from a list of 123 Experts worldwide ranked by ideXlab platform

Tomas Lozanoperez - One of the best experts on this subject based on the ideXlab platform.

  • Optimization in the now dynamic Peephole Optimization for hierarchical planning
    International Conference on Robotics and Automation, 2013
    Co-Authors: Dylan Hadfieldmenell, Leslie Pack Kaelbling, Tomas Lozanoperez
    Abstract:

    For robots to effectively interact with the real world, they will need to perform complex tasks over long time horizons. This is a daunting challenge, but recent advances using hierarchical planning [1] have been able to provide leverage on this problem. Unfortunately, this approach makes no effort to account for the execution cost of an abstract plan and often arrives at poor quality plans. This paper outlines a method for dynamically improving a hierarchical plan during execution. We frame the underlying question as one of evaluating the resource needs of an abstract operator and propose a general way to approach estimating them. We ran experiments in challenging domains and observed up to 30% reduction in execution cost when compared with a standard hierarchical planner.

Dylan Hadfieldmenell - One of the best experts on this subject based on the ideXlab platform.

  • Optimization in the now dynamic Peephole Optimization for hierarchical planning
    International Conference on Robotics and Automation, 2013
    Co-Authors: Dylan Hadfieldmenell, Leslie Pack Kaelbling, Tomas Lozanoperez
    Abstract:

    For robots to effectively interact with the real world, they will need to perform complex tasks over long time horizons. This is a daunting challenge, but recent advances using hierarchical planning [1] have been able to provide leverage on this problem. Unfortunately, this approach makes no effort to account for the execution cost of an abstract plan and often arrives at poor quality plans. This paper outlines a method for dynamically improving a hierarchical plan during execution. We frame the underlying question as one of evaluating the resource needs of an abstract operator and propose a general way to approach estimating them. We ran experiments in challenging domains and observed up to 30% reduction in execution cost when compared with a standard hierarchical planner.

Erik Brunvand - One of the best experts on this subject based on the ideXlab platform.

  • Peephole Optimization of asynchronous macromodule networks
    IEEE Transactions on Very Large Scale Integration Systems, 1999
    Co-Authors: Ganesh Gopalakrishnan, Prabhakar Kudva, Erik Brunvand
    Abstract:

    Most high-level synthesis tools for asynchronous circuits take descriptions in concurrent hardware description languages and generate networks of macromodules or handshake components. In this paper, we propose a Peephole optimizer for these networks. Our Peephole optimizer first deduces an equivalent blackbox behavior for the network using Dill's trace-theoretic parallel composition operator. It then applies a new procedure called burst-mode reduction to obtain burst-mode machines from the deduced behavior. In a significant number of examples, our optimizer achieves gate-count improvements by a factor of five, and speed (cycle-time) improvements by a factor of two. Burst-mode reduction can be applied to any macromodule network that is delay insensitive as well as deterministic. A significant number of asynchronous circuits, especially those generated by asynchronous high-level synthesis tools, fall into this class, thus making our procedure widely applicable.

  • Peephole Optimization of asynchronous macromodule networks
    International Conference on Computer Design, 1994
    Co-Authors: Ganesh Gopalakrishnan, Prabhakar Kudva, Erik Brunvand
    Abstract:

    Most high level synthesis tools for asynchronous circuits take descriptions in concurrent hardware description languages and generate networks of macromodules or handshake components. In this paper we describe a Peephole optimizer for such macromodule networks that often effects area and/or time improvements. Our optimizer first deduces an equivalent black-box behavior for the given network of macromodules using Dill's trace-theoretic parallel composition operator. It then applies a new procedure called burst-mode reduction to obtain burst-mode machines, which can be synthesized into gate networks using available tools. Since burst-mode reduction can be applied to any macromodule network that is delay-insensitive as well as deterministic, our optimizer covers a significant number of asynchronous circuits, especially those generated by asynchronous high level synthesis tools. >

  • ICCD - Peephole Optimization of asynchronous macromodule networks
    Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1994
    Co-Authors: Ganesh Gopalakrishnan, Prabhakar Kudva, Erik Brunvand
    Abstract:

    Most high level synthesis tools for asynchronous circuits take descriptions in concurrent hardware description languages and generate networks of macromodules or handshake components. In this paper we describe a Peephole optimizer for such macromodule networks that often effects area and/or time improvements. Our optimizer first deduces an equivalent black-box behavior for the given network of macromodules using Dill's trace-theoretic parallel composition operator. It then applies a new procedure called burst-mode reduction to obtain burst-mode machines, which can be synthesized into gate networks using available tools. Since burst-mode reduction can be applied to any macromodule network that is delay-insensitive as well as deterministic, our optimizer covers a significant number of asynchronous circuits, especially those generated by asynchronous high level synthesis tools. >

Leslie Pack Kaelbling - One of the best experts on this subject based on the ideXlab platform.

  • Optimization in the now dynamic Peephole Optimization for hierarchical planning
    International Conference on Robotics and Automation, 2013
    Co-Authors: Dylan Hadfieldmenell, Leslie Pack Kaelbling, Tomas Lozanoperez
    Abstract:

    For robots to effectively interact with the real world, they will need to perform complex tasks over long time horizons. This is a daunting challenge, but recent advances using hierarchical planning [1] have been able to provide leverage on this problem. Unfortunately, this approach makes no effort to account for the execution cost of an abstract plan and often arrives at poor quality plans. This paper outlines a method for dynamically improving a hierarchical plan during execution. We frame the underlying question as one of evaluating the resource needs of an abstract operator and propose a general way to approach estimating them. We ran experiments in challenging domains and observed up to 30% reduction in execution cost when compared with a standard hierarchical planner.

  • ICRA - Optimization in the now: Dynamic Peephole Optimization for hierarchical planning
    2013 IEEE International Conference on Robotics and Automation, 2013
    Co-Authors: Dylan Hadfield-menell, Leslie Pack Kaelbling, Tomas Lozano-perez
    Abstract:

    For robots to effectively interact with the real world, they will need to perform complex tasks over long time horizons. This is a daunting challenge, but recent advances using hierarchical planning [1] have been able to provide leverage on this problem. Unfortunately, this approach makes no effort to account for the execution cost of an abstract plan and often arrives at poor quality plans. This paper outlines a method for dynamically improving a hierarchical plan during execution. We frame the underlying question as one of evaluating the resource needs of an abstract operator and propose a general way to approach estimating them. We ran experiments in challenging domains and observed up to 30% reduction in execution cost when compared with a standard hierarchical planner.

Nuno P Lopes - One of the best experts on this subject based on the ideXlab platform.

  • aliveinlean a verified llvm Peephole Optimization verifier
    Computer Aided Verification, 2019
    Co-Authors: Nuno P Lopes
    Abstract:

    Ensuring that compiler Optimizations are correct is important for the reliability of the entire software ecosystem, since all software is compiled. Alive [12] is a tool for verifying LLVM’s Peephole Optimizations. Since Alive was released, it has helped compiler developers proactively find dozens of bugs in LLVM, avoiding potentially hazardous miscompilations. Despite having verified many LLVM Optimizations so far, Alive is itself not verified, which has led to at least once declaring an Optimization correct when it was not.

  • CAV (2) - AliveInLean: A Verified LLVM Peephole Optimization Verifier.
    Computer Aided Verification, 2019
    Co-Authors: Nuno P Lopes
    Abstract:

    Ensuring that compiler Optimizations are correct is important for the reliability of the entire software ecosystem, since all software is compiled. Alive [12] is a tool for verifying LLVM’s Peephole Optimizations. Since Alive was released, it has helped compiler developers proactively find dozens of bugs in LLVM, avoiding potentially hazardous miscompilations. Despite having verified many LLVM Optimizations so far, Alive is itself not verified, which has led to at least once declaring an Optimization correct when it was not.