-- Mar 23 In-Class Exercise

1. 20 rounds of map-reduce to simulate 10 steps of PRAM of 2 rounds (since one processor executes one step with 2 map-reduce rounds)
2. Store accumulated values of a processor in certain registers exclusively accessible for read to it 
3. Store procId in acc k for that processor
4. Each processor has a separate acc for PC, and so processes different instructions

<pre> 1. 20 rounds of map-reduce to simulate 10 steps of PRAM of 2 rounds (since one processor executes one step with 2 map-reduce rounds) 2. Store accumulated values of a processor in certain registers exclusively accessible for read to it 3. Store procId in acc k for that processor 4. Each processor has a separate acc for PC, and so processes different instructions </pre>

-- Mar 23 In-Class Exercise

# There will be 2 rounds (1 map, 1 reduce) per step of PRAM computation. Therefore, 20 map-reduce rounds will be required to simulate a PRAM computation. # We can reserve a specific unique subset of registers for a given processor such that only that processor can access those registers. These registers will simulate accumulators. # A reducer can write the processor id to an accumulator. # No. In a given timestep t, different processors might not necessarily execute the same instruction because depending on the data, different processors might go down different paths in the execution flow.

-- Mar 23 In-Class Exercise

1. Every step has 2 map reduce rounds, so we would require overall 20 map reduce rounds for 10 PRAM. 2. We can reserve specific group of registers for specific storing certain values which could be used to simulate accumulators 3. A reducer can write a processor id k into an accumulator. 4. All processors might not perform the same instruction at a given timestamp.

-- Mar 23 In-Class Exercise

1. We need 20 map reduce rounds for 10 step PRAM computation as every computation requires 2 map reduce rounds. 2. A few registers can be reserved to be used only by certain processors. 3. LoadProcid k will store the processor id in accumulator k. 4. In a given timestep t, all PRAM processors will not be doing the same instruction. They can execute different ones.

-- Mar 23 In-Class Exercise

1. 20 rounds of map-reduce to simulate 10 steps of PRAM of 2 rounds (since one processor executes one step with 2 map-reduce rounds) 2. Store accumulated values of a processor in certain registers exclusively accessible for read to it 3. Store procId in acc k for that processor 4. Each processor has a separate acc for PC, and so processes different instructions

-- Mar 23 In-Class Exercise

1. As every step of the PRAM computation requires 2 Map-Reduce rounds, the total map reduce rounds needed is 10*2 = 20. 2. We may reserve registers to simulate the function of accumulators. 3. LoadProcid will store the current process ID in an accumulator (in this case, a register) k. 4. At a given timestep t, not all PRAM processors will be executing the same instruction as processors can conditionally branch based on their processor ID.

-- Mar 23 In-Class Exercise

1. Each PRAM computation would take 2 map reduce rounds, and so for 10 step PRAM computation we will have 20 map reduce rounds. 2. Accumulators can be handled by using certain register to be only read by a particular processor and store any values of that processor within those registers. 3. LoadProcid will store the processor id in the accumulator. 4. No. In a given time step t, different processors might not doing the same instruction. Depending on the date, they could follow different paths during the execution flow.

-- Mar 23 In-Class Exercise

a.)There will be 2 rounds (1 map, 1 reduce) per step of PRAM computation. Therefore, 20 map-reduce rounds will be required to simulate a PRAM computation. b.)We may reserve registers to simulate the function of accumulators. c.)A reducer can write a processor id k into an accumulator. d.)No. In a given timestep t, different processors might not necessarily execute the same instruction because depending on the data, different processors might go down different paths in the execution flow.

-- Mar 23 In-Class Exercise

1) 20 Map-reduce rounds are required to simulate 10 step PRAM computation. 2) Reserve some registers exclusively for some processors which will use them as accumulators. 3)LoadProcid k will store the processor id in the accumulator reserved for the processor. 4) In a given timestep t, different PRAM processors will be working on different instructions based on the processor id.

-- Mar 23 In-Class Exercise

1. For every PRAM, there are 2 rounds (1 map and 1 reduce). since it is a 10-step PRAM computation 20 map-reduce rounds are required. 2.Reserving registers specific to processors will simulate the function of accumulators 3. LoadProcId k will load the current processor id in accumulator k. 4. At a given timestamp t, all processors might not necessarily be in sync. Since there are different accumulators(acc) used for storing the program counters(PC) of each of the processors they will be executing independently.