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 in the spreadsheet labeled Compute Time. On that sheet calculate the following items, assuming the processor requires 30 instructions to operate on each byte of its portion of the data, and 2 instructions to transmit each byte of data to each other node. Copy the results to this worksheet. Assume perfect cache behavior.

Number of Nodes	1	2	4	8	16	32
Average instructions per second
	1.00E+09
Instructions to process share of data
Instructions to send data to 1 other node	N/A
Instructions to send data to all other nodes	N/A
Total instruction time

Create a chart that shows the number of nodes on the x-axis, and the compute time on the y axis and include the chart here.