Big Idea 4 · Topic 4.3 · Exercise 1
Render Farm Dispatcher
25 minutes
Back to the Topic 4.3 lessonAll CSP topics
How this page works
The writing boxes below are yours. What you type stays in this browser, is saved here as you go, and is never sent to us or to your teacher. Hand the written work in the way your teacher asked for it.
The graded check at the bottom is the part that records to your teacher's gradebook.
Part B, from your handoutNot recorded
Your handout says these are the same items available here. Part A stays on paper.
Q1 · 3 points on the handout
The studio's producer asks for proof that the farm beats the old single-node workflow. Per the CED, what is the ONE legitimate way to compare the efficiency of the two solutions - and why will the farm's advantage GROW as the studio's films get longer?
Q2 · 3 points on the handout
Job 5 (trailer_4k.job) is different in kind, not just in size. Explain why renting 500 cloud machines makes this a DISTRIBUTED computing solution, and name the TWO single-computer limits from the CED that this job runs into.
Q3 · 2 points on the handout
ENRICHMENT: Suppose every frame batch in Jobs 1-4 could be split into arbitrarily small pieces across unlimited nodes, but the sequential tasks (and Job 4's one-shot credit roll) can never be split. Compute the minimum possible time for each job, then write the single sentence that describes the pattern you found.
No graded check on this page yetNot recorded
About the line in your handout
Your handout says this exercise is available online and auto-graded. The exercise IS here, and it is the same work in the same order, but the auto-graded half is not written for this topic yet. Nothing on this page is scored or sent to your teacher.
Hand this in the way your teacher asked for it. Topic 1.1 has its graded check today, and the rest follow.