X - UWSpace - University of Waterloo

We dso anaiyzed the speed-ups and efficiencies for FP obtained from 1 to 4 processon
as show in Figures 5.6 and 5.7 respectively. Figure 5.6 shows that the parallel decomposition
algorithm can speed up the solution time for utilizing both simplex and barrier methods in a larger
FP model. With the two processors, Pu had the first pend's scenarios 1 to 3 and PL had 4 to 7.
With the three processors. FP was divided into 3 pans: Pu (scenarios 1 to 3). Pw (scenarios 4 and
5) and Pu (scenarios 6 and 7). Note that WrZTPAR cm also handle another aitemative of 3 parts.
PUL' . PuL and PL, by indicating the subpmblem type in each processor. Figure 5.6 shows that the
parallel decomposition algorithm c m speed up the solution time for utilizing both simplex and
bmier methods in a larger FP model. Figure 5.7 indicates that the parailel decomposition
algorithm for FP cm have efficiencies pater than 1 by using the simplex method but not for the
banier method.
12 -
Speedups for FP
Figure 5.7 Speedups for FP with Simplex and Barrier
105