Research Article

Efficient Parallel Sorting for Migrating Birds Optimization When Solving Machine-Part Cell Formation Problems

Table 19

Result of merge sort.

Threads Execution time (ms) Cycle Time cycle (ms)
BET AVG ST BC AVG SD BTC AVG SD

Without threads 153.9667 171.1556 21.1539 3.1667 9.0778 4.7263 13.6778 43.3778 23.8747
1 155.5556 168.4111 13.9276 3.0222 9.0778 4.7812 13.2333 42.6556 22.9180
4 153.9333 170.9556 28.8802 2.8556 9.1556 4.9501 12.1444 43.7333 25.6019
8 152.7333 155.8667 3.8451 2.9667 9.2778 4.8785 12.2111 40.2333 20.2717
16 153.1333 161.8222 11.5292 2.9222 9.1222 4.9112 12.2444 40.9000 21.5416
32 153.9222 169.5000 21.8506 3.1889 9.2000 4.8937 13.5667 43.6333 24.7712

Minimum 152.7333 155.8667 3.8451 2.8556 9.0778 4.7263 12.1444 40.2333 20.2717
Maximum 155.5556 171.1556 28.8802 3.1889 9.2778 4.9501 13.6778 43.7333 25.6019