Questions: • Assume a decomposition such that each execution of Line 7 is a task. Draw a task- dependency graph and a task-interaction graph. • For n = 16, devise a good mapping for 16 processes and for 8 processes. • How does the above analysis change if log2(n) 1 ? m = Reference: These are Problems 3.15-3.18 from "Introduction to Parallel Computing", Second

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
Consider the following algorithm:
1. procedure FFT_like_pattern (A, n)
2. begin
3. m := log2 (n);
4. for j := 0 to m
1 do
5.
k := pow(2,j);
1 do
A[i] := A[i] + A[i XOR k] ;
6.
for i
:= 0 to n
7.
8. end forj
9. end FFT_like_pattern
Questions:
• Assume a decomposition such that each execution of Line 7 is a task. Draw a task-
dependency graph and a task-interaction graph.
• For n =
16, devise a good mapping for 16 processes and for 8 processes.
• How does the above analysis change if
log2(n) - 1 ?
m
%3D
Reference: These are Problems 3.15-3.18 from "Introduction to Parallel Computing",
Second
Transcribed Image Text:Consider the following algorithm: 1. procedure FFT_like_pattern (A, n) 2. begin 3. m := log2 (n); 4. for j := 0 to m 1 do 5. k := pow(2,j); 1 do A[i] := A[i] + A[i XOR k] ; 6. for i := 0 to n 7. 8. end forj 9. end FFT_like_pattern Questions: • Assume a decomposition such that each execution of Line 7 is a task. Draw a task- dependency graph and a task-interaction graph. • For n = 16, devise a good mapping for 16 processes and for 8 processes. • How does the above analysis change if log2(n) - 1 ? m %3D Reference: These are Problems 3.15-3.18 from "Introduction to Parallel Computing", Second
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

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