Table 7 Running time of RefSelect using parallel processing
From: RefSelect: a reference sequence selection algorithm for planted (l, d) motif search
t | Number of threads | |||
|---|---|---|---|---|
1 | 2 | 4 | 8 | |
200 | 7.3 s | 4.4 s | 2.4 s | 1.5 s |
400 | 28.7 s | 17.1 s | 9.3 s | 4.9 s |
600 | 66.8 s | 37.7 s | 20.5 s | 10.6 s |
800 | 127.9 s | 67.3 s | 38.0 s | 21.1 s |
1000 | 204.4 s | 106.7 s | 59.5 s | 34.0 s |
1200 | 295.1 s | 154.4 s | 84.3 s | 49.7 s |
1400 | 401.7 s | 211.9 s | 118.0 s | 68.9 s |
1600 | 524.0 s | 277.1 s | 160.1 s | 92.3 s |