### Table 3. Load balance

"... In PAGE 10: ... In Figure 8, some of the multithreading bottlenecks described in section 3 begin to be apparent. The load balance is accounted for in Table3 . For d = 3; 4 The load balance is quite good.... ..."

### Table 1. Load Balancing

"... In PAGE 6: ... The proposed LB algorithm is an efficient on-line heuristic for our schedul- ing problem. In contrast to LS, its strategy is to assign jobs to the regular machines if their loads are not greater than some flexible bound, and to the fast machine, otherwise (see Table1 ). The bound depends on the length of the previously processed jobs and it is reestablished after receiving each new job for an assignment.... ..."

### Table 3: Load Balance Indexes

1995

"... In PAGE 13: ... Table3 presents the load balance indexes of different data partitioning algorithms. The load balance index is calculated as #28maxn i=1 computation time of processor i#29 #02 #28number of processors n#29 P n i=1 computation time of processor i Neither BLOCK nor CYCLIC distributions consider computation load of each element when distributing data arrays over processors, and hence both cause severe load imbalance.... ..."

Cited by 47

### Table 3: Load balance results.

2002

"... In PAGE 12: ... Thus, the closer is this factor to 1, the better is the load balance. Table3 shows the load balance factors. Compared with the 2D block-cyclic mapping, the proportional mapping algorithm usually improves load balance, with very few exceptions.... ..."

Cited by 4

### Table 3: Load Balance Indexes

"... In PAGE 13: ... Both distributions exploit the locality of data accesses, and hence have lower communication costs. Load Balance Table3 presents the load balance indexes of different data partitioning algorithms. The load balance index (LBI) is calculated as LBI = (maxn i=1 computation time of processor i) (number of processors n) Pn i=1 computation time of processor i Both BLOCK and CYCLIC distributions do not consider computation load of each element when dis- tributing data arrays over processors, and hence both cause severe load imbalance.... ..."

### Table 3: Load Balance Indexes

"... In PAGE 13: ... Table3 presents the load balance indexes of different data partitioning algorithms. The load balance index is calculated as (maxn i=1 computation time of processor i) (number of processors n) Pn i=1 computation time of processor i Neither BLOCK nor CYCLIC distributions consider computation load of each element when distributing data arrays over processors, and hence both cause severe load imbalance.... ..."

### Table 4: The Quality of Load Balancing

"... In PAGE 10: ... Thus, we normalize the cost by the size of the live memory at the end of the collection cycle. Table4 presents our load balancing results for pBOB, running without CPU idle time (idle time would decrease contention for work packets and improve load balancing). We used a 1.... ..."

### Table 1: The Load Balancing algorithm.

1995

"... In PAGE 7: ... 3.3 The Load Balancing algorithm Table1 summarizes the previous algorithms, offering a complete view of the Load Balancing algorithm. The algorithm may be activated periodically or at exception by threshold crossing events related to network usage.... In PAGE 8: ... Establishing HP routes A centralized algorithm for establishing HP routes between all source-destination pairs of a directed graph is presented in this section. This algorithm is used by Load Balancing for grading the VPCs out of each node (see Table1 ). The algorithm is based on the well-known shortest path algorithms of Dijkstra and Floyd [1].... In PAGE 8: ... For simplicity, the CoS dependency is dropped. Note, from Table1 , that the algorithm runs for each CoS separately; CoS multiplexing is taken into account while calculating the measures related to VPC and route potentialities. The essence of the algorithm is as follows: Starting from a given destination node, remote nodes are added according to their distance (in number of VPCs) from the destination node.... ..."

Cited by 3

### Table 3: Load Balance Indexes

"... In PAGE 13: ... Both distributions exploit the locality of data accesses, and hence have lower communication costs. Load Balance Table3 presents the load balance indexes of different data partitioning algorithms. The load balance index (LBI) is calculated as a220a16a221 a192 a183 a187 maxa222 a180a207a223 1 a224a94a225 a190 a204a10a226 a182a146a227a5a182 a202 a225a46a228 a182 a202 a190a105a229 a225 a209a100a204a10a230 a225a46a224 a229a102a231a41a231 a225 a230a69a202 a189 a197a28a187 a228 a226 a190a105a232a94a229 a230 a225 a209a100a204a74a230 a225a46a224 a229a41a231a102a231 a225 a230 a231 a228 a189 a233 a222 a180a111a223 1 a224a94a225 a190 a204a10a226 a182a142a227a49a182 a202 a225a87a228 a182 a202 a190a105a229 a225 a209a2a204a10a230 a225a46a224 a229a102a231a41a231 a225 a230a234a202 Both BLOCK and CYCLIC distributions do not consider computation load of each element when dis- tributing data arrays over processors, and hence both cause severe load imbalance.... ..."

### Table 1: Percentage load imbalance for successive iterations of the load balancer.

1998

"... In PAGE 12: ... The computational cost of the algorithm is low, and it can be parallelized easily. Table1 compares round-robin binning of tasks to our load balancer where 125 to 740 tasks are applied to 100 processors. There is a 300% di erence between the minimum and the maximum load, which is assigned randomly.... ..."

Cited by 247