Unit 6 · The Internet & Computing Systems · Lesson 6.10

Speedup, Calculated

This is the only arithmetic in Big Idea 4 on the AP exam. It’s worth doing correctly — and it’s one division.

Big Idea 4 — Computer Systems & NetworksCED 4.3 · the BI4 calculation

Before this lesson

No reading — this page is the reading. You’ll need 6.9’s idea: the sequential portion doesn’t shrink.

1

Where We Are

People→ Bits→ Programs→ Internet→ Security→ Big Data→ Impact

Internet region, systems side. 6.9 showed the ceiling by watching. Today you calculate it.

2

The Hook

Two formulas. That’s it. parallel time = sequential portion + longest parallel portion
speedup = sequential time ÷ parallel time

Every speedup question on the exam is these two lines.

3

The Idea

Speedup is how many times faster the parallel version is: time to run sequentially ÷ time to run in parallel. A speedup of 2 means twice as fast.

Shape 1 — one task, split evenly. A job takes 60 seconds on one processor: 20 seconds must run in order, and 40 seconds can be split evenly.

ProcessorsParallel timeSpeedup
120 + 40 = 60 s60 ÷ 60 = 1
220 + 20 = 40 s60 ÷ 40 = 1.5
420 + 10 = 30 s60 ÷ 30 = 2
820 + 5 = 25 s60 ÷ 25 = 2.4

Doubling from 4 to 8 processors only took the time from 30 to 25. The 20-second sequential portion is the floor, so the speedup can never reach 3 (60 ÷ 20), no matter how many processors.

Shape 2 — separate processes, assigned to processors. This is the exam’s favorite. Three independent processes take 40, 30, and 50 seconds. On two processors, the best split puts 50 on one and 40 + 30 = 70 on the other. They run at the same time, so the parallel time is the longer one: 70 seconds. Sequential time is 40 + 30 + 50 = 120. Speedup = 120 ÷ 70 ≈ 1.71.

The trap: the parallel time is the longest processor’s time, not the total and not the average. Processors that finish early just wait.

Distributed computing is the same idea across many separate computers connected by a network, instead of many cores in one computer. It makes problems possible that no single machine could handle — too much data to store in one place, or too much work to finish in a lifetime — like searching the whole web or analyzing data from millions of devices.

4

Try It — The Speedup Calculator

Shape 1. Change the portions and the processor count. Watch the curve flatten under its ceiling.

Shape 2. Enter process times (seconds, separated by commas) and a processor count. The calculator tries every assignment and finds the fastest.

5

Vocabulary

speedup Internet
The time to complete a task sequentially divided by the time to complete it in parallel.
parallel solution time Internet
The sequential portion plus the longest of the parallel portions.
distributed computing Internet
A computational model in which multiple devices are used to run a program. It allows problems to be solved that could not be solved on a single computer.
6

Check

Five questions. Write both formulas at the top of your paper first.

0 of 5 answered
7

Impact Check

When your computer helps science

Volunteer projects have let ordinary people donate their computers’ idle time to research — simulating how proteins fold, searching radio-telescope data. Each home computer does a small independent piece. That’s distributed computing powered by the public.

8

Connections

Came from 6.9 — the sequential portion — today it has a number.
Came from 4.6 — every claim backed by a number you produced. Speedup is that rule, applied to hardware.
Next in 6.11 — the web: one application running on everything this unit has built.
Returns in 6.12 and 6.15 — five speedup calculations in the lab, at least two on the test.
← 6.9 Parallel Computing