Referring to the timing diagram of Fig. 3-38, suppose that you slowed the clock down to a period of 20 nsec instead of 10 nsec as shown but the timing constraints remained unchanged. How much time would the memory have to get the data onto the bus dur- ing T, after MREQ was asserted, in the worst case?

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

HELP WITH 25

### CPU Chips and Buses

#### Timing Diagram (Fig. 3-38)

The diagram illustrates a read cycle with one wait state. It consists of several waveforms representing the timing of signals in a CPU bus transaction. Key signals include:

- **Φ (Clock Signal):** Shows the clock cycle with different phases labeled T₁, T₂, T₃.
- **ADDRESS:** Represents the memory address to be read. It remains constant once set.
- **DATA:** Exhibits the period during which data is stable and valid for the read operation.
- **MREQ (Memory Request):** Indicates when the memory is being accessed.
- **RD (Read):** Signifies the active period of a read operation.
- **WAIT:** Introduces a delay in the operation if required.

The timing diagram shows various delays and setup times:

- **T_AD**: Delay in address output.
- **T_ML**: Time before the address is stable.
- **T_ML, T_MH**: Delays related to MREQ.
- **T_RL, T_RH**: Delays associated with RD signal.
- **T_DS, T_DH**: Data setup and hold times.

#### Timing Table

Below the diagram, a table summarizes the minimum and maximum values for each symbol in nanoseconds:

| Symbol | Parameter                                     | Min | Max | Unit |
|--------|-----------------------------------------------|-----|-----|------|
| T_AD   | Address output delay                          | 4   |     | nsec |
| T_ML   | Address stable prior to MREQ                  | 2   |     | nsec |
| T_MH   | MREQ delay from falling edge of Φ in T₃       | 3   |     | nsec |
| T_RL   | RD delay from falling edge of Φ in T₁         | 3   |     | nsec |
| T_DS   | Data setup time prior to falling edge of Φ    | 2   |     | nsec |
| T_DH   | Data hold time from negation of RD            | 0   |     | nsec |

### Exercise

Refer to this diagram for the following question:
"Referring to the timing diagram, if the clock is slowed to a period of 20 nsec instead of 10 nsec, while maintaining the timing constraints, how much time would the memory have to
Transcribed Image Text:### CPU Chips and Buses #### Timing Diagram (Fig. 3-38) The diagram illustrates a read cycle with one wait state. It consists of several waveforms representing the timing of signals in a CPU bus transaction. Key signals include: - **Φ (Clock Signal):** Shows the clock cycle with different phases labeled T₁, T₂, T₃. - **ADDRESS:** Represents the memory address to be read. It remains constant once set. - **DATA:** Exhibits the period during which data is stable and valid for the read operation. - **MREQ (Memory Request):** Indicates when the memory is being accessed. - **RD (Read):** Signifies the active period of a read operation. - **WAIT:** Introduces a delay in the operation if required. The timing diagram shows various delays and setup times: - **T_AD**: Delay in address output. - **T_ML**: Time before the address is stable. - **T_ML, T_MH**: Delays related to MREQ. - **T_RL, T_RH**: Delays associated with RD signal. - **T_DS, T_DH**: Data setup and hold times. #### Timing Table Below the diagram, a table summarizes the minimum and maximum values for each symbol in nanoseconds: | Symbol | Parameter | Min | Max | Unit | |--------|-----------------------------------------------|-----|-----|------| | T_AD | Address output delay | 4 | | nsec | | T_ML | Address stable prior to MREQ | 2 | | nsec | | T_MH | MREQ delay from falling edge of Φ in T₃ | 3 | | nsec | | T_RL | RD delay from falling edge of Φ in T₁ | 3 | | nsec | | T_DS | Data setup time prior to falling edge of Φ | 2 | | nsec | | T_DH | Data hold time from negation of RD | 0 | | nsec | ### Exercise Refer to this diagram for the following question: "Referring to the timing diagram, if the clock is slowed to a period of 20 nsec instead of 10 nsec, while maintaining the timing constraints, how much time would the memory have to
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY