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. a. (5 Points) Assuming a data set size of 2MB (2x220 bytes), a communications latency of 90ns and a network throughput of 125x10 bytes per second to each node (note that this is not the same as 125x230 bytes/sec), complete the following table. 1 2 4 8 16 32 Number of Nodes Data operated on by Node Data received from other nodes Transmission time (bytes/throughput) Total Communication Time (latency & transmission) 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. a. (5 Points) Assuming a data set size of 2MB (2x220 bytes), a communications latency of 90ns and a network throughput of 125x10 bytes per second to each node (note that this is not the same as 125x230 bytes/sec), complete the following table. 1 2 4 8 16 32 Number of Nodes Data operated on by Node Data received from other nodes Transmission time (bytes/throughput) Total Communication Time (latency & transmission)