To help you get an idea of how your code is coming along, here are some timings of a parallelized version of the knapsack code which exhibits the general timings that we are looking for.
This also gives you a guideline for what your output should be like. These results are using the k2000.txt instance on Bassi. You can run this code on the lab machines using
mpirun -n 4 ~cs475/bin/knapsack09 k500.txt
as an example. The above would solve the k500.txt problem using 4 processors.
The number of objects is 2000, and the capacity is 4990781.
The optimal profit is 5171385 Time taken : 44.709715.
Processors 2:
The number of objects is 2000, and the capacity is 4990781.
The optimal profit is 5171385 Time taken : 23.881655.
Processors 3:
The number of objects is 2000, and the capacity is 4990781.
The optimal profit is 5171385 Time taken : 16.120273.
Processors 4:
The number of objects is 2000, and the capacity is 4990781.
The optimal profit is 5171385 Time taken : 12.186855.
Processors 5:
The number of objects is 2000, and the capacity is 4990781.
The optimal profit is 5171385 Time taken : 9.794671.
Processors 6:
The number of objects is 2000, and the capacity is 4990781.
The optimal profit is 5171385 Time taken : 8.187974.
Processors 7:
The number of objects is 2000, and the capacity is 4990781.
The optimal profit is 5171385 Time taken : 7.042283.
Processors 8:
The number of objects is 2000, and the capacity is 4990781.
The optimal profit is 5171385 Time taken : 6.187018.