Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
1- A pipeline (pipeline(a)) has initially the segments listed in Table1.1. It is compared to three other pipelines; Pipeline(b), Pipeline(c) and Pipeline(d). Find each pipeline clock cycle time in nano seconds (ns), the total executing time for the indicated n tasks and the speed up ratio; (nk)/(n+k-1). Complete Table.1.2 Table1.1 segments Segt. I Segt.2 Segt.3 Segt.4 Segt.5 tl 12 t3 14 15 time in ns 90, 70, 80, 90, 50, tasks (n) 340, Pipeline(a) uses the original segments shown in Table1.1. a- b- Pipeline(b) is the same as pipeline (a) with t4 split into 3 identical segments. C- Pipeline(c) is the same as pipeline (a) with t2 and t3 combined into one segment. -p Pipeline(d) is the same as pipeline (a) with t4 split into 3 identical segments while t2 and t3 are combined into one segment, Table 1.2 All values of time are nano second (ns) Pipeline Number of Clock cycle Pipeline total execution Non-pipeline total execution time in ns Pipeline speed-up ratio Name Segments in ns time in ns Pipeline(a) Pipeline(b) Pipeline(c) Pipeline(d)

1- A pipeline (pipeline(a)) has initially the segments listed in Table1.1. It is compared to three other pipelines; Pipeline(b), Pipeline(c) and Pipeline(d). Find each pipeline clock cycle time in nano seconds (ns), the total executing time for the indicated n tasks and the speed up ratio; (nk)/(n+k-1). Complete Table.1.2 Table1.1 segments Segt. I Segt.2 Segt.3 Segt.4 Segt.5 tl 12 t3 14 15 time in ns 90, 70, 80, 90, 50, tasks (n) 340, Pipeline(a) uses the original segments shown in Table1.1. a- b- Pipeline(b) is the same as pipeline (a) with t4 split into 3 identical segments. C- Pipeline(c) is the same as pipeline (a) with t2 and t3 combined into one segment. -p Pipeline(d) is the same as pipeline (a) with t4 split into 3 identical segments while t2 and t3 are combined into one segment, Table 1.2 All values of time are nano second (ns) Pipeline Number of Clock cycle Pipeline total execution Non-pipeline total execution time in ns Pipeline speed-up ratio Name Segments in ns time in ns Pipeline(a) Pipeline(b) Pipeline(c) Pipeline(d)

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question
1- A pipeline (pipeline(a)) has initially the segments listed in Table1.1. It is compared to three other pipelines; Pipeline(b), Pipeline(c) and Pipeline(d). Find each pipeline clock cycle time in nano seconds (ns), the total executing time for the indicated n tasks and the speed up ratio; (nk)/(n+k-1). Complete Table.1.2 Table1.1 Segt.2 12 Segt.3 segments Segt. 1 Segt.4 Segt.5 15 tl 13 t4 time in ns tasks (n) Pipeline(a) uses the original segments shown in Table1.1. Pipeline(b) is the same as pipeline (a) with t4 split into 3 identical segments. Pipeline(c) is the same as pipeline (a) with t2 and t3 combined into one segment. Pipeline(d) is the same as pipeline (a) with t4 split into 3 identical segments while t2 and t3 are combined into one segment. 90, 340, 70, 80, 90, 50, a- b- C- d- Table1.2 All values of time are nano second (ns) Pipeline Name Pipeline(a) Pipeline(b) Pipeline(c) Pipeline(d) Number of Clock cycle Segments in ns Pipeline speed-up ratio Pipeline total execution Non-pipeline total time in ns execution time in ns
Transcribed Image Text:1- A pipeline (pipeline(a)) has initially the segments listed in Table1.1. It is compared to three other pipelines; Pipeline(b), Pipeline(c) and Pipeline(d). Find each pipeline clock cycle time in nano seconds (ns), the total executing time for the indicated n tasks and the speed up ratio; (nk)/(n+k-1). Complete Table.1.2 Table1.1 Segt.2 12 Segt.3 segments Segt. 1 Segt.4 Segt.5 15 tl 13 t4 time in ns tasks (n) Pipeline(a) uses the original segments shown in Table1.1. Pipeline(b) is the same as pipeline (a) with t4 split into 3 identical segments. Pipeline(c) is the same as pipeline (a) with t2 and t3 combined into one segment. Pipeline(d) is the same as pipeline (a) with t4 split into 3 identical segments while t2 and t3 are combined into one segment. 90, 340, 70, 80, 90, 50, a- b- C- d- Table1.2 All values of time are nano second (ns) Pipeline Name Pipeline(a) Pipeline(b) Pipeline(c) Pipeline(d) Number of Clock cycle Segments in ns Pipeline speed-up ratio Pipeline total execution Non-pipeline total time in ns execution time in ns
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS