Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ralph G. Brickner

dblp:38/5393 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 60% High-performance computing · 40%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › array processor
connection machine
0.011989
QCD with dynamical fermions on the connection machine · SC 1989
High-performance computing › scientific computing systems
lattice quantum chromodynamics
0.011989
QCD with dynamical fermions on the connection machine · SC 1989
Parallel and multicore computing › parallel computation models
massively parallel computation
0.011989
QCD with dynamical fermions on the connection machine · SC 1989
Parallel and multicore computing
parallel programming models
0.011989
QCD with dynamical fermions on the connection machine · SC 1989
High-performance computing
scientific computing systems
0.011989
QCD with dynamical fermions on the connection machine · SC 1989

Methods — techniques the papers use, named apart from their topics

wilson fermions · 0.0hybrid monte carlo algorithm · 0.0
YearPublicationVenuePosition
1989 QCD with dynamical fermions on the connection machine
abstract
We have implemented Quantum Chromo-Dynamics (QCD) on the massively parallel Connection Machine in *Lisp. The code uses dynamical Wilson fermions and the Hybrid Monte Carlo Algorithm (HMCA) to update the lattice. We describe our program and give performance measurements for it. With no tuning or optimization, the code runs at approximately 500 to 1000 MFLOPS on a 64-K Connection Machine, model CM-2, depending on the VP ratio.
Clive F. Baillie, Ralph G. Brickner, Rajan Gupta, S. Lennart Johnsson
SC2