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.
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.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.