Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5369501> ?p ?o }
Showing triples 1 to 55 of
55
with 100 triples per page.
- Q5369501 subject Q7464929.
- Q5369501 subject Q8257627.
- Q5369501 subject Q8713595.
- Q5369501 abstract "In parallel computing, an embarrassingly parallel workload or problem (also called perfectly parallel or pleasingly parallel) is one where little or no effort is needed to separate the problem into a number of parallel tasks. This is often the case where there is little or no dependency, or need for communication between, those parallel tasks, or for results between them.Thus, these are different from distributed computing problems that need communication between tasks, especially communication of intermediate results. They are easy to perform on server farms which lack the special infrastructure used in a true supercomputer cluster. They are thus well suited to large, Internet-based distributed platforms such as BOINC, and do not suffer from parallel slowdown. The opposite of embarrassingly parallel problems are inherently serial problems, which cannot be parallelized at all.A common example of an embarrassingly parallel problem lies within graphics processing units (GPUs) for the task of 3D projection, where each pixel on the screen may be rendered independently.".
- Q5369501 wikiPageExternalLink hpec04.pdf.
- Q5369501 wikiPageExternalLink distributed-set-processing-with-shard-query.
- Q5369501 wikiPageExternalLink node30.html.
- Q5369501 wikiPageWikiLink Q1087987.
- Q5369501 wikiPageWikiLink Q10952676.
- Q5369501 wikiPageWikiLink Q1151850.
- Q5369501 wikiPageWikiLink Q1192553.
- Q5369501 wikiPageWikiLink Q1197129.
- Q5369501 wikiPageWikiLink Q119787.
- Q5369501 wikiPageWikiLink Q121117.
- Q5369501 wikiPageWikiLink Q128570.
- Q5369501 wikiPageWikiLink Q13479982.
- Q5369501 wikiPageWikiLink Q1385229.
- Q5369501 wikiPageWikiLink Q1401416.
- Q5369501 wikiPageWikiLink Q1404167.
- Q5369501 wikiPageWikiLink Q140770.
- Q5369501 wikiPageWikiLink Q1408282.
- Q5369501 wikiPageWikiLink Q169478.
- Q5369501 wikiPageWikiLink Q176953.
- Q5369501 wikiPageWikiLink Q180634.
- Q5369501 wikiPageWikiLink Q18334.
- Q5369501 wikiPageWikiLink Q183484.
- Q5369501 wikiPageWikiLink Q187787.
- Q5369501 wikiPageWikiLink Q206904.
- Q5369501 wikiPageWikiLink Q209563.
- Q5369501 wikiPageWikiLink Q232661.
- Q5369501 wikiPageWikiLink Q242256.
- Q5369501 wikiPageWikiLink Q245748.
- Q5369501 wikiPageWikiLink Q249013.
- Q5369501 wikiPageWikiLink Q257.
- Q5369501 wikiPageWikiLink Q261645.
- Q5369501 wikiPageWikiLink Q286820.
- Q5369501 wikiPageWikiLink Q2878.
- Q5369501 wikiPageWikiLink Q460419.
- Q5369501 wikiPageWikiLink Q7135017.
- Q5369501 wikiPageWikiLink Q7135018.
- Q5369501 wikiPageWikiLink Q7249984.
- Q5369501 wikiPageWikiLink Q7359571.
- Q5369501 wikiPageWikiLink Q7464929.
- Q5369501 wikiPageWikiLink Q7600677.
- Q5369501 wikiPageWikiLink Q795160.
- Q5369501 wikiPageWikiLink Q818610.
- Q5369501 wikiPageWikiLink Q8257627.
- Q5369501 wikiPageWikiLink Q837552.
- Q5369501 wikiPageWikiLink Q850362.
- Q5369501 wikiPageWikiLink Q8713595.
- Q5369501 wikiPageWikiLink Q8789.
- Q5369501 wikiPageWikiLink Q898535.
- Q5369501 wikiPageWikiLink Q92871.
- Q5369501 comment "In parallel computing, an embarrassingly parallel workload or problem (also called perfectly parallel or pleasingly parallel) is one where little or no effort is needed to separate the problem into a number of parallel tasks.".
- Q5369501 label "Embarrassingly parallel".