Results 1 - 10
of
9,953
Table 2: Master-Slave Implementations 14
"... In PAGE 15: ... In order not to overload the exposition, we have condensed the results into four tables. The rst one, Table2 , summarizes the results obtained by the two master- slave parallelization strategies (1-RS SPSS and 1-KS SPSS), while the three last,... In PAGE 17: ... Furthermore, the availability of several processors, permits at each iteration to evaluate all moves (no sampling). This is re ected into the general gain in solution quality apparent in Table2 and Figure 2. Of course, this also implies that the search trajectory is di erent from the sequential one and it is thus to be expected that in a few cases one cannot improve on it.... ..."
Table 1. Veri cation Statistics for Master-Slave Design
"... In PAGE 11: ... In order to compare our decompositional algorithms with monolithic algo- rithms, we did the veri cation checks both decompositionally and monolithically. In Table1 , read(M) corresponds to the veri cation check on the master-slave design and the monolithic automaton for the read SRTD while read(C) corre- sponds to the veri cation check done on the master-slave design and automata for a single waveform. The numbers in Table 1 for BDD size, space and time for the decompositional check is the average over the individual veri cation checks... In PAGE 11: ... In Table 1, read(M) corresponds to the veri cation check on the master-slave design and the monolithic automaton for the read SRTD while read(C) corre- sponds to the veri cation check done on the master-slave design and automata for a single waveform. The numbers in Table1 for BDD size, space and time for the decompositional check is the average over the individual veri cation checks... ..."
Table 1. Veri cation Statistics for Master-Slave Design
"... In PAGE 12: ...veri cation check done on the master-slave design and automata for a single waveform. The numbers in Table1 for BDD size, space and time for the decom- positional check is the average over the individual veri cation checks for each waveform. For example, the total amount of time taken to verify the read SRTD decompositionally was 3.... ..."
Table 1 - Traffic conditions for master-slave links
"... In PAGE 4: ... In Figure 5 the performance of BCSS over round robin becomes more evident. We also consider the scenario of Figure 3 with d=10m for different traffic conditions in the i-th master and slave link (Mi-Si), as shown in Table1 . The results are shown in Figure 6.... ..."
Table 8: Message types for master-slave application.
Table 8: Message types for master-slave application.
Table 1. Characteristics of the Master and Slave Nodes
2007
Cited by 2
Results 1 - 10
of
9,953