Sign inSign in
ConceptSystems & CS

Prefix sum

An algorithmic operation that computes running totals of an array to determine memory offsets for parallel writes without race conditions.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Andy Pavlo

    Carnegie Mellon University · Graduate

    A sequence of numbers that is a running total of the input sequence.
    • 40:41Parallel Hash Join Algorithms

Lectures that assume it

1

Connections

8

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.