### Table I. Comparison of the different ray partitioning schemes.

### Table 2. Experimental results for one design with different number of partitioning schemes

"... In PAGE 9: ...partitioning schemes. In Table2 , four different number of partitioning schemes have been given to the optimization algorithm for the same design consisting of 6 cores. The optimal solution is the same in the three cases where the total number of partitioning schemes is 7, 10, and 15, respectively.... In PAGE 9: ... In the case that the number of partitioning schemes is only 5, the total test time of the obtained solution is larger than those in the other three cases. This experiment shows that, for this design, the best solution does not correspond to the partitioning scheme found among the five alternative partitioning schemes, as indicated in the first line in Table2 . If we introduce 2 additional alternative partitioning schemes (see line 2 in Table 2), a better solution is found.... ..."

Cited by 2

### Table 2. Experimental results for one design with different number of partitioning schemes

"... In PAGE 8: ... Experimental results for 5 different designs Number of Cores Total Number of Partitioning Schemes Problem Size Total Test Times (# of clock cycles) CPU Times (ms) 4 7 28 2775 2141 12 8 96 8306 35359 24 20 400 9789 47500 36 20 720 10017 120219 48 20 960 10941 881766 We also did experiments to see how the optimization result is impacted by the given total number of partitioning schemes. In Table2 , four different number of partitioning schemes have been given to the optimization algorithm for the same design consisting of 6 cores. The optimal solution is the same in the three cases where the total number of partitioning schemes is 7, 10, and 15, respectively.... In PAGE 8: ... In the case that the number of partitioning schemes is only 5, the total test time of the obtained solution is larger than those in the other three cases. This experiment shows that, for this design, the best solution does not correspond to the partitioning scheme found among the five alternative partitioning schemes, as indicated in the first line in Table2 . If we introduce 2 additional alternative partitioning schemes (see line 2 in Table 2), a better solution is found.... ..."

Cited by 2

### Table 2: Types of Partitioning Schemes Possible with different Types of Methods Method

### Table 8. Asymptotic elapsed time for different partitioning schemes.

"... In PAGE 8: ... 6. Performance improvement Table8 depicts the asymptotic elapsed times for MIN simulation. The comparisons show that by transforming the MIN into a more modular equivalent interconnection, the message transit time can be significantly reduced.... ..."

### Table 5.1: Chunk Sizes of Different Scheduling Schemes Scheme Change of chunk size with time Static 80 - - - - - - - - -

### Table 1: Properties of different schemes

1999

"... In PAGE 5: ...to perform a35a36a25a38a37a39a29 exponentiations for each group change, and messages get prohibitively large. As summarized in Table1 , most existing protocols for secure multicasting are limited to distribute session keys in static and/or small groups. For dealing with the group key distribution in a large group with frequent membership changes, some good explorations have been done in [Mit97, STW97].... ..."

Cited by 66

### Table 1: Properties of different schemes

"... In PAGE 5: ...to perform O(n) exponentiations for each group change, and messages get prohibitively large. As summarized in Table1 , most existing protocols for secure multicasting are limited to distribute session keys in static and/or small groups. For dealing with the group key distribution in a large group with frequent membership changes, some good explorations have been done in [Mit97, STW97].... ..."

### Table 1: Properties of different schemes

"... In PAGE 5: ...to perform O(n) exponentiations for each group change, and messages get prohibitively large. As summarized in Table1 , most existing protocols for secure multicasting are limited to distribute session keys in static and/or small groups. For dealing with the group key distribution in a large group with frequent membership changes, some good explorations have been done in [Mit97, STW97].... ..."

### Table 2. Cost of the resulting partition for different configurations.

"... In PAGE 15: ...) First, we searched for the best configuration with a deterministic initial partition. The results are summa- rized in Table2 . Each column of the table corresponds to a configuration of a gain function, tie-breaking strategy and locking scheme: e.... ..."