A certain algorithm may be parallelized onto a cluster of N nodes such that each node in the cluster operates on 1/Nth the total data, but must also exchange its results with the (N-1) other nodes in the network.

Create a tab labeled analysis. On the spreadsheet, compute the total time and speedups for each configuration. Assume that communications can be done completely in parallel with the processors execution. Use the 1 node system as a reference for 1x speedup. Copy your results here.

Number of Nodes	1	2	4	8	16	32
Total Time
Speedup

Create a chart that shows the number of nodes on the x-axis, and the speedup on the y axis. Include the chart here.