### Table VI. Comparing Sequential Optimization Under Delay Replaceability with Purely Combinational Optimizationa With Delay Replacement Pure Combinational Optimization Ratios

in Microsoft

### TABLE III: Results from mapping to a richer technology library

1998

Cited by 4

### Table 2: Different mapping configurations used Mapping Number of Mapping

"... In PAGE 3: ... Figure 3 shows the communication between different processes. Table2 lists the seven different mappings we have evaluated from one to four processor configurations. 5.... In PAGE 3: ... However, it comes at the cost of extra energy consumption and may not be suitable for mo- bile devices due to their high energy consumption. Here, we present a case study for selecting optimal configuration in this performance-energy tradeoff amongst the different con- figurations and mappings listed in Table2 . We studied the six process MPEG-2 decoder process network model over varying number of processors and various mappings for their performance as well as energy consumption.... ..."

### Table 2: Different mapping configurations used Mapping Number of Mapping

"... In PAGE 3: ... Figure 3 shows the communication between different processes. Table2 lists the seven different mappings we have evaluated from one to four processor configurations. 5.... In PAGE 3: ... However, it comes at the cost of extra energy consumption and may not be suitable for mo- bile devices due to their high energy consumption. Here, we present a case study for selecting optimal configuration in this performance-energy tradeoff amongst the different con- figurations and mappings listed in Table2 . We studied the six process MPEG-2 decoder process network model over varying number of processors and various mappings for their performance as well as energy consumption.... ..."

### Table 1 Means, number and standard deviations of final marks for each institution by map-drawing strategy, totals and missing maps

"... In PAGE 4: ...0 for each institution. Table1 shows means, Ns, and standard deviations as a total for each institution, and also divided according to map-drawing strategies of landmark, route and survey. 3.... ..."

### Table 3: Mapping Results for the Mixed Mapping Method

2002

"... In PAGE 4: ... To reduce the size of the BDD representing the characteristic function and hence the resulting mapped netlist, the mixed map- ping method was also implemented where a group is formed for the output vertices and they are positioned in the overall BDD so as to minimize the total node count. Table3 contains the BDD size and netlist component count when this method is used. In the next set of results shown in Table 4, the technique for minimizing the sum of the switching probabilities (assuming sta- tistical independence and equally likely switching of the input variables) was used as a cost function for minimizing the BDD representing the characteristic function.... ..."

Cited by 1

### Table 3: Mapping Results for the Mixed Mapping Method

"... In PAGE 4: ... To reduce the size of the BDD representing the characteristic function and hence the resulting mapped netlist, the mixed map- ping method was also implemented where a group is formed for the output vertices and they are positioned in the overall BDD so as to minimize the total node count. Table3 contains the BDD size and netlist component count when this method is used. In the next set of results shown in Table 4, the technique for minimizing the sum of the switching probabilities (assuming sta- tistical independence and equally likely switching of the input variables) was used as a cost function for minimizing the BDD representing the characteristic function.... ..."

### Table 3: Mapping Results for the Mixed Mapping Method

"... In PAGE 4: ... To reduce the size of the BDD representing the characteristic function and hence the resulting mapped netlist, the mixed map- ping method was also implemented where a group is formed for the output vertices and they are positioned in the overall BDD so as to minimize the total node count. Table3 contains the BDD size and netlist component count when this method is used. In the next set of results shown in Table 4, the technique for minimizing the sum of the switching probabilities (assuming sta- tistical independence and equally likely switching of the input variables) was used as a cost function for minimizing the BDD representing the characteristic function.... ..."