Due to the corona pandemic, the course will take place „digitally“ or „online“ until further notice. Please register on StudOn (see below) and you will receive further information from us by email in due course.
Lecture, location, and time:
The first lecture will take place on Thursday 15.04.2021 at 14:15 hrs.
Exercises, location, and time:
The first exercise will take place on Tuesday 20.04.2021 at 10:15 hrs.
Course (slides, exercises, other files):
All important documents can be found in StudOn
Approximate Computing denotes a quite young research area that exploits the fact and capability of many applications and systems to tolerate imprecision and/or inexactness of computed results. Prominent areas of applications and novel techniques of computing approximate rather than exact results have brought up new implementations either at hardware and/or software levels for important emergent workloads such as searching, mining, image processing, and data retrieval.
Although hardware technology is improving at a fast pace, energy and power are becoming more and more important constraints apart from exactly computing results in an acceptable amount of time. The main goals of approximate computing techniques are therefore to exploit the possible trade-off between power/energy consumption, accuracy, performance, and/or cost, e.g., utilized hardware resources.
Course purpose:The purpose of the course approximate computing is to instruct students about the main ideas and concepts of approximate computing. This includes analyzing the trade-off between energy consumption, accuracy, run-time and hardware costs, concrete approximating techniques (e.g. approximate hardware synthesis, approximating algorithms) as well as theoretical background (determining the computational error and its complexity).
The following topics will be covered:
- Introduction to Approximate Computing
- Approximate Arithmetics
- Approximate Algorithms
Approximate computing is a lecture on a 4 SWS (4 hours/week) basis. Lecture and Exercises will give 5 ECTS.