$1.[2]$ Suppose we have an array of $1000$ integers. We want to find the minimum value of

these integers. We have four cores $($core $0,1,2,$ and $3).$ How to execute this on these cores

to get the best performance? Do not write code, just write steps, such that core $1$ will have

the final result.

$2.[8]$ In superscalar processors, we increase the number of execution units to be able to

execute several instructions at the same time. What modifications do we have to make for

the fetch, decode, issue and commit phases to get the best performance from superscalar?

$3.[8]$ Suppose we have a $32-$core processor. For each one of the following scenarios,

indicate the maximum number of threads that can be executed at the same time and explain

how you reached that number.

a$)$ Each core is neither pipelining nor superscalar nor hyperthreading

b$)$ Each core is neither superscalar nor hyperthreading but just pipelining

c$)$ Each core is superscalar but not hyperthreading

d$)$ Each core is superscalar and two$-$way hyperthreading

$4.[3]$ Superscalar capability makes the processor execute several instructions at the same

time. This is called instruction$-$level$-$parallelism. We measure the performance of this

hardware using IPC $($Instructions per cycle$).$ Is speculative execution needed for

superscalar processors to work? Justify

$5.[3]$ Suppose with have a core with eight execution units. What is the difference between

having this core be superscalar and having this core be two$-$way hyperthreading? In both

cases we have only eight execution units.

$6.[6]$ Before multicore processors, that is$,$ during the single core era, programs are getting

faster with every new generation of processors without any effort from the programmer.

This is due to two factors. What are they? And why did each factor make the performance

higher?