Review Game Zone
Games
Test
Preview
Back
Match it!
Match it! Select the correct answer from the pull down...Good luck!
2 processors, 2 Processes: P (30 seconds) and Q (45 seconds). What is the difference in sequential vs. ideal parallel processing time?
Parallel
30 seconds
Running processes P and Q on one processor and processes R and S on the other processor
30 seconds
Parallel because multiple steps are able to happen at the same time.
Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
How much time does parallel save? 2 Processors, 3 Processes: A (10 seconds), B (20 seconds), C (30 seconds)
Parallel
30 seconds
Running processes P and Q on one processor and processes R and S on the other processor
30 seconds
Parallel because multiple steps are able to happen at the same time.
Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
Which process is typically more efficient?
Parallel
30 seconds
Running processes P and Q on one processor and processes R and S on the other processor
30 seconds
Parallel because multiple steps are able to happen at the same time.
Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
2 Processors, 4 Processes: W (20 seconds), X (30 seconds), Y (45 seconds), and Z (50 seconds)
Parallel
30 seconds
Running processes P and Q on one processor and processes R and S on the other processor
30 seconds
Parallel because multiple steps are able to happen at the same time.
Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
Which of the following best describes a challenge involved in using a parallel computing solution?
Parallel
30 seconds
Running processes P and Q on one processor and processes R and S on the other processor
30 seconds
Parallel because multiple steps are able to happen at the same time.
Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
2 Processors, 4 Processes: P (30 seconds), Q (10 seconds), R (20 seconds), and S (15 seconds)
Parallel
30 seconds
Running processes P and Q on one processor and processes R and S on the other processor
30 seconds
Parallel because multiple steps are able to happen at the same time.
Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
Which term describes running multiple processes at the same time?
Parallel
30 seconds
Running processes P and Q on one processor and processes R and S on the other processor
30 seconds
Parallel because multiple steps are able to happen at the same time.
Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
Which of the following best describes the ability of parallel computing solutions to improve efficiency?
Parallel
30 seconds
Running processes P and Q on one processor and processes R and S on the other processor
30 seconds
Parallel because multiple steps are able to happen at the same time.
Processes W and Z should be assigned to one processor, and processes X and Y should be assigned to the other processor.
A parallel computing solution may not be appropriate for an algorithm in which each step requires the output from the precedi
The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.
Check it!