ConceptSystems & CS
Computation dag
A directed acyclic graph that models the dynamic execution of a parallel program.
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
2Each in their own terms, from the easiest level.
Charles Leiserson & Julian Shun
A directed acyclic graph representing a parallel instruction stream where vertices are strands and edges represent control flow dependencies like spawns, calls, returns, and continuation.
Connections
8The lectures that define it or assume it, and the concepts next to it.