Skip to main content

Table 2 Run Times for piES Algorithms.

From: Reverse engineering a gene network using an asynchronous parallel evolution strategy

Algorithm

Time (Good-enough)

Time (Good)

Relative Speed-up

Absolute Speed-up

Serial iES

    

- 1 island

3:35 (±0:54)

9.51 (±1:05)

-

-

Sync piES

    

- 10 nodes

0:56 (±0:07)

3:55 (±0:16)

8.7 (7.5-9.8)

3.8 (2.9-4.8)

- 20 nodes

0:41 (±0:03)

4:09 (±0:14)

14.9 (12.3-17.4)

5.2 (4.1-6.4)

- 50 nodes

0:33 (±0:03)

3:40 (±0:16)

29.2 (25.8-32.6)

6.5 (5.0-8.0)

Async piES

    

- 10 nodes

0:47 (±0:06)

3:34 (±0:11)

10.3 (9.0-11.7)

4.6 (3.5-5.6)

- 20 nodes

0:40 (±0:05)

3:44 (±0:13)

15.2 (12.4-18.1)

5.4 (4.1-6.7)

- 50 nodes

0:25 (±0:02)

3:23 (±0:12)

38.5 (34.2-42.8)

8.6 (6.7-10.5)

  1. The time taken to reach 'good-enough' and 'good solutions' for the optimal serial Island ES, and the two parallel piES algorithms, along with the relative and absolute speed-up for each parallel algorithm (comparison is between 'good-enough' solutions). Times are given in hours and minutes (H:M) and the values in parentheses are 95% confidence intervals.