Matches in SemOpenAlex for { <https://semopenalex.org/work/W4384698910> ?p ?o ?g. }
Showing items 1 to 64 of
64
with 100 items per page.
- W4384698910 abstract "Many results in the theory of parallel scheduling, dating back to Brent's Theorem, are expressed in terms of the parallel dependency structure of a program as represented by a Directed Acyclic Graph (DAG). In the world of parallel and concurrent program analysis, such DAG models are also used to study deadlock, data races, and priority inversions, to name just a few examples. In all of these cases, it tends to be convenient to think of the DAG as a model of the program itself-we might say, for example, that the time to run a parallel program on P processors depends on the work and span of the program's DAG. This assumes that the DAG is a static, predictable property of the program. In reality, however, a DAG typically models the runtime relationships between threads during a particular execution of a program. To obtain the DAG, one might simulate an execution (or all possible executions) using some form of cost semantics, a dynamic semantics that produces the DAG as it executes the program. In fine-grained parallel programs, such as those that result from constructs such as fork/join, spawn/sync, async/finish, and futures, these DAGs tend to be especially dynamic and dependent on the features of a particular execution. For example, a divide-and-conquer algorithm implemented using fork/join parallelism may divide a certain number of times depending on the input size, and a program written with futures can choose to wait on threads or not wait on threads depending on conditions available only at runtime. Such programs are best represented by a (possibly infinite) family of DAGs, representing all possible executions of the program." @default.
- W4384698910 created "2023-07-20" @default.
- W4384698910 creator A5009393339 @default.
- W4384698910 date "2023-07-18" @default.
- W4384698910 modified "2023-09-23" @default.
- W4384698910 title "Static Prediction of Parallel Computation Graphs (Abstract)" @default.
- W4384698910 cites W2001673593 @default.
- W4384698910 cites W2024929322 @default.
- W4384698910 cites W2087875803 @default.
- W4384698910 cites W2130566259 @default.
- W4384698910 cites W2135490589 @default.
- W4384698910 cites W2144249474 @default.
- W4384698910 doi "https://doi.org/10.1145/3597635.3598026" @default.
- W4384698910 hasPublicationYear "2023" @default.
- W4384698910 type Work @default.
- W4384698910 citedByCount "0" @default.
- W4384698910 crossrefType "proceedings-article" @default.
- W4384698910 hasAuthorship W4384698910A5009393339 @default.
- W4384698910 hasBestOaLocation W43846989101 @default.
- W4384698910 hasConcept C11413529 @default.
- W4384698910 hasConcept C120373497 @default.
- W4384698910 hasConcept C137364921 @default.
- W4384698910 hasConcept C150495011 @default.
- W4384698910 hasConcept C156325763 @default.
- W4384698910 hasConcept C156891508 @default.
- W4384698910 hasConcept C173608175 @default.
- W4384698910 hasConcept C184337299 @default.
- W4384698910 hasConcept C199360897 @default.
- W4384698910 hasConcept C207648694 @default.
- W4384698910 hasConcept C34165917 @default.
- W4384698910 hasConcept C41008148 @default.
- W4384698910 hasConcept C74197172 @default.
- W4384698910 hasConcept C80444323 @default.
- W4384698910 hasConceptScore W4384698910C11413529 @default.
- W4384698910 hasConceptScore W4384698910C120373497 @default.
- W4384698910 hasConceptScore W4384698910C137364921 @default.
- W4384698910 hasConceptScore W4384698910C150495011 @default.
- W4384698910 hasConceptScore W4384698910C156325763 @default.
- W4384698910 hasConceptScore W4384698910C156891508 @default.
- W4384698910 hasConceptScore W4384698910C173608175 @default.
- W4384698910 hasConceptScore W4384698910C184337299 @default.
- W4384698910 hasConceptScore W4384698910C199360897 @default.
- W4384698910 hasConceptScore W4384698910C207648694 @default.
- W4384698910 hasConceptScore W4384698910C34165917 @default.
- W4384698910 hasConceptScore W4384698910C41008148 @default.
- W4384698910 hasConceptScore W4384698910C74197172 @default.
- W4384698910 hasConceptScore W4384698910C80444323 @default.
- W4384698910 hasFunder F4320306076 @default.
- W4384698910 hasLocation W43846989101 @default.
- W4384698910 hasOpenAccess W4384698910 @default.
- W4384698910 hasPrimaryLocation W43846989101 @default.
- W4384698910 hasRelatedWork W1422032522 @default.
- W4384698910 hasRelatedWork W1558467648 @default.
- W4384698910 hasRelatedWork W1822389052 @default.
- W4384698910 hasRelatedWork W1855927527 @default.
- W4384698910 hasRelatedWork W2035082615 @default.
- W4384698910 hasRelatedWork W2084426999 @default.
- W4384698910 hasRelatedWork W2143455557 @default.
- W4384698910 hasRelatedWork W2623701236 @default.
- W4384698910 hasRelatedWork W4384698910 @default.
- W4384698910 hasRelatedWork W783270985 @default.
- W4384698910 isParatext "false" @default.
- W4384698910 isRetracted "false" @default.
- W4384698910 workType "article" @default.