CS计算机代考程序代写 Fortran algorithm 5/2/2021 Exam 03 Multiple Choice: CMPSC 450 Spring 2021

5/2/2021 Exam 03 Multiple Choice: CMPSC 450 Spring 2021
Exam 03 Multiple Choice
Due Apr 21 at 8:50am Points 9 Questions 9
Available Apr 21 at 8am – Apr 21 at 8:50am about 1 hour Time Limit None
This quiz was locked Apr 21 at 8:50am.
Attempt History
Attempt Time Score
LATEST Attempt 1 15 minutes 8 out of 9
 Correct answers are hidden.
Score for this quiz: 8 out of 9 Submitted Apr 21 at 8:14am This attempt took 15 minutes.
Question 1
1 / 1 pts
One method for modelling communication time in a network is:
latency and bandwidth clock cycles
DRAM gap
Amdhal’s Law
Question 2
1 / 1 pts
https://psu.instructure.com/courses/2109084/quizzes/4153096
1/5

5/2/2021 Exam 03 Multiple Choice: CMPSC 450 Spring 2021
Question 3
1 / 1 pts
Which topology could an all-connected network simulate?
Ring network Tree Network 2D Mesh
3D Torus
All of the above
Which is a valid number of processors in a hypercube network topology?
10 24 36 64
Question 4
1 / 1 pts
Which algorithm requires an initial shift of data before the first iteration can begin?
https://psu.instructure.com/courses/2109084/quizzes/4153096
2/5

5/2/2021 Exam 03 Multiple Choice: CMPSC 450 Spring 2021
Question 5
1 / 1 pts
Which algorithm can have it’s sub regions broken up into smaller blocks?
SUMMA Cannon
Question 6
1 / 1 pts
Which algorithm can handle non-square matrices?
SUMMA Cannon
Incorrect
SUMMA Cannon
Question 7
0 / 1 pts
Which of the following rules does MPI NOT conform to:
The same program runs on all processes.
https://psu.instructure.com/courses/2109084/quizzes/4153096
3/5

5/2/2021 Exam 03 Multiple Choice: CMPSC 450 Spring 2021
Question 8
1 / 1 pts
Flipping the order of send and receive calls in MPI based on rank is a common way to avoid these issues:
pipeline bubbles race cases O(log N) deadlock
The program is written in a sequential language like Fortran, C or C++. MPI nodes on the same processor can share memory.
All variables in a process are local to this process.
Question 9
1 / 1 pts
The equivalent to threadID in MPI is called:
order rank poll O(log N)
https://psu.instructure.com/courses/2109084/quizzes/4153096
4/5

5/2/2021 Exam 03 Multiple Choice: CMPSC 450 Spring 2021
Quiz Score: 8 out of 9
https://psu.instructure.com/courses/2109084/quizzes/4153096
5/5