### Table 18: Performance of generalized searching for various assignments of edge criticality.

2005

"... In PAGE 125: ...6.5 Edge criticality and searching with weights In Table18 we give some statistics of the performance of generalized searching in topologies with clusters.... In PAGE 126: ... The relative weight that a node assigns to its incident edges depends on the number of shortest-hop paths that use these edges. Assuming that r is this ratio, then, in Table18 , we experiment with different assignments of the weights that are proportional to various powers of that ratio ri. By increasing the power i, we increase the priority we give to the critical edges, and, as indicated in the table, the performance of searching increases.... ..."

### Table 1. Effectiveness of via minimization

"... In PAGE 4: ... The initial layer file which serves as an initial solution to our SA implementation contains the layer assignment for the wires in the original layout. Table1 shows the effectiveness of the SA algorithm. The second column gives the number of wire segments in a circuit.... ..."

### Table 2a. Number of iterations for degradation matrix (ii) with L = 2 and x l1l2 = y l1l2 = 0:1.

"... In PAGE 16: ... Table2 b. Number of iterations for degradation matrix (ii) with L = 2 and x l1l2 = y l1l2 = 0:2.... In PAGE 16: ... Number of iterations for degradation matrix (ii) with L = 2 and x l1l2 = y l1l2 = 0:2. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 12 18 21 20 43 51 42 94 117 64 11 17 21 18 42 50 38 102 127 128 11 17 20 17 41 48 39 101 123 256 11 17 20 17 41 48 37 103 124 Table2 c. Number of iterations for degradation matrix (ii) with L = 2 and x l1l2 = y l1l2 = 0:3.... ..."

### Table 3a. Number of iterations for degradation matrix (i) with L = 4 and x l1l2 = y l1l2 = 0:1.

"... In PAGE 17: ... Table3 b. Number of iterations for degradation matrix (i) with L = 4 and x l1l2 = y l1l2 = 0:2.... In PAGE 17: ... Number of iterations for degradation matrix (i) with L = 4 and x l1l2 = y l1l2 = 0:2. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 9 27 35 16 57 69 31 115 135 64 9 29 35 15 67 81 31 159 161 128 8 26 34 15 67 83 31 172 181 256 8 25 33 14 61 83 30 170 211 Table3 c. Number of iterations for degradation matrix (i) with L = 4 and x l1l2 = y l1l2 = 0:3.... ..."

### Table 4a. Number of iterations for degradation matrix (ii) with L = 4 and x l1l2 = y l1l2 = 0:1.

"... In PAGE 18: ... Table4 b. Number of iterations for degradation matrix (ii) with L = 4 and x l1l2 = y l1l2 = 0:2.... In PAGE 18: ... Number of iterations for degradation matrix (ii) with L = 4 and x l1l2 = y l1l2 = 0:2. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 9 27 35 16 49 68 31 98 134 64 9 29 35 15 64 81 31 142 162 128 8 25 34 14 63 84 30 160 181 256 8 25 33 14 59 84 29 169 211 Table4 c. Number of iterations for degradation matrix (ii) with L = 4 and x l1l2 = y l1l2 = 0:3.... ..."

### Table 2: Baseline results showing the number of instructions simulated, L1 data cache miss rate, percent of executed instructions that were loads and stores, the IPC for each program, and the percent of cycles the bus was busy from the L1 to L2, and the bus from L2 to main memory was busy. parser and wupwise were also fast forwarded by 2, 2.9, 10.7 and 2.5 billion instructions respectively. These fast forward numbers were derived using the SimPoint tool [41]. Results for health are provided for comparison purposes as this is a popular benchmark in prefetching studies. It is not intended to reflect the true merits of our prefetching architecture. More detailed analysis of the pointer behavior (pointer variability and fan-out) for these programs can be found in [36].

2003

"... In PAGE 15: ...0 operating system using full compiler optimization (-O4 -ifo). Table2 shows the number of instructions simulated, L1 data cache miss rate, percent of executed instructions that were loads and stores, the IPC for each program, and the percent of cycles the bus from the L1 to L2, and the bus from the L2 to main memory were busy (occupied).... ..."

Cited by 4

### Table 1a: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:1.

"... In PAGE 15: ...Table 1a: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:1. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 9 17 20 13 40 48 24 95 120 64 9 16 20 13 39 48 21 99 122 128 8 16 19 12 39 47 23 99 121 256 8 16 20 11 39 48 21 100 122 Table1 b: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:2. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 12 18 21 20 42 50 42 95 117 64 11 17 20 18 42 49 38 102 126 128 11 17 20 18 41 48 39 101 123 256 11 17 20 17 41 48 37 102 124 Table 1c.... In PAGE 15: ... 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 9 17 20 13 40 48 24 95 120 64 9 16 20 13 39 48 21 99 122 128 8 16 19 12 39 47 23 99 121 256 8 16 20 11 39 48 21 100 122 Table 1b: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:2. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 12 18 21 20 42 50 42 95 117 64 11 17 20 18 42 49 38 102 126 128 11 17 20 18 41 48 39 101 123 256 11 17 20 17 41 48 37 102 124 Table1 c. Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:3.... ..."

### Table 1c. Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:3.

"... In PAGE 15: ... Also the convergence rate is independent of M for xed or x;y l1l2. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 6 16 19 8 38 47 12 95 122 64 6 16 19 8 38 46 11 97 121 128 6 15 19 7 37 47 12 97 121 256 6 15 19 7 38 47 10 98 121 Table1 a: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:1. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 9 17 20 13 40 48 24 95 120 64 9 16 20 13 39 48 21 99 122 128 8 16 19 12 39 47 23 99 121 256 8 16 20 11 39 48 21 100 122 Table 1b: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:2.... In PAGE 15: ... 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 6 16 19 8 38 47 12 95 122 64 6 16 19 8 38 46 11 97 121 128 6 15 19 7 37 47 12 97 121 256 6 15 19 7 38 47 10 98 121 Table 1a: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:1. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 9 17 20 13 40 48 24 95 120 64 9 16 20 13 39 48 21 99 122 128 8 16 19 12 39 47 23 99 121 256 8 16 20 11 39 48 21 100 122 Table1 b: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:2.... ..."

### Table 1b: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:2.

"... In PAGE 15: ... Also the convergence rate is independent of M for xed or x;y l1l2. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 6 16 19 8 38 47 12 95 122 64 6 16 19 8 38 46 11 97 121 128 6 15 19 7 37 47 12 97 121 256 6 15 19 7 38 47 10 98 121 Table1 a: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:1.... In PAGE 15: ...Table 1b: Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:2. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 12 18 21 20 42 50 42 95 117 64 11 17 20 18 42 49 38 102 126 128 11 17 20 18 41 48 39 101 123 256 11 17 20 17 41 48 37 102 124 Table1 c. Number of iterations for degradation matrix (i) with L = 2 and x l1l2 = y l1l2 = 0:3.... ..."

### Table 2c. Number of iterations for degradation matrix (ii) with L = 2 and x l1l2 = y l1l2 = 0:3.

"... In PAGE 16: ...2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 6 16 21 8 39 48 12 95 121 64 6 16 21 8 38 47 11 99 122 128 6 15 20 7 38 46 12 97 121 256 6 15 20 7 38 47 10 98 122 Table2 a. Number of iterations for degradation matrix (ii) with L = 2 and x l1l2 = y l1l2 = 0:1.... In PAGE 16: ... Number of iterations for degradation matrix (ii) with L = 2 and x l1l2 = y l1l2 = 0:1. 2 102 2 103 2 104 M cos cir no cos cir no cos cir no 32 9 17 20 13 40 49 24 96 120 64 9 17 20 13 40 48 21 100 122 128 8 16 20 12 39 47 23 99 121 256 8 16 20 11 39 48 21 99 122 Table2 b. Number of iterations for degradation matrix (ii) with L = 2 and x... ..."