This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9https://global.dbpedia.org/id/
schemahttp://schema.org/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Array-access_analysis
rdf:type
owl:Thing wikidata:Q9143 wikidata:Q315 dbo:Language schema:Language dbo:ProgrammingLanguage
rdfs:label
Array-access analysis
rdfs:comment
In computer science, array-access analysis is a compiler analysis approach used to decide the read and write access patterns to elements or portions of arrays. The major data type manipulated in scientific programs is the array. The define/use analysis on a whole array is insufficient for aggressive compiler optimizations such as auto parallelization and array privatization. Array access analysis aims to obtain the knowledge of which portions or even which elements of the array are accessed by a given code segment (basic block, loop, or even at the procedure level).
dcterms:subject
dbc:Compiler_construction dbc:Static_program_analysis
dbo:wikiPageID
3461370
dbo:wikiPageRevisionID
1089834814
dbo:wikiPageWikiLink
dbc:Compiler_construction dbr:Basic_block dbr:Compiler_analysis dbr:Control_flow dbr:Computer_science dbc:Static_program_analysis dbr:Atom_images dbr:Compiler_optimization dbr:Array-region_analysis dbr:Automatic_parallelization dbr:Array_sections dbr:Triplet_notation dbr:Subroutine dbr:Privatization_(computer_programming)
owl:sameAs
n9:4SnJc wikidata:Q4795876
dbp:wikiPageUsesTemplate
dbt:Compiler_optimizations dbt:Prog-lang-stub dbt:Reflist
dbo:abstract
In computer science, array-access analysis is a compiler analysis approach used to decide the read and write access patterns to elements or portions of arrays. The major data type manipulated in scientific programs is the array. The define/use analysis on a whole array is insufficient for aggressive compiler optimizations such as auto parallelization and array privatization. Array access analysis aims to obtain the knowledge of which portions or even which elements of the array are accessed by a given code segment (basic block, loop, or even at the procedure level). Array-access analysis can be largely categorized into exact (or reference-list-based) and summary methods for different tradeoffs of accuracy and complexity. Exact methods are precise but very costly in terms of computation and space storage, while summary methods are approximate but can be computed quickly and economically. Typical exact array-access analysis include linearization and . Summary methods can be further divided into , bounded regular sections using , linear-constraint methods such as data-access descriptors and .
prov:wasDerivedFrom
wikipedia-en:Array-access_analysis?oldid=1089834814&ns=0
dbo:wikiPageLength
1792
foaf:isPrimaryTopicOf
wikipedia-en:Array-access_analysis
Subject Item
dbr:Array_access_analysis
dbo:wikiPageWikiLink
dbr:Array-access_analysis
dbo:wikiPageRedirects
dbr:Array-access_analysis
Subject Item
dbr:Optimizing_compiler
dbo:wikiPageWikiLink
dbr:Array-access_analysis
Subject Item
wikipedia-en:Array-access_analysis
foaf:primaryTopic
dbr:Array-access_analysis