TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 21302

Approximate Systems

( Jul 25 – Jul 30, 2021 )

(Click in the middle of the image to enlarge)

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/21302

Organizers

Contact



Motivation

Resource efficiency is becoming an increasingly important challenge, especially due to the pervasiveness of computing systems and the diminishing returns from performance improvements of process technology scaling. At the same time, many important applications have nondeterministic specifications or are robust to noise in their execution. They thus do not necessarily require fully reliable computing systems and their resource consumption can be reduced by introducing or exposing approximations. While trading correctness for efficiency has been part of computing systems since the early days, it has seen renewed interest in the past decade. Different techniques have been since developed for applying and controlling approximations and the errors they introduce at different levels of the compute stack. Unfortunately, most of these techniques have been applied in isolation, making simplified assumptions about the other levels. It is thus unclear how all the different techniques interact, combine and complement or negate each other to provide end-to-end application benefits. Future work is needed to investigate error-efficient or approximate computing approaches systematically and holistically across all layers of the compute stack and for complete end-to-end system design examples. This Dagstuhl Seminar aims to bring together researchers from the different domains working on approximate computing, algorithms, programming languages, compilers, architecture and circuits, in order to explore open challenges and opportunities and to define cross-area research directions relating to an end-to-end application of approximate computing principles across the compute stack. The seminar will be structured around four application areas and application examples in embedded sensing and computation, robotics and control, scientific computing, and machine learning, which will serve as the focal points of discussions.

Copyright Eva Darulova, Babak Falsafi, Andreas Gerstlauer, and Phillip Stanley-Marbell

Summary

Resource efficiency is becoming an increasingly important challenge, especially due to the pervasiveness of computing systems and the diminishing returns from performance improvements of process technology scaling. At the same time, many important applications have nondeterministic specifications or are robust to noise in their execution. They thus do not necessarily require fully reliable computing systems and their resource consumption can be reduced by introducing or exposing approximations.

While trading correctness for efficiency has been part of computing systems since the early days, it has seen renewed interest in the past decade. Different techniques have been since developed for applying and controlling approximations and the errors they introduce at different levels of the compute stack. Unfortunately, most of these techniques have been applied in isolation, making simplified assumptions about the other levels. It is thus unclear how all the different techniques interact, combine and complement or negate each other to provide end-to-end application benefits.

The aim of this seminar was to bring together researchers from different domains working on approximate computing, algorithms, programming languages, compilers, architecture and circuits, in order to explore open challenges and opportunities and to define cross-area research directions and collaborations relating to an end-to-end application of approximate computing principles across the compute stack.

The seminar consisted of brief presentations by a subset of the participants that covered the entire computing stack from hardware to applications, and that focused on the current challenges. The talks were followed by discussions in breakout groups that first focused on the different application areas of high-performance computing, embedded systems and deep learning, followed by group discussions on particular fundamental and cross-cutting challenges that were identified during the first breakout session. This report includes the abstracts of the participant's presentations as well as summaries of the breakout group discussions.

Copyright Eva Darulova, Babak Falsafi, Andreas Gerstlauer, and Phillip Stanley-Marbell

Participants
On-site
  • Hussam Amrouch (Universität Stuttgart, DE) [dblp]
  • David Atienza Alonso (EPFL - Lausanne, CH) [dblp]
  • Eric Atkinson (MIT - Cambridge, US)
  • Andreas Burg (EPFL - Lausanne, CH) [dblp]
  • Eva Darulova (MPI-SWS - Kaiserslautern, DE) [dblp]
  • Lara Dolecek (University of California at Los Angeles, US) [dblp]
  • Babak Falsafi (EPFL - Lausanne, CH) [dblp]
  • Djordje Jevdjic (National University of Singapore, SG) [dblp]
  • Debasmita Lohar (MPI-SWS - Saarbrücken, DE)
  • Jürgen Teich (Universität Erlangen-Nürnberg, DE) [dblp]
  • Damien Zufferey (MPI-SWS - Kaiserslautern, DE) [dblp]
Remote:
  • Sara Achour (Stanford University, US) [dblp]
  • R.Iris Bahar (Brown University - Providence, US) [dblp]
  • Swarnendu Biswas (Indian Institute of Technology Kanpur, IN) [dblp]
  • Peter Dueben (ECMWF - Reading, GB) [dblp]
  • Andreas Gerstlauer (University of Texas at Austin, US) [dblp]
  • Ghayoor Gillani (University of Twente, NL)
  • Jie Han (University of Alberta - Edmonton, CA) [dblp]
  • Anastasia Isychev (TU München, DE)
  • Vijay Janapa Reddi (Harvard University - Cambridge, US)
  • Gauri Joshi (Carnegie Mellon University - Pittsburgh, US) [dblp]
  • Ulrich Kremer (Rutgers University - Piscataway, US) [dblp]
  • Sasa Misailovic (University of Illinois - Urbana-Champaign, US) [dblp]
  • Laura Monroe (Los Alamos National Laboratory, US)
  • Sri Parameswaran (UNSW - Sydney, AU) [dblp]
  • Adrian Sampson (Cornell University - Ithaca, US) [dblp]
  • Olivier Sentieys (University & INRIA - Rennes, FR) [dblp]
  • Phillip Stanley-Marbell (University of Cambridge, GB)
  • Radha Venkatagiri (Oregon State University, US) [dblp]
  • Norbert Wehn (TU Kaiserslautern, DE) [dblp]
  • Georgios Zervakis (KIT - Karlsruher Institut für Technologie, DE)

Classification
  • hardware
  • programming languages / compiler

Keywords
  • approximate computing
  • energy-efficient computing
  • pareto optimization