Sign inSign in
ConceptSystems & CS

Deterministic parallel BFS

A parallel BFS implementation that uses a two-phase approach with atomic writeMin operations to ensure the output BFS tree is deterministic.
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.

Atomic operations1Comparison and swap1Nondeterminism in parallel programming1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    1 lecturer. 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.