Research Article

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

Table 20

Result of quick sort.

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

Without threads 153.3333 163.0000 12.7284 2.9889 9.0111 4.9168 12.5222 41.2222 22.1071
1 154.5778 167.9000 15.5926 3.0889 9.0778 4.8703 13.1778 42.2667 22.3487
4 153.3111 163.6778 12.2109 3.1333 9.2000 4.9019 13.3222 41.7444 22.4733
8 169.2889 195.6667 26.3893 2.8667 9.1667 4.8796 13.5667 49.6556 27.5041
16 154.3444 169.7778 18.9543 2.8111 8.9889 4.7619 12.1333 42.2444 23.6231
32 156.0889 176.7222 25.8717 2.9889 9.1111 4.8993 13.4111 45.5889 25.9852

Minimum 153.3111 163.0000 12.2109 2.8111 8.9889 4.7619 12.1333 41.2222 22.1071
Maximum 169.2889 195.6667 26.3893 3.1333 9.2000 4.9168 13.5667 49.6556 27.5041