Using the results in problems 1.6 and 1.10, show that an algorithm for an N-processor EREW SM SIMD computer requiring O(N) locations of shared memory and time T can be simulated on a cube-connected...

Using the results in problems 1.6 and 1.10, show that an algorithm for an N-processor EREW SM SIMD computer requiring O(N) locations of shared memory and time T can be simulated on a cube-connected network with the same number of processors in time T x 0(log2 N).