Results 1 - 10
of
16,786
Table 1: Cases for the worst-case delay
1996
"... In PAGE 11: ...From #2811#29 wehave that the service rate r k #28t#29 is time dependent. Hence, in order to use #2814#29, wehave to examine the three cases described in Table1 . For ease of notation, in the following we will drop the index k.... ..."
Cited by 7
Table 1. Worst-case delay versus request
"... In PAGE 3: ... Since the oldest request is followed by the most number of requests colliding with the new re- quest, the delay for the new request to wait for entering the pipeline is maximized. Table1 shows the average delay and the maximum delay for the worst cases. The burst length2 of requests varies from 1 to 40.... In PAGE 3: ... The burst length2 of requests varies from 1 to 40. According to Table1 , the worst-case maximum request delay is 94 clock cycles. Con- sidering that the minimum delay for a request is 20, we can conclude that, the delay for passing CAMP varies from 20 to 94 clock cycles under a traffic of 0.... ..."
Table 9: Worst-case delays with all combinations of input offsets.
1998
Cited by 25
Table 9: Worst-case delays with all combinations of input offsets.
1998
Cited by 25
Table 2: Voltage configurations for worst-case delay
2003
Cited by 7
Table 2: Voltage configurations for worst-case delay
2003
Cited by 7
Table 2: Voltage configurations for worst-case delay
2003
Cited by 7
Table 4.4: Worst-case critical path delay.
1996
Cited by 2
Table 2: Pruned worst-case vectors for circuit of Figure 2
"... In PAGE 6: ... In such cases the pruning algorithm has determined there are no MIS vectors that will delay the output because there are no transistors in series. The complete set of vectors for the falling output for the example gate of Figure 2 are shown in Table2 . This gate (a + bc) is in row 5 of Table 1.... ..."
Results 1 - 10
of
16,786