Search Results for author: Michael F. P. O'Boyle

Found 6 papers, 3 papers with code

mlirSynth: Automatic, Retargetable Program Raising in Multi-Level IR using Program Synthesis

no code implementations6 Oct 2023 Alexander Brauckmann, Elizabeth Polgreen, Tobias Grosser, Michael F. P. O'Boyle

MLIR is an emerging compiler infrastructure for modern hardware, but existing programs cannot take advantage of MLIR's high-performance compilation if they are described in lower-level general purpose languages.

Program Synthesis

SLaDe: A Portable Small Language Model Decompiler for Optimized Assembly

no code implementations21 May 2023 Jordi Armengol-Estapé, Jackson Woodruff, Chris Cummins, Michael F. P. O'Boyle

SLaDe is up to 6 times more accurate than Ghidra, a state-of-the-art, industrial-strength decompiler and up to 4 times more accurate than the large language model ChatGPT and generates significantly more readable code than both.

Language Modelling Large Language Model

TASO: Time and Space Optimization for Memory-Constrained DNN Inference

no code implementations21 May 2020 Yuan Wen, Andrew Anderson, Valentin Radu, Michael F. P. O'Boyle, David Gregg

We optimize the trade-off between execution time and memory consumption by: 1) attempting to minimize execution time across the whole network by selecting data layouts and primitive operations to implement each layer; and 2) allocating an appropriate workspace that reflects the upper bound of memory footprint per layer.

Introducing SLAMBench, a performance and accuracy benchmarking methodology for SLAM

3 code implementations8 Oct 2014 Luigi Nardi, Bruno Bodin, M. Zeeshan Zia, John Mawer, Andy Nisbet, Paul H. J. Kelly, Andrew J. Davison, Mikel Luján, Michael F. P. O'Boyle, Graham Riley, Nigel Topham, Steve Furber

Real-time dense computer vision and SLAM offer great potential for a new level of scene modelling, tracking and real environmental interaction for many types of robot, but their high computational requirements mean that use on mass market embedded platforms is challenging.

Benchmarking

Cannot find the paper you are looking for? You can Submit a new open access paper.