Search
Now showing items 1-2 of 2
Mapping Unstructured Parallelism to Series-Parallel DAGs
(2004-01)
Many parallel programming languages allow programmers to describe parallelism by using constructs such as fork/join. When executed, such programs can be modeled as directed graphs, with nodes representing a computation and ...
Efficient on the fly maintenance of series-parallel relationships
(2004-01)
A series-parallel directed acyclic graph, or SP-dag, contains nodes that are either in series or logically in parallel. We present a data structure and algorithm to efficiently determine, in a single serial walk of the ...