Suppose that a task on the ARM computer runs 256M instructions during its execution. The total time it takes to execute an instruction is 120 ns. We make the assumption that the work to be performed by one instruction can be divided into an arbitrary number of pipeline stages. Now complete the following problems. a. Complete the table by computing the stage time, total execution time, and speedup (relative to the non-pipelined case) for the different pipelining depths. Ignore all hazards. Pipeline depth Stage time Total execution time Speedup 1 120ns 1 4 8 12
Suppose that a task on the ARM computer runs 256M instructions during its execution. The total time it takes to execute an instruction is 120 ns. We make the assumption that the work to be performed by one instruction can be divided into an arbitrary number of pipeline stages. Now complete the following problems. a. Complete the table by computing the stage time, total execution time, and speedup (relative to the non-pipelined case) for the different pipelining depths. Ignore all hazards. Pipeline depth Stage time Total execution time Speedup 1 120ns 1 4 8 12
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...
Related questions
Question
100%
![Suppose that a task on the ARM computer runs 256M instructions during its execution. The total
time it takes to execute an instruction is 120 ns. We make the assumption that the work to be
performed by one instruction can be divided into an arbitrary number of pipeline stages. Now
complete the following problems.
a. Complete the table by computing the stage time, total execution time, and speedup
(relative to the non-pipelined case) for the different pipelining depths. Ignore all hazards.
Pipeline depth
Stage time
Total execution time
Speedup
1
120ns
1
4
8
12](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc6bda294-d575-420e-b4e6-0418e9d54f28%2F85a9558c-1b9d-4def-ab89-47b33d16ed6a%2Foh02z7_processed.png&w=3840&q=75)
Transcribed Image Text:Suppose that a task on the ARM computer runs 256M instructions during its execution. The total
time it takes to execute an instruction is 120 ns. We make the assumption that the work to be
performed by one instruction can be divided into an arbitrary number of pipeline stages. Now
complete the following problems.
a. Complete the table by computing the stage time, total execution time, and speedup
(relative to the non-pipelined case) for the different pipelining depths. Ignore all hazards.
Pipeline depth
Stage time
Total execution time
Speedup
1
120ns
1
4
8
12
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY