Why we go to Zero-Slack? doesn't that mean that Fmax is decreased which is not what I want, I want to run the circuit as fast as possible, someone please explain why we need zero slack ?
We go for 0 slack time, as there is some extra time wasted where we the value is arriving earlier(AAT), but the data can come even after some time(RAT), which means that the slack is positive. This positive slack has no benefit as there will be no setup violations, even when slack is zero. So, by increasing the actual arrival time, we can make slack=0 & this further decreases any hold violation at the output of the previous system, as the data can be delayed at that point.
zero slack algorithm example is not clear. can you please explain how each node [] changes in that specific example.
Shouldn't the RAT after the AND GATE with delay 3 be 7 because min{7,11} is 7?
Why we go to Zero-Slack? doesn't that mean that Fmax is decreased which is not what I want, I want to run the circuit as fast as possible, someone please explain why we need zero slack ?
i think its because that hold time is violated so he increased delay, i am not sure though
We go for 0 slack time, as there is some extra time wasted where we the value is arriving earlier(AAT), but the data can come even after some time(RAT), which means that the slack is positive. This positive slack has no benefit as there will be no setup violations, even when slack is zero. So, by increasing the actual arrival time, we can make slack=0 & this further decreases any hold violation at the output of the previous system, as the data can be delayed at that point.
At 10:22 - Slack = AAT -RAT