Problem
Describe an algorithm using odd. multiply, and data-routing operations to compute the expression s =A1 x8, A2 82 f A32 x 832 with minimum time in each of the following two computer systems. It is assumed that add and multiply require two and four time units. respectively. The time required for instruction/data fetches from memory and decoding delays are ignored. k1 instructions and data are assumed already loaded into the relevant PEs. Determine the minimum compute time in each case.
(a) A serial computer with a processor equipped with one adder and one multiplier, only one of which can be used at a time. No data-routing operation is needed in this uniprocessor machine.
(b) An SIND computer with eight PEs (PE3, PEI. .... PEI), which are connected by a bidirectional circular ring. Each PE can directly mute its data to its neighbors In one time unit. The operands A, and B, are initially stored in PE,d8 for i = 1. 2, 32. Each PE can odd or multiply at different times.