1. In a pipelined processor, where each instruction could be broken up into 5 stages and where each stage takes 1 ns what is the best we could hope to do in terms of average time to execute...

1. In a pipelined processor, where each instruction could be broken up into 5 stages and where each stage takes 1 ns what is the best we could hope to do in terms of average time to execute 1,000,000,000 instructions?

2. Using the 5-stage pipeline shown in Figure 5.6b answer the following two questions:

a. Show the actions (similar to Section 5.12.1) in each stage of the pipeline for BEQ instruction of LC-2200.

b. Considering only the BEQ instruction, compute the sizes of the FBUF, DBUF, EBUF, and MBUF.