MétaCan
Menu
Back to cohort
Record W2030017732 · doi:10.1177/1094342012448133

Graphical processing units and scientific applications

2012· article· en· W2030017732 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueThe International Journal of High Performance Computing Applications · 2012
Typearticle
Languageen
FieldComputer Science
TopicComputer Graphics and Visualization Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceGridLeverage (statistics)Computer graphics (images)Ray tracing (physics)Parallel computingInitializationComputational scienceArtificial intelligenceProgramming language

Abstract

fetched live from OpenAlex

This special issue of the International Journal of High Performance Computing Applications collects extended versions of the best three papers presented at the International Workshop on GPUs and Scientific Applications (GPUScA 2010) held in Vienna in September 2010, in conjunction with PACT 2010 – the Annual International Conference on Parallel Architectures and Compilation Techniques. GPUs are cost-effective platforms for computationally intensive applications, providing tremendous peak performance. However, it is a major challenge to deliver the intrinsic performance of such architectures to end applications. The workshop addressed programming approaches and key techniques to leverage the computing power of GPUs. The paper Fast GPU perspective grid construction and triangle tracing for exhaustive ray tracing of highly coherent rays from Lancelot Perrotte and Guillaume Saupin, CEA-LIST (France), addresses the problem of computing, storing and sorting, at an interactive rate, all of the intersections between millions of triangles (a 3D scene) and millions of rays starting from the same point. This paper focuses on the fast GPU construction of a grid in projective space referencing the triangles of a 3D scene. It introduces a fast GPU algorithm which is used to build a grid of the rays constituting the scene, in the same projective space. This ray-based grid is computed during the initialization of the scene, which allows higher performance to be achieved, and the construction of a triangle-based grid in distinct passes for very large scenes, without having to manage memory transfers between CPUs and GPUs. This algorithm works the same way for both static and dynamic scenes, allowing interactive processing of complex and dynamic scenes to be achieved. These optimizations are used to speed up the geometrical computations used in the nuclear field to evaluate the impact of radiative sources on an operator. These geometrical computations are similar to those of traditional ray tracing, except that only highly coherent rays are thrown. The paper A framework for GPU accelerated deformable object modeling from Aria Shahingohar and Roy Eagleson, University of Western Ontario (Canada), describes a framework that uses multi-core CPUs and GPUs found in personal computers to accelerate the computations needed for a class of deformable object modeling algorithms. In recent years there has been growing interest in using deformable objects in computer applications such as animation, video games, garment CAD, and surgical simulation. Deformable object modeling is quite computationally expensive. However, since most of the related calculations can be parallelized, the authors have developed a framework that utilizes NVIDIA’s CUDA technology to accelerate a set of deformable object modeling algorithms by transferring their core computations to the GPU. Their results show that frame rates can be improved more than 20 times using GPU compared with using a multi-core CPU. In addition, they have developed a method called ‘Local Shape Matching’ which is an extension of the ‘Shape Matching’ method. Using this new method they have achieved fast and robust simulations. The paper Combining lattice Boltzmann and discrete element methods on a graphics processor from Andreas Monitzer, University of Applied Sciences Technikum Wien (Austria), deals with an original GPU-based implementation of the lattice Boltzmann method. It allows the simulation of fluids using basic arithmetic operations with a linear complexity, as is demonstrated in the paper. Additionally, the discrete element method can also be adapted to the new model. After outlining the method themselves and the integration of these two into a single simulation, this article shows a way to implement it on graphics cards using the CUDA platform.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.855
Threshold uncertainty score0.472

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.023
GPT teacher head0.303
Teacher spread0.280 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it