### Table 4. Algorithm schedule.

"... In PAGE 37: ...Table4 consistently yielded fast placement and routing of netlists with complexity levels varying from a few gates to thousands of gates. Table 4.... In PAGE 46: ... Through experimentation, I found several schedules resulting in fast and efficient placement and routing of a wide variety of circuit sizes (up to 2000 gates). Figure 7 illustrates the routing iterations of a 100-gate synthetic circuit with 230 wires on a 30x30 Cell Matrix with a 3 percent bad cell rate using the schedule in Table4 . plots the percentage of routed wires as a function of iteration number averaged over ten runs, with netlists and bad cell maps of similar complexities generated randomly for each run.... ..."

### Table I. Comparison of scheduling algorithms Scheduler

in DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems

1997

Cited by 12

### Table 3. Simulation Results of Integrating Two Simple Heuristics

in Simple and Integrated Heuristic Algorithms for Scheduling Tasks with Time and Resource Constraints

1987

Cited by 21

### Table 1{Performance bounds for zero propagation delay algorithms Class of Scheduling Range of Property P3 Property P2 Property P1 Algorithms Throughput k N k

1997

"... In PAGE 13: ...3 For gt; 12, S 6, and n 3, no scheduling algorithm in the class CONTIN- UOUS STATIC has any property P1{P4. Table1 summarizes the throughput and delay characteristics of the scheduling algorithms pre- sented in this and the previous section. The last three columns list the upper bounds for k N k,... ..."

Cited by 45

### Table 1: Adaptive Scheduling Algorithms.

2000

Cited by 64

### Table 1: Adaptive Scheduling Algorithms.

2000

Cited by 64

### Table 2: Notations for the scheduling algorithm

2006

"... In PAGE 5: ...y Iyengar et al. [19]. Figure 7 shows the pseudo-code for the proposed test scheduling algorithm. In Table2 we have collected explanations of some of the notations that are used in the algorithm description. The main idea of the heuristic is to select a core and a TAM such that we will get best fit to the current schedule.... ..."

Cited by 3

### Table 2: Notations for the scheduling algorithm

2006

"... In PAGE 5: ...y Iyengar et al. [19]. Figure 7 shows the pseudo-code for the proposed test scheduling algorithm. In Table2 we have collected explanations of some of the notations that are used in the algorithm description. The main idea of the heuristic is to select a core and a TAM such that we will get best fit to the current schedule.... ..."

Cited by 3

### Table 2. The NSC scheduling algorithm.

"... In PAGE 3: ... 2 Progressive Sampling with NSC NSC follows a general progressive sampling algorithm as described in Table 1. It rst de nes a sampling schedule based on a small geometric factor and on the complexity of the inductive algorithm (see Table2 ). NSC continues taking sam- ples according to the sampling schedule until it detects convergence (described in Section 2.... In PAGE 5: ...1. That is: SNSC = 1:1i n0 = fn0; 1:1 n0; 1:12 n0; 1:13 n0; : : :g (see Table2 ). This is more aggressive than arithmetic sampling but more con- servative than a geometric sampling with a geometric factor of 2.... ..."

### Table 2. Complexity of the Scheduling Algorithm.

2005

"... In PAGE 3: ... The last one is RLS filter [8] which is the only benchmark using DIV operations. Complexity of the scheduling algorithm is summarized in Table2 where n is the number of tasks and m denotes the number of dedicated processors (arithmetic units). The column size denotes number of ILP variables/constraints.... In PAGE 3: ... The time required to compute the opti- mum, given as a sum of iterative calls of the ILP solver, is shown in the column CPU time. As follows from Table2 , the optimal solution for all benchmarks were found by GLPK solver in a reasonable... ..."

Cited by 1