Matches in Nanopublications for { ?s ?p ?o <https://w3id.org/np/RAX1rcQJRZC4cvwe8pQWtoMzTOCmt86PxTZD47O6sxdFU/assertion>. }
- 3925 type DefinedTerm assertion.
- 1835 type DefinedTerm assertion.
- mailto:georgehadib@gmail.com type Agent assertion.
- mailto:nico.reissmann@rohub.com type Agent assertion.
- enrichment_service-account-enrichment type Agent assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 type DataResearchObject assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 type DataResearchObject assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 type ResearchObject assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 type LiveRO assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 type Dataset assertion.
- 2c6cb478-a2ed-4d78-a876-ca5597a4eeb7 type Folder assertion.
- 2c6cb478-a2ed-4d78-a876-ca5597a4eeb7 type Dataset assertion.
- 58632ef7-2917-48ed-a143-4c73bc3d1e49 type Folder assertion.
- 58632ef7-2917-48ed-a143-4c73bc3d1e49 type Dataset assertion.
- 69ea857f-a29d-4b64-8e34-ebb019e7aad2 type Folder assertion.
- 69ea857f-a29d-4b64-8e34-ebb019e7aad2 type Dataset assertion.
- c16de708-c318-4617-ae9c-1a59a3a19e9f type Folder assertion.
- c16de708-c318-4617-ae9c-1a59a3a19e9f type Dataset assertion.
- ae04627c-6abe-4bd2-bfff-9723fda5c0ef type BibliographicResource assertion.
- ae04627c-6abe-4bd2-bfff-9723fda5c0ef type Resource assertion.
- ae04627c-6abe-4bd2-bfff-9723fda5c0ef type MediaObject assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba type Dataset assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba type Resource assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba type MediaObject assertion.
- ro-crate-metadata.json type CreativeWork assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "dataset" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "algorithm" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "Python" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "graph" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "subroutine" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "control condition" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "destruction" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "object code" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "sequel" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Concept "verb phrase" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 FieldOfResearch "earth sciences" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 IPTC "Politics" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 IPTC "Literature" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Lemma "control" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Lemma "algorithm" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Lemma "Dependence" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Lemma "RVSDGs" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Lemma "destruction" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Lemma "object code" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Lemma "predicate" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 NASA "engineering" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Phrase "construction algorithm" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Phrase "control flow" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Phrase "destruction algorithm" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Phrase "intermediate representations" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Phrase "value State Dependence graph" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Sentence "Construction algorithms remodel the arbitrarily complex control flow of a procedure to make it amenable to DDG representation, whereas destruction algorithms reestablish control flow for generating efficient object code." assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Sentence "We provide an algorithm for constructing RVSDGs in predicate continuation form, and propose a novel destruction algorithm for RVSDGs in this form." assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Sentence "Demand-based dependence graphs (DDGs) such as the (Regionalized) Value State Dependence Graph (R)VSDG) are intermediate representations (IRs) well suited for a wide range of program transformations." assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba rightsHolder "Nico Reissmann" assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba type "Experiment" assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba bibliographicCitation "Reissmann, N. (2015).Perfect Reconstructability of Control Flow from Demand Dependence Graphs [Data set]. Norstore. https://doi.org/10.11582/2015.00010" assertion.
- 3925 description "" assertion.
- 1835 description "" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 description "Demand-based dependence graphs (DDGs), such as the (Regionalized) Value State Dependence Graph ((R)VSDG), are intermediate representations (IRs) well suited for a wide range of program transformations. They explicitly model the flow of data and state, and only implicitly represent a restricted form of control flow. These features make DDGs especially suitable for automatic parallelization and vectorization, but cannot be leveraged by practical compilers without efficient construction and destruction algorithms. Construction algorithms remodel the arbitrarily complex control flow of a procedure to make it amenable to DDG representation, whereas destruction algorithms reestablish control flow for generating efficient object code. Existing literature presents solutions to both problems, but these impose structural constraints on the generatable control flow, and omit qualitative evaluation. The key contribution of this article is to show that there is no intrinsic structural limitation in the control flow directly extractable from RVSDGs. This fundamental result originates from an interpretation of loop repetition and decision predicates as computed continuations, leading to the introduction of the predicate continuation normal form. We provide an algorithm for constructing RVSDGs in predicate continuation form, and propose a novel destruction algorithm for RVSDGs in this form. Our destruction algorithm can generate arbitrarily complex control flow; we show this by proving that the original CFG an RVSDG was derived from can, apart from overspecific detail, be reconstructed perfectly. Additionally, we prove termination and correctness of these algorithms. Furthermore, we empirically evaluate the performance, the representational overhead at compile time, and the reduction in branch instructions compared to existing solutions. In contrast to previous work, our algorithms impose no additional overhead on the control flow of the produced object code. To our knowledge, this is the first scheme that allows the original control flow of a procedure to be recovered from a DDG representation. This dataset contains the python implementation the experiments in the paper were conducted with as well as the extracted CFGs from the SPEC2006 benchmarks. It also contains the scripts for creating the plots of the paper." assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba description "Demand-based dependence graphs (DDGs), such as the (Regionalized) Value State Dependence Graph ((R)VSDG), are intermediate representations (IRs) well suited for a wide range of program transformations. They explicitly model the flow of data and state, and only implicitly represent a restricted form of control flow. These features make DDGs especially suitable for automatic parallelization and vectorization, but cannot be leveraged by practical compilers without efficient construction and destruction algorithms. Construction algorithms remodel the arbitrarily complex control flow of a procedure to make it amenable to DDG representation, whereas destruction algorithms reestablish control flow for generating efficient object code. Existing literature presents solutions to both problems, but these impose structural constraints on the generatable control flow, and omit qualitative evaluation. The key contribution of this article is to show that there is no intrinsic structural limitation in the control flow directly extractable from RVSDGs. This fundamental result originates from an interpretation of loop repetition and decision predicates as computed continuations, leading to the introduction of the predicate continuation normal form. We provide an algorithm for constructing RVSDGs in predicate continuation form, and propose a novel destruction algorithm for RVSDGs in this form. Our destruction algorithm can generate arbitrarily complex control flow; we show this by proving that the original CFG an RVSDG was derived from can, apart from overspecific detail, be reconstructed perfectly. Additionally, we prove termination and correctness of these algorithms. Furthermore, we empirically evaluate the performance, the representational overhead at compile time, and the reduction in branch instructions compared to existing solutions. In contrast to previous work, our algorithms impose no additional overhead on the control flow of the produced object code. To our knowledge, this is the first scheme that allows the original control flow of a procedure to be recovered from a DDG representation. This dataset contains the python implementation the experiments in the paper were conducted with as well as the extracted CFGs from the SPEC2006 benchmarks. It also contains the scripts for creating the plots of the paper." assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 contentSize "10521" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 dateCreated "2022-03-22 00:54:16.326344+00:00" assertion.
- ae04627c-6abe-4bd2-bfff-9723fda5c0ef dateCreated "2022-03-22 00:54:25.569088+00:00" assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba dateCreated "2015-03-24 00:00:00" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 creation_mode "MANUAL" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Domain "computer science" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Domain "mathematics" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Domain "computer programming" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 Domain "scientific terms" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 cite-as "Nico Reissmann. "Perfect Reconstructability of Control Flow from Demand Dependence Graphs." ROHub. Mar 22 ,2022. https://w3id.org/ro-id/1629b99a-a623-4b21-be4f-427330e04c36." assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 about 3925 assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 about 1835 assertion.
- ro-crate-metadata.json about 1629b99a-a623-4b21-be4f-427330e04c36 assertion.
- mailto:nico.reissmann@rohub.com email "nico.reissmann@rohub.com" assertion.
- 3925 name "Information science" assertion.
- 1835 name "Mathematics" assertion.
- mailto:georgehadib@gmail.com name "Geo H." assertion.
- mailto:nico.reissmann@rohub.com name "Nico Reissmann" assertion.
- enrichment_service-account-enrichment name "service-account-enrichment" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 name "Perfect Reconstructability of Control Flow from Demand Dependence Graphs" assertion.
- 2c6cb478-a2ed-4d78-a876-ca5597a4eeb7 name "metadata" assertion.
- 58632ef7-2917-48ed-a143-4c73bc3d1e49 name "raw data" assertion.
- 69ea857f-a29d-4b64-8e34-ebb019e7aad2 name "biblio" assertion.
- c16de708-c318-4617-ae9c-1a59a3a19e9f name "data" assertion.
- ae04627c-6abe-4bd2-bfff-9723fda5c0ef name "https://doi.org/10.1145/2693261" assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba name "Perfect Reconstructability of Control Flow from Demand Dependence Graphs" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 contentUrl "https://api.rohub.org/api/ros/1629b99a-a623-4b21-be4f-427330e04c36/crate/download/" assertion.
- ae04627c-6abe-4bd2-bfff-9723fda5c0ef contentUrl "https://doi.org/10.1145/2693261" assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba contentUrl "https://archive.sigma2.no/pages/public/datasetDetail.jsf?id=10.11582/2015.00010" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 creator mailto:georgehadib@gmail.com assertion.
- ae04627c-6abe-4bd2-bfff-9723fda5c0ef creator mailto:georgehadib@gmail.com assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba creator mailto:georgehadib@gmail.com assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 dateModified "2025-03-05 01:14:06.760794+00:00" assertion.
- ae04627c-6abe-4bd2-bfff-9723fda5c0ef dateModified "2022-03-22 00:54:25.692521+00:00" assertion.
- e66bae04-855e-43f6-b3e4-d948ce5900ba dateModified "2022-03-22 00:54:27.848176+00:00" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 datePublished "2022-03-22 00:54:16.326344+00:00" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 encodingFormat "application/ld+json" assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 hasPart 2c6cb478-a2ed-4d78-a876-ca5597a4eeb7 assertion.
- 1629b99a-a623-4b21-be4f-427330e04c36 hasPart 58632ef7-2917-48ed-a143-4c73bc3d1e49 assertion.