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.

Assuming a data set size of 2MiB (2x220 bytes), a communications latency of 90ns and a network throughput of 125x106 bytes per second to each node (note that this is not the same as 125x230 bytes/sec), create a spreadsheet tab labeled Communication Time. On that tab, compute the information below and copy the results into this worksheet. Number of Nodes 1 2 4 8 16 32 Data operated on by Node (bytes) Data received from other nodes (bytes) Reception time in seconds (bytes received/throughput) Total Communication Time (latency + reception)

Number of Nodes	1	2	4	8	16	32
Data operated on by Node (bytes)
Data received from other nodes (bytes)
Reception time in seconds (bytes received/throughput)
Total Communication Time (latency + reception)

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