When a program is adapted to run on multiple processors in a multiprocessor system, the execution time on each processor is comprised of computing time and the overhead time required for locked critical sections and/or to send data from one processor to another. Assume a program requires t = 100 s of execution time on one processor. When running p processors, each processor requires t/p s, as well as an additional 4 s of overhead, irrespective of the number of processors. 1. Compute the per-processor execution time for 2, 4, 8, 16, 32, 64, and 128 processors. 2. For each case, list the corresponding speedup relative to a single processor. 3. The ratio between actual speedup (computed in step B) versus ideal speedup (Ideal Speedup is achieved if there was no overhead). for each case i.e., with 2, 4, 8, 16, 32, 64, and 128 processors respectively. Please note that to Calculate the overall Speedup (as asked in question B) of a parallel design compared to a single processor design can be calculated using the following formula. Speedup = Old Execution Time / New Execution Time Execution time on single processor / Execution time with multiprocessor =
When a program is adapted to run on multiple processors in a multiprocessor system, the execution time on each processor is comprised of computing time and the overhead time required for locked critical sections and/or to send data from one processor to another. Assume a program requires t = 100 s of execution time on one processor. When running p processors, each processor requires t/p s, as well as an additional 4 s of overhead, irrespective of the number of processors. 1. Compute the per-processor execution time for 2, 4, 8, 16, 32, 64, and 128 processors. 2. For each case, list the corresponding speedup relative to a single processor. 3. The ratio between actual speedup (computed in step B) versus ideal speedup (Ideal Speedup is achieved if there was no overhead). for each case i.e., with 2, 4, 8, 16, 32, 64, and 128 processors respectively. Please note that to Calculate the overall Speedup (as asked in question B) of a parallel design compared to a single processor design can be calculated using the following formula. Speedup = Old Execution Time / New Execution Time Execution time on single processor / Execution time with multiprocessor =
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
hello, can you please help me with this problem because i am struggling really badly with this can you please do this step by step like doing calculations so I can understand it better, and can you do it step by step
Transcribed Image Text:When a program is adapted to run on multiple processors in a multiprocessor system, the execution time on each
processor is comprised of computing time and the overhead time required for locked critical sections and/or to send data
from one processor to another. Assume a program requires t = 100 s of execution time on one processor. When running p
processors, each processor requires t/p s, as well as an additional 4 s of overhead, irrespective of the number of
processors.
1. Compute the per-processor execution time for 2, 4, 8, 16, 32, 64, and 128 processors.
2. For each case, list the corresponding speedup relative to a single processor.
3. The ratio between actual speedup (computed in step B) versus ideal speedup (Ideal Speedup is achieved if there
was no overhead). for each case i.e., with 2, 4, 8, 16, 32, 64, and 128 processors respectively.
Please note that to Calculate the overall Speedup (as asked in question B) of a parallel design compared to a single
processor design can be calculated using the following formula.
Speedup = Old Execution Time / New Execution Time
= Execution time on single processor / Execution time with multiprocessor
Expert Solution
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 3 steps
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
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)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY