Justify your answer no credit for saying yes or no without explaining. The nxt allocation must either be one unit of R1 to P1, or one unit of R1 to P5, because R2 is currently fully allocated. In either case the system is free of deadlock if we draw the new resource graphs for both cases, in fact, the same reduction sequence just given will still fully reduce the graph. In general, a deadlock free resource-wait graph cannot become deadlocked by doing an allocation an extra request must also occur. Suppose that you are solving a computational application in which three kinds of operations need to be done on a large matrix, and each takes time t units.
Ideal speedups tend to ignore scheduling and synchronization delays, which can be considerable.
Either it won t help or it might even hurt, slowing things down a little. If we add a fourth CPU and use it, we need to do all sorts of cache flushing and it could slow things down quite a bit.