Campus Event Calendar

Event Entry

What and Who

Metastability-Containing Sorting Networks

Johannes Bund
Fachrichtung Informatik - Saarbrücken
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI  
AG Audience

Date, Time and Location

Wednesday, 23 November 2016
30 Minutes
E1 4


The talk is about my contribution to the paper "Near-Optimal Metastability-Containing Sorting Networks" by Bund, Lenzen and Medina.

Metastability-Containing sorting networks serve as a central building block in fault-tolerant clock-synchronization algorithms on chip.

In this paper we designed and analyzed, both theoretically and via simulations, a metadtability-containing sorting network.

Informally, a metastable-containing combinational circuit is a circuit that can handle metastable inputs and still produces meaningful outputs.

My thesis deals with the implementation of the circuit, testing it and
comparing it with similar circuits.
I clarify how requiring metastability containment affects the design process of a microchip.
As we go along we find a way to transform a "theoretical" circuit to a netlist of real hardware cells.


Moti Medina
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Bachelor’s Thesis presentation
Supervised by Matthias Függer and Moti Medina

Moti Medina, 11/16/2016 15:57
Moti Medina, 11/15/2016 13:01
Moti Medina, 11/14/2016 16:14
Moti Medina, 11/14/2016 12:47 -- Created document.