About: Approximate Data Dependence Profiling Based on Abstract Interval and Congruent Domains

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Approximate Data Dependence Profiling Based on Abstract Interval and Congruent Domains Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : covidontheweb.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	Approximate Data Dependence Profiling Based on Abstract Interval and Congruent Domains
Creator	Abbas, Mostafa El-Mahdy, Ahmed Omar, Rasha Rohou, Erven
topic	covid:3659fd4fbd3d1fe541172f6722b6f5854fe5e568#this
Source	PMC
abstract	Although parallel processing is mainstream, existing programs are often serial, and usually re-engineering cost is high. Data dependence profiling allows for automatically assessing parallelisation potential; Yet, data dependence profiling is notoriously slow and requires large memory, as it generally requires keeping track of each memory access. This paper considers employing a simple abstract single-trace analysis method using simple interval and congruent modulo domains to track dependencies at lower time and memory costs. The method gathers and abstracts the set of all memory reference addresses for each static memory access instruction. This method removes the need for keeping a large shadow memory and only requires a single pair-wise analysis pass to detect dependencies among memory instructions through simple intersection operations. Moreover, the combination of interval and congruent domains improves precision when compared with only using an interval domain representation, mainly when the data is not accessed in a dense access pattern. We further improve precision through partitioning memory space into blocks, where references in each block abstracted independently. An initial performance study is conducted on SPEC CPU-2006 benchmark programs and polyhedral benchmark suite. Results show that the method reduces execution time overhead by 1.4[Formula: see text] for polyhedral and 10.7[Formula: see text] for SPEC2006 on average; and significantly reduces memory by 109780[Formula: see text] and 6981[Formula: see text] for polyhedral and SPEC2006 respectively; the method has an average precision of 99.05% and 61.37% for polyhedral and SPEC respectively. Using memory partitioning resulted in improving mean precision to be 82.25% and decreasing memory reduction to be 47[Formula: see text] for SPEC2006 suite.
has issue date	2020-06-12(xsd:dateTime)
bibo:doi	10.1007/978-3-030-52794-5_1
has license	no-cc
sha1sum (hex)	3659fd4fbd3d1fe541172f6722b6f5854fe5e568
schema:url	https://doi.org/10.1007/978-3-030-52794-5_1
resource representing a document's title	Approximate Data Dependence Profiling Based on Abstract Interval and Congruent Domains
has PubMed Central identifier	PMC7343425
schema:publication	Architecture of Computing Systems - ARCS 2020
resource representing a document's body	covid:3659fd4fbd3d1fe541172f6722b6f5854fe5e568#body_text
is http://vocab.deri.ie/void#inDataset of	proxy:http/ns.inria.fr/covid19/3659fd4fbd3d1fe541172f6722b6f5854fe5e568
is schema:about of	named entity 'independently' named entity 'congruent' named entity 'improving' named entity 'reduction' named entity 'benchmark' named entity 'Yet' named entity 'interval' named entity 'large' named entity 'Profiling' named entity '1.4' named entity 'DEPENDENCE' named entity 'MAINSTREAM' named entity 'SUITE' named entity 'programs' named entity 'memory' named entity 'keeping track' named entity 'This' named entity 'mainstream' named entity 'initial' named entity '2006' named entity 'operations' named entity 'domain' named entity 'costs' named entity 'CPU' named entity 'access' named entity 'precision' named entity 'assessing' named entity 'domains' named entity 'Domains' named entity 'execution time' named entity 'memory access' named entity 'simple interval' named entity 'benchmark suite' named entity 'SPEC CPU2000' named entity 'perfect recall' named entity 'abstract interpretation' named entity 'semantics' named entity 'hash table' named entity 'data dependence' named entity 'profiling tool' named entity 'memory address' named entity 'LLVM' named entity 'memory location' named entity 'data dependence' named entity 'abstraction' named entity 'abstract interpretation' named entity 'memory usage' named entity 'dynamic memory' named entity 'compiler' named entity 'true dependencies' named entity 'data dependence' named entity 'benchmark program' named entity 'clusters of data' named entity 'semantics' named entity 'binary programs' named entity 'SD 3' named entity 'memory address' named entity 'program semantics' named entity 'parallelisation' named entity 'ground truth' named entity 'memory space' named entity 'abstract representation' named entity 'abstract interpretation' named entity 'data dependencies' named entity 'API' named entity 'memory addresses' named entity 'memory devices' named entity 'LLVM' named entity 'memory size' named entity 'parallelisation' named entity 'benchmark suite' named entity 'shadow memory' named entity 'memory address' named entity 'profilers' named entity 'data-flow analysis' named entity 'static analysis' named entity 'data dependence' named entity 'semantic'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software