---
_id: '1794'
abstract:
- lang: eng
  text: Demands for computational power and energy efficiency of computing devices
    are steadily increasing. At the same time, following classic methods to increase
    speed and reduce energy consumption of these devices becomes increasingly difficult,
    bringing alternative methods into focus. One of these methods is approximate computing
    which utilizes the fact that small errors in computations are acceptable in many
    applications in order to allow acceleration of these computations or to increase
    energy efficiency. This thesis develops elements of a workflow that can be followed
    to apply approximate computing to existing applications. It proposes a novel heuristic
    approach to the localization of code paths that are suitable to approximate computing
    based on findings in recent research. Additionally, an approach to identification
    of approximable instructions within these code paths is proposed and used to implement
    simulation of approximation. The parts of the workflow are implemented with the
    goal to lay the foundation for a partly automated toolflow. Evaluation of the
    developed techniques shows that the proposed methods can help providing a convenient
    workflow, facilitating the first steps into the application of approximate computing.
author:
- first_name: Michael
  full_name: Lass, Michael
  id: '24135'
  last_name: Lass
  orcid: 0000-0002-5708-7632
citation:
  ama: 'Lass M. <i>Localization and Analysis of Code Paths Suitable for Acceleration
    Using Approximate Computing</i>. Paderborn: Paderborn University; 2015.'
  apa: 'Lass, M. (2015). <i>Localization and Analysis of Code Paths Suitable for Acceleration
    using Approximate Computing</i>. Paderborn: Paderborn University.'
  bibtex: '@book{Lass_2015, place={Paderborn}, title={Localization and Analysis of
    Code Paths Suitable for Acceleration using Approximate Computing}, publisher={Paderborn
    University}, author={Lass, Michael}, year={2015} }'
  chicago: 'Lass, Michael. <i>Localization and Analysis of Code Paths Suitable for
    Acceleration Using Approximate Computing</i>. Paderborn: Paderborn University,
    2015.'
  ieee: 'M. Lass, <i>Localization and Analysis of Code Paths Suitable for Acceleration
    using Approximate Computing</i>. Paderborn: Paderborn University, 2015.'
  mla: Lass, Michael. <i>Localization and Analysis of Code Paths Suitable for Acceleration
    Using Approximate Computing</i>. Paderborn University, 2015.
  short: M. Lass, Localization and Analysis of Code Paths Suitable for Acceleration
    Using Approximate Computing, Paderborn University, Paderborn, 2015.
date_created: 2018-03-26T15:24:10Z
date_updated: 2022-01-06T06:53:23Z
department:
- _id: '27'
- _id: '518'
place: Paderborn
publisher: Paderborn University
status: public
supervisor:
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
title: Localization and Analysis of Code Paths Suitable for Acceleration using Approximate
  Computing
type: mastersthesis
user_id: '24135'
year: '2015'
...