CIE IGCSE | 3.1.3 Cores, Cache and Clock Speed

Lesson objective

Explain how the number of cores, cache size and clock speed can affect CPU performance, and justify comparisons using the task and other relevant factors.

Learn

3.1.3 | CORES, CACHE AND CLOCK SPEED

01 | THREE FACTORS, THREE DIFFERENT JOBS

A CPU can spend time executing operations or waiting for data. Its performance also depends on how much work a program can divide between processing cores.

Do not treat these as three names for the same property
FactorWhat it describesHow it can help
CoresIndependent processing units within a processorCarry out different instruction streams concurrently
CacheSmall, fast memory close to or within the CPUReduce waiting for instructions and data from slower main memory
Clock speedClock cycles per secondAllow more processing cycles in a given time

Performance is task dependent. A change improves speed only when it helps the work being done. You cannot reliably rank unrelated processors from GHz alone.

02 | A CORE IS A PROCESSING UNIT

A core is a processing unit able to execute instructions. A multi-core CPU contains more than one core, allowing different instruction streams to run concurrently.

One core might work on part of a video render while another works on a different part. Cores can also run different programs at the same time.

Software must divide the work appropriately to benefit. A strictly sequential calculation cannot simply run its dependent steps at the same time because a later step needs the earlier result.

More cores can improve throughput or responsiveness, but doubling cores does not automatically halve every program’s runtime.

03 | VISUALISE WORK THAT CAN BE SHARED

Suppose eight independent jobs each take one time unit on a core. Ignore coordination, data transfer and all other limits.

Ideal model of perfectly divisible independent work
ArrangementTime slot 1Time slot 2Total slots
One coreJob 1Job 2; jobs 3–8 follow8
Four coresJobs 1–4 togetherJobs 5–8 together2

The four-core model finishes in two slots rather than eight. This is not a guaranteed fourfold improvement on real hardware.

If job 2 must wait for job 1, job 3 must wait for job 2, and so on, those eight dependent jobs still need eight slots in this model. Extra cores do not remove the dependency.

04 | CACHE: KEEP USEFUL VALUES NEARBY

Cache is small, fast memory used to hold copies of instructions and data likely to be needed by the CPU. Accessing cache is generally quicker than accessing main memory.

A cache hit means the required item is found in the cache. On a cache miss, the system must obtain it from a lower memory level, often main memory, which takes longer.

For example, a loop may repeatedly use the same instructions and nearby data. Keeping them in cache can reduce repeated waits for RAM.

Cache is not permanent file storage and is not a replacement for RAM. It holds selected working copies, not every file on the computer.

05 | WHY A LARGER CACHE CAN HELP

A larger cache can hold more relevant instructions and data. This may increase the chance that a needed item is already nearby, leading to fewer slower memory accesses.

The improvement depends on the access pattern and cache design. A program scanning a huge amount of new data may gain less than one repeatedly reusing a small working set.

More cache does not always mean proportionally more speed. Do not claim that doubling cache halves every program’s runtime. Cache does not change the mathematical result of a calculation.

A conceptual hierarchy, not universal measured timing
PlaceTypical roleRelative access in this simplified view
RegistersImmediate CPU working valuesVery fast, very small
CacheSelected copies of useful instructions/dataFast, limited capacity
Main memory (RAM)Running programs and working dataLarger, typically slower to access than cache
Secondary storageSaved programs and filesLong-term storage, different role

06 | CLOCK SPEED: CYCLES PER SECOND

The CPU clock provides timing pulses that coordinate operations. Clock speed is the number of clock cycles per second, measured in hertz.

1 GHz = one billion cycles per second. A 3 GHz clock has three billion cycles per second. This is a frequency, not a storage capacity.

For otherwise comparable operation, a higher clock rate can allow more cycles in a given time and reduce execution time. Real performance depends on what is accomplished in each cycle and whether the CPU is waiting for data.

A cycle is not the same as one complete instruction. Instructions can take multiple cycles, and some designs can complete multiple instructions per cycle. Do not translate 3 GHz into “three billion instructions per second” as a universal rule.

07 | WORKED CLOCK COMPARISON

Assume the same task needs exactly six billion cycles on either of two otherwise comparable CPUs, with no other delays.

Runtime = required cycles ÷ cycles per second, under the stated assumptions
ClockCalculationModel runtime
2 GHz6 billion cycles ÷ 2 billion cycles per second3 seconds
3 GHz6 billion cycles ÷ 3 billion cycles per second2 seconds

The faster clock reduces the model runtime from three seconds to two. This comparison works because the required cycle count and other conditions are held fixed.

Different processor designs may need different cycle counts for a task. Clock rates may also change during operation because of power or temperature limits. Compare actual task performance when those factors are not controlled.

08 | CHOOSE FOR THE WORKLOAD

Explain the mechanism rather than declaring one specification best
WorkloadPotentially helpful factorReason / qualification
Many independent rendering jobsMore coresJobs can be distributed, if software supports it
Repeatedly reused instructions and dataSuitable cache capacityMore useful values may remain close to the CPU
Sequential work with comparable cycles per taskHigher clock speedThose required cycles can be completed sooner
Many programs at onceMore cores and sufficient memoryWork can be scheduled concurrently; RAM and other limits still matter

For an exam explanation, link property to consequence: “A larger cache can hold more frequently needed data, therefore the CPU may make fewer slower RAM accesses, reducing waiting time.”

For evaluation, qualify the conclusion: “More cores help if the rendering software can divide the work; they do not guarantee a speedup for a sequential task.”

09 | COMMON MISTAKES

  • Cores equal guaranteed speed multiplication: software and dependencies limit parallel work.
  • Cache is permanent storage: it holds working copies of instructions/data.
  • GHz counts instructions: it counts clock cycles per second.
  • Higher GHz always wins: architecture, workload and memory waits matter.
  • One component controls all performance: storage, RAM and other system limits can affect the task too.

MATCH THE PROCESSING ROLE

Terminology

Terminology

Core

A processing unit within a CPU that can execute instructions.

Multi-core CPU

A processor containing more than one processing core.

Parallel work

Independent work performed concurrently by multiple processing units.

Dependency

A requirement for one operation to use another operation’s result.

Cache

Small, fast memory holding selected copies of useful instructions and data.

Cache hit

The required item is present in the cache.

Cache miss

The required item is absent from the cache and must be obtained elsewhere.

Clock cycle

One cycle of the timing signal coordinating CPU operations.

Clock speed

The number of CPU clock cycles per second.

Hertz (Hz)

One cycle per second.

Gigahertz (GHz)

One billion cycles per second.

Throughput

The amount of work completed in a given time.

Questions

Questions

CHECK YOUR UNDERSTANDING

Select all correct choices. Each exact set earns one point.

1. Which statements about cores are correct?
2. Why might a sequential task gain little from more cores?
3. Which describe cache?
4. What is a cache hit?
5. What does 3 GHz describe?
6. Six billion cycles at 2 GHz take how long in the stated model?
7. Which qualifications are sensible?
8. Which is most likely to benefit from more cores?

EXPLAIN AND COMPARE

Write your answers before revealing each sample.

1. Explain how more cores can improve performance.

2. Explain why doubling cores does not guarantee half the runtime.

3. Describe cache and explain its purpose.

4. Explain how a larger cache may help a program.

5. Define clock speed and explain what 2.5 GHz means.

6. Evaluate the claim that a 4 GHz CPU must be faster than a 3 GHz CPU.

APPLY IT | TWO DIFFERENT PROGRAMS

Program A has eight independent jobs. Program B has eight steps that each depend on the previous result. Under the lesson’s one-time-unit-per-job model, compare one core with four cores for each program.

Reveal suggested answer

Program A: eight slots on one core or two slots on four cores. Program B: eight slots in either case because the steps must remain sequential. Real results include overhead and other limits.

Flashcards

Flashcards

Click to flip. Select the ideas you need to revisit.

0 cards selected for revision.

    Selections are kept while this page is open.

    Workbook

    Workbook

    COMING SOON

    The workbook for 3.1.3 Cores, Cache and Clock Speed is coming soon. Complete the matching task and written questions in your exercise book.