Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Livermore_loops> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Livermore_loops abstract "Livermore loops (also known as the Livermore Fortran kernels or LFK) is a benchmark for parallel computers. It was created by Francis H. McMahon from scientific source code run on computers at Lawrence Livermore National Laboratory. It consists of 24 do loops, some of which can be vectorized, and some of which cannot. The benchmark was published in 1986 in Livermore fortran kernels: A computer test of numerical performance range.The Livermore loops were originally written in Fortran, but have since been ported to many programming languages. Each loop carries out a different mathematical kernel.Those kernels are: hydrodynamics fragment incomplete Cholesky conjugate gradient inner product banded linear systems solution tridiagonal linear systems solution general linear recurrence equations equation of state fragment alternating direction implicit integration integrate predictors difference predictors first sum first difference 2-D particle in a cell 1-D particle in a cell casual Fortran Monte Carlo search implicit conditional computation 2-D explicit hydrodynamics fragment general linear recurrence equations discrete ordinates transport matrix-matrix transport Planckian distribution 2-D implicit hydrodynamics fragment location of a first array minimum.↑ ↑".
- Livermore_loops wikiPageExternalLink livermore.
- Livermore_loops wikiPageExternalLink livermorec.
- Livermore_loops wikiPageID "21297877".
- Livermore_loops wikiPageLength "2316".
- Livermore_loops wikiPageOutDegree "23".
- Livermore_loops wikiPageRevisionID "491613300".
- Livermore_loops wikiPageWikiLink Benchmark_(computing).
- Livermore_loops wikiPageWikiLink Category:Parallel_computing.
- Livermore_loops wikiPageWikiLink Cholesky_decomposition.
- Livermore_loops wikiPageWikiLink Conditional_computation.
- Livermore_loops wikiPageWikiLink Conjugate_gradient_method.
- Livermore_loops wikiPageWikiLink Difference_predictor.
- Livermore_loops wikiPageWikiLink Do_while_loop.
- Livermore_loops wikiPageWikiLink Equation_of_state.
- Livermore_loops wikiPageWikiLink Finite_difference.
- Livermore_loops wikiPageWikiLink Fluid_dynamics.
- Livermore_loops wikiPageWikiLink Fortran.
- Livermore_loops wikiPageWikiLink Implicit_integration.
- Livermore_loops wikiPageWikiLink Inner_product_space.
- Livermore_loops wikiPageWikiLink Integrate_predictor.
- Livermore_loops wikiPageWikiLink Lawrence_Livermore_National_Laboratory.
- Livermore_loops wikiPageWikiLink Linear_system.
- Livermore_loops wikiPageWikiLink Matrix-matrix_transport.
- Livermore_loops wikiPageWikiLink Monte_Carlo_method.
- Livermore_loops wikiPageWikiLink Ordinates_transport.
- Livermore_loops wikiPageWikiLink Parallel_computing.
- Livermore_loops wikiPageWikiLink Plancks_law.
- Livermore_loops wikiPageWikiLink Recurrence_relation.
- Livermore_loops wikiPageWikiLink Source_code.
- Livermore_loops wikiPageWikiLinkText "Livermore loops".
- Livermore_loops subject Category:Parallel_computing.
- Livermore_loops hypernym Benchmark.
- Livermore_loops type Software.
- Livermore_loops comment "Livermore loops (also known as the Livermore Fortran kernels or LFK) is a benchmark for parallel computers. It was created by Francis H. McMahon from scientific source code run on computers at Lawrence Livermore National Laboratory. It consists of 24 do loops, some of which can be vectorized, and some of which cannot.".
- Livermore_loops label "Livermore loops".
- Livermore_loops sameAs Q6658267.
- Livermore_loops sameAs m.05f4g79.
- Livermore_loops sameAs Q6658267.
- Livermore_loops wasDerivedFrom Livermore_loops?oldid=491613300.
- Livermore_loops isPrimaryTopicOf Livermore_loops.