Parallel and Distributed Computing FRQ Practice

Responses receive AI feedback against a rubric after submission. Scores are practice estimates.

Question 1 of 5

An animation pipeline has 5 minutes of sequential scene setup and 8 independent layers of 5 minutes each on one artist workstation.

(a) One-workstation time? (b) Time with 4 workstations on layers after setup? (c) Speedup? Show arithmetic.

Question 2 of 5

(a) Explain sequential computing in one sentence. (b) Give a concrete school example of work that can run in parallel. (c) Give a concrete example of a sequential bottleneck in that same project.

Question 3 of 5

A research group moves a 100-hour single-computer analysis onto 25 laptops. Compute would be 4 hours per laptop if perfectly split, but sharing partial results needs 3 hours of network traffic.

(a) Estimate wall-clock time including communication. (b) Compute speedup versus 100 hours. (c) Explain why this speedup is not 25.

Question 4 of 5

A parallel solution takes as long as its sequential tasks plus the longest of its parallel tasks.

(a) Apply that rule to prep=2, tasks 11, 9, 3 running together, finish=4. (b) Explain what would change if the tasks ran one after another on one core. (c) State one benefit of parallel solutions for scaling.

Question 5 of 5

N=15 independent QR codes must be generated. Sequential configuration takes 1 minute. Each code takes 2 minutes on one phone.

(a) Time on one phone. (b) Time with 5 phones after configuration. (c) Which change reduces time more: cutting configuration to 0 minutes, or adding phones from 1 to 5? Compare numbers.