Consider the operation of a machine with the data path of the figure below. Let us call this machine "Teletraan-1". Teletraan-1 has no pipeline. Suppose that fetching an instruction takes 4 nsec, decoding an instruction takes 1 nsec, fetching the operands from memory or registers to ALU takes 2 nsec, running the ALU takes 2 nsec, storing the result back to the destination registers takes 1 nsec. How much time does Teletraan-1 need to execute 1 million instructions? A. 1 nsec x 1 million = 0.001 second B. 2 nsec x 1 million = 0.002 second C. 4 nsec x 1 million = 0.004 second D. 10 nsec x 1 million = 0.01 second 2. Since the above machine Teletraan-1 has no pipeline, an instruction must be completed in one CPU clock cycle. As a result, a CPU clock cycle must be longer than or equal to the execution time of one instruction. To improve it, we developed "Teletraan-2". Teletraan-2 has a fivestage pipeline. It takes 5 nsec to fetch an instruction, 2 nsec to decode an instruction, 3 nsec to fetch operands, 3 nsec to execute an instruction in the ALU, and 2 nsec to write data back to the destination registers. In this situation, each stage must be completed in one CPU clock cycle. What is the minimum length of one CPU clock cycle? A. 2 nsec B. 3 nsec C. 5 nsec D. 15 nsec

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

1. Consider the operation of a machine with the data path of the figure below. Let us call this
machine "Teletraan-1". Teletraan-1 has no pipeline. Suppose that fetching an instruction takes
4 nsec, decoding an instruction takes 1 nsec, fetching the operands from memory or registers
to ALU takes 2 nsec, running the ALU takes 2 nsec, storing the result back to the destination
registers takes 1 nsec.
How much time does Teletraan-1 need to execute 1 million instructions?
A. 1 nsec x 1 million = 0.001 second
B. 2 nsec x 1 million = 0.002 second
C. 4 nsec x 1 million = 0.004 second
D. 10 nsec x 1 million = 0.01 second


2. Since the above machine Teletraan-1 has no pipeline, an instruction must be completed in one
CPU clock cycle. As a result, a CPU clock cycle must be longer than or equal to the execution
time of one instruction. To improve it, we developed "Teletraan-2". Teletraan-2 has a fivestage pipeline. It takes 5 nsec to fetch an instruction, 2 nsec to decode an instruction, 3 nsec to
fetch operands, 3 nsec to execute an instruction in the ALU, and 2 nsec to write data back to
the destination registers. In this situation, each stage must be completed in one CPU clock cycle.
What is the minimum length of one CPU clock cycle?
A. 2 nsec
B. 3 nsec
C. 5 nsec
D. 15 nsec

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps

Blurred answer
Knowledge Booster
Types of Database Architectures
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education