Repeat Exercise 10.3.2 assuming: i. The machine has one ALU resource and two MEM resources. ii. The machine has two ALU resources and one MEM resource. Hi. The machine has two ALU resources and two...

Repeat Exercise 10.3.2 assuming:

i. The machine has one ALU resource and two MEM resources.

ii. The machine has two ALU resources and one MEM resource.


Hi. The machine has two ALU resources and two MEM resources.

Exercise 10.3.2

Assume a machine with one ALU resource (for the ADD and SUB operations) and one MEM resource (for the LD and ST operations). Assume that all operations require one clock, except for the LD, which requires two. However, as in Example 10.6, a ST on the same memory location can commence one clock after a LD on that location commences. Find a shortest schedule for each of the fragments in Fig. 10.10.

Example 10.6

Fig. 10.10