Quetion 7:a. Consider a 3 GHz (gigahertz) processor with a three-stage pipeline and 100 latencies t1,t2, and t3 such that t1=t3=3t2/4=2t3. If the longest pinnan into two pipeline stages of equal latency, Find the new frequency in GHz, ignoring delays in the pipeline registers. b. A particular system is controlled by a an operator through commands entered from a keyboard. The average number of commands entered in an 6-hour interval is 80. Suppose the processor scans the keyboard every 100 ms. how many times will the keyboard be checked in an 6-hour period? C. Let DS=3080H, CS=0000H, SI=0008H and IP=00FFH.What the physical address of the instruction and data that is fetched? d. How many Memory chips of size 512K X 8 are needed. to develop a a memory of si size 8M X 32 Show the address range .

 Answer:

Part (a): New Frequency of the Processor

Given:

  • Processor frequency: 3 GHz
  • Three-stage pipeline with latencies 𝑑1,𝑑2,𝑑3
  • 𝑑1=𝑑3
  • 𝑑1=3𝑑24
  • 𝑑2=2𝑑3

Let's first find the relationship between the latencies 𝑑1,𝑑2,𝑑3:

  1. From 𝑑1=3𝑑24:

    𝑑2=4𝑑13
  2. From 𝑑2=2𝑑3:

    𝑑3=𝑑22

Using 𝑑2=4𝑑13:

𝑑3=4𝑑132=4𝑑16=2𝑑13

Now, since 𝑑1=𝑑3, let:

𝑑1=𝑑3=𝑑

and

𝑑2=2𝑑3=2𝑑

The latencies are 𝑑1=𝑑, 𝑑2=2𝑑, 𝑑3=𝑑.

Now, the longest pipeline stage:

𝑑2=2𝑑

If we split the longest stage (which is 𝑑2=2𝑑) into two stages of equal latency, each stage would have:

New latency=𝑑22=2𝑑2=𝑑

The pipeline stages now are:

𝑑1=𝑑,𝑑2=𝑑,𝑑3=𝑑,𝑑4=𝑑(new stage after splitting)

Since all pipeline stages are now 𝑑, the new pipeline latency is 𝑑.

The original processor frequency is 3 GHz, corresponding to a time period 𝑇=13×109 seconds.

Since the original longest stage 𝑑2=2𝑑 sets the time period:

2𝑑=13×109
𝑑=16×109

With the new pipeline stages, each stage is now 𝑑:

𝑑=16×109

The new frequency:

New frequency=1𝑑=6 GHz

So, the new frequency is 6 GHz.

Part (b): Keyboard Scan Frequency

Given:

  • Average number of commands entered in 6 hours: 80
  • Processor scans the keyboard every 100 ms
  1. Number of scans per second:

    Scans per second=1100 ms=10.1 seconds=10 scans per second
  2. Total seconds in 6 hours:

    6 hours=6×3600 seconds=21600 seconds
  3. Total scans in 6 hours:

    Total scans=21600 seconds×10 scans per second=216000 scans

So, the keyboard will be checked 216,000 times in a 6-hour period.

Part (c): Physical Address Calculation

Given:

  • Data Segment (DS) = 3080H
  • Code Segment (CS) = 0000H
  • Source Index (SI) = 0008H
  • Instruction Pointer (IP) = 00FFH
  1. Physical address of the instruction:

    Physical Address=CS×10𝐻+IP
    Physical Address=0000𝐻×10𝐻+00𝐹𝐹𝐻=00𝐹𝐹𝐻
  2. Physical address of the data:

    Physical Address=DS×10𝐻+SI
    Physical Address=3080𝐻×10𝐻+0008𝐻=30800𝐻+0008𝐻=30808𝐻

So, the physical address of the instruction is 00FFH and the physical address of the data is 30808H.

Part (d): Number of Memory Chips Needed

Given:

  • Memory chip size = 512K x 8
  • Desired memory size = 8M x 32
  1. Convert sizes to bytes:

    • Memory chip size: 512𝐾×8 bits = 512×1024×8 bits = 4,194,304 bits
    • Desired memory size: 8𝑀×32 bits = 8×1024×1024×32 bits = 268,435,456 bits
  2. Number of chips needed:

    • Each chip provides 512K x 8 bits.
    • Total bits per chip: 512×1024×8 = 4,194,304 bits
    • Total number of chips required:
      Number of chips=268,435,456 bits4,194,304 bits per chip=64

Since each chip provides an 8-bit width and we need a 32-bit width, we need 4 chips for each bit of the desired 32-bit memory:

Number of chips needed=4×16=64

So, we need 64 chips.

Address Range:

  • Each chip is 512K (524288 locations) and with 8 chips being used for each byte, the address range would be:
    0π‘₯00000 to 0π‘₯7𝐹𝐹𝐹𝐹 (for each 8-chip set)

Thus, for a memory of size 8𝑀×32, the address range for each 32-bit wide section would be:

0π‘₯00000 to 0π‘₯7𝐹𝐹𝐹𝐹𝐹

Comments

Popular posts from this blog

Quetion 6 : Consider the "in-order-issue/in-order-completion" execution sequence shown in f In Figure Decode OWE Execute 12 12 12 14 16 13 16 13 15 15 16 Write 024/06/02 11 3 4 11 12 13 13 N 15 16 a. Identify the most likely reason why I could not enter the execute fourth cycle. stage until the [2] b. Will "in-order issue/out-of-order completion" or "out-of-order issue/out-of-order completion" fix this? If so, which? Explain

Question 5:

7.Write a program to read a list containing item name, item code and cost interactively and produce a three-column output as shown below. NAME CODE COST Turbo C++ 1001 250.95 C Primer 905 95.70 ------------- ------- ---------- ------------- ------- ---------- Note that the name and code are left-justified and the cost is right-justified with a precision of two digits. Trailing zeros are shown.