### TABLE III HEURISTIC DISTRIBUTED ALGORITHM

Cited by 1

### TABLE I: Distribution of algorithms within IQRouting

2005

Cited by 6

### Table 1: Compressing an Arbitrary Distributed Algorithm

1990

"... In PAGE 23: ... We also ran P2 on CCC(2) and the compressed version of P2 on CCC(1). Table1 shows the execution times in seconds and the resulting overhead for di erent x and y. One can see that the overhead is even better than the optimal load factor for the corresponding embedding (i.... ..."

Cited by 4

### TABLE III Architecture generation and gain distribution algorithms

in Exploration-based High-Level Synthesis of Linear Analog Systems Operating at Low/Medium Frequencies

### TABLE II THE DISTRIBUTED ALGORITHM RUNNING AT EACH NODE

### Table 1 Distributions for matrix algorithms Distribution De nition overlap

"... In PAGE 7: ... The subalgebra of matrix distributions is composed of the distributions (given by prim- itive covers) and the operations de ned in Tables 1 and 2, respectively. Table1 de- nes covers for row block and column block, diagonal, trigonal and tiled matrices. As stated in De nition 2.... In PAGE 7: ... The operations basically have the functionality (Matrix[ ] ! Bag[Matrix[ ]]) ! (Matrix[ ] ! Bag[Matrix[ ]]) in this case. The column entitled \overlap quot; in Table1 speci es whether there are overlapping parts or whether the covers are composed of disjoint parts only.... ..."

### Table 12: Distributed Algorithms Speedups - No Swapping Uniform Mesh

"... In PAGE 23: ....3.2 Distributed Algorithm Performance - No Swapping In general, the results of the runs agree favorably with the predicted performance on a machine where swapping does not occur. Table12 summarizes the speedups for the uniform and non-uniform meshes. For the uniform mesh, the results are very consistent.... ..."

### Table 8: The effect of weight distribution on Algorithm B and the Babel Al- gorithm

2007

"... In PAGE 18: ... A great variety of investigations are possible into the relationship between weight distribution and the difference in performance between these two algorithm, so we cannot be expansive here. Table8 , how- ever, gives a taste of such an investigation. It shows the performance of each algorithm on graphs with vertex weights drawn from the discrete uniform distributions on the intervals listed.... ..."

Cited by 2

### Table 2: The Optimum Results and the Solutions Given by the Distributed Algorithms. Variables

2005

"... In PAGE 7: ... Session Source Node Sink Node Links on the Path f0 A B 0 f1 B C 1 f2 A C 0, 1 To investigate the performance of the proposed algorithm, we compare the globally optimum solutions solved by Mat- lab, the solutions given by the dual-based algorithm, and the solutions given by the primal-based algorithm. The re- sults are presented in Table2 . The comparisons show that both algorithms converge to the optimum accurately.... ..."

Cited by 21