MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Metastability-Containing Circuits, Parallel Distance Problems, and Terrain Guarding

Stephan Friedrichs
Max-Planck-Institut für Informatik - D1
Promotionskolloquium
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI  
Public Audience
English

Date, Time and Location

Monday, 11 September 2017
15:30
60 Minutes
E1 4
024
Saarbrücken

Abstract

We study three problems. The first is the phenomenon of metastability in digital circuits. This is a state of bistable storage elements, such as registers, that is neither logical 0 nor 1 and breaks the abstraction of Boolean logic. We propose a time- and value-discrete model for metastability in digital circuits and show that it reflects relevant physical properties. Further, we propose the fundamentally new approach of using logical masking to perform meaningful computations despite the presence of metastable upsets and analyze what functions can be computed in our model. Additionally, we show that circuits with masking registers grow computationally more powerful with each available clock cycle.


The second topic are parallel algorithms, based on an algebraic abstraction of the Moore-Bellman-Ford algorithm, for solving various distance problems. Our focus are distance approximations that obey the triangle inequality while at the same time achieving polylogarithmic depth and low work.

Finally, we study the continuous Terrain Guarding Problem. We show that it has a rational discretization with a quadratic number of guard
candidates, establish its membership in NP and the existence of a PTAS, and present an efficient implementation of a solver.

Contact

Stephan Friedrichs
--email hidden
passcode not visible
logged in users only

Stephan Friedrichs, 08/29/2017 11:17 -- Created document.