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

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

Namespace Prefixes

PrefixIRI
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F70883521%3A28140%2F14%3A43871608%21RIV15-MSM-28140___/
shttp://schema.org/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F70883521%3A28140%2F14%3A43871608%21RIV15-MSM-28140___
rdf:type
n11:Vysledek skos:Concept
dcterms:description
Parallel reduction algorithms are frequent in high perfor- mance computing areas, thus, modern parallel programming toolkits and languages often offer support for these algorithms. This article discusses important implementation aspects of built-in support for parallel reduc- tion found in well-known OpenMP C/C++ language extension. It shows that the implementation in widely used GCC compiler is not efficient and suggests usage of custom reduction implementation improving the computational performance. Parallel reduction algorithms are frequent in high perfor- mance computing areas, thus, modern parallel programming toolkits and languages often offer support for these algorithms. This article discusses important implementation aspects of built-in support for parallel reduc- tion found in well-known OpenMP C/C++ language extension. It shows that the implementation in widely used GCC compiler is not efficient and suggests usage of custom reduction implementation improving the computational performance.
dcterms:title
Performance Analysis of Built-in Parallel Reduction’s Implementation in OpenMP C/C Language Extension Performance Analysis of Built-in Parallel Reduction’s Implementation in OpenMP C/C Language Extension
skos:prefLabel
Performance Analysis of Built-in Parallel Reduction’s Implementation in OpenMP C/C Language Extension Performance Analysis of Built-in Parallel Reduction’s Implementation in OpenMP C/C Language Extension
skos:notation
RIV/70883521:28140/14:43871608!RIV15-MSM-28140___
n5:aktivita
n15:P
n5:aktivity
P(ED2.1.00/03.0089)
n5:dodaniDat
n10:2015
n5:domaciTvurceVysledku
n14:8479453 n14:7624433 n14:3448665
n5:druhVysledku
n17:D
n5:duvernostUdaju
n9:S
n5:entitaPredkladatele
n19:predkladatel
n5:idSjednocenehoVysledku
36125
n5:idVysledku
RIV/70883521:28140/14:43871608
n5:jazykVysledku
n16:eng
n5:klicovaSlova
Extension; Language; C/C; OpenMP; Implementation; Reduction’s; Parallel; Built-in; Analysis; Performance
n5:klicoveSlovo
n7:OpenMP n7:Parallel n7:Performance n7:Built-in n7:C%2FC n7:Language n7:Extension n7:Analysis n7:Implementation n7:Reduction%E2%80%99s
n5:kontrolniKodProRIV
[D0662F3FE519]
n5:mistoKonaniAkce
on-line
n5:mistoVydani
Heidelberg
n5:nazevZdroje
Advances in Intelligent Systems and Computing. 285
n5:obor
n12:JC
n5:pocetDomacichTvurcuVysledku
3
n5:pocetTvurcuVysledku
3
n5:projekt
n20:ED2.1.00%2F03.0089
n5:rokUplatneniVysledku
n10:2014
n5:tvurceVysledku
Dulík, Tomáš Jašek, Roman Bližňák, Michal
n5:typAkce
n21:WRD
n5:zahajeniAkce
2014-04-28+02:00
s:issn
2194-5357
s:numberOfPages
11
n13:hasPublisher
Springer-Verlag. Berlin
n18:isbn
978-3-319-06739-1
n6:organizacniJednotka
28140