3 ms·

Correct me if I'm wrong about this, but according to one of the author's cited references, the time needed for metastability to resolve is theoretically unbound

Correct me if I'm wrong about this, but according to one of the author's cited references, the time needed for metastability to resolve is theoretically unbounded. Why wouldn't every solution based on introducing a fixed delay amount to kicking the can down the road?

bsder 3y ago
Because the resolution is theoretically unbounded but decays exponentially if you don't do something stupid. Two flip-flops in series is almost always enough to resolve the uncertainty. However, I'm extremely skeptical of all the "metastability" fixes applied here. You only care about synchronizers when you change between unrelated clock domains. Yes, the PDP-11 is before the advent of widespread knowledge about metastability. However, open-collector busses were not unusual at the time. Glitches were also understood. You set your logic transitions to cross boxes of your Karnaugh map correctly to avoid them. None of the given circuits seem to fix that at first glance, but I'd need to look at it in more detail. I suspect the issue is that he is using flops instead of latches. Latches are level sensitive while flops are edge sensitive. A lot of open-collector arbitration is more of something gets yanked down, you see something got yanked down so you also yank something down (this need to happen fast and is in hardware), then you release something if you don't have anything to say (this can happen slowly in software since you already yanked things and locked it), after everybody but one releases the bus arbitration is over and the winner can now proceed to use the bus.
metaphor 3y ago
I understand it to be a matter of pragmatism over formalism, i.e. given an appropriate system, if you could probabilistically kick the can so far down the road that the chances of system failure become overwhelmingly dominated by factors other than metastability, is it still a real problem? I ask with an inpert mindset recognizing who you are.

bsder 3y ago

Because the resolution is theoretically unbounded but decays exponentially if you don't do something stupid. Two flip-flops in series is almost always enough to resolve the uncertainty. However, I'm extremely skeptical of all the "metastability" fixes applied here. You only care about synchronizers when you change between unrelated clock domains. Yes, the PDP-11 is before the advent of widespread knowledge about metastability. However, open-collector busses were not unusual at the time. Glitches were also understood. You set your logic transitions to cross boxes of your Karnaugh map correctly to avoid them. None of the given circuits seem to fix that at first glance, but I'd need to look at it in more detail. I suspect the issue is that he is using flops instead of latches. Latches are level sensitive while flops are edge sensitive. A lot of open-collector arbitration is more of something gets yanked down, you see something got yanked down so you also yank something down (this need to happen fast and is in hardware), then you release something if you don't have anything to say (this can happen slowly in software since you already yanked things and locked it), after everybody but one releases the bus arbitration is over and the winner can now proceed to use the bus.

metaphor 3y ago

I understand it to be a matter of pragmatism over formalism, i.e. given an appropriate system, if you could probabilistically kick the can so far down the road that the chances of system failure become overwhelmingly dominated by factors other than metastability, is it still a real problem? I ask with an inpert mindset recognizing who you are.