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.

Robert J. Hinde

dblp:54/1979 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2011
0000-0003-3499-9222ORCID · corroborated

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

Systems, architecture and hardware · 2Applied, interdisciplinary, general and emerging computing · 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
GPUs and heterogeneous computing · 61% Performance modeling and evaluation · 30% High-performance computing · 9%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › system-level analysis › architecture evaluation
accelerator comparison
0.112011
Comparing Hardware Accelerators in Scientific Applications: A Case Study · IEEE Trans. Parallel Distributed Syst. 2011
GPUs and heterogeneous computing
GPU computing
0.112011
Comparing Hardware Accelerators in Scientific Applications: A Case Study · IEEE Trans. Parallel Distributed Syst. 2011
GPUs and heterogeneous computing › heterogeneous programming models
OpenCL
0.112011
Comparing Hardware Accelerators in Scientific Applications: A Case Study · IEEE Trans. Parallel Distributed Syst. 2011
High-performance computing › scientific computing
scientific computing application
0.012011
Comparing Hardware Accelerators in Scientific Applications: A Case Study · IEEE Trans. Parallel Distributed Syst. 2011

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

performance evaluation · 0.1brook+ · 0.1VHDL · 0.1CUDA · 0.1
YearPublicationVenuePosition
2011 Determining anion-quadrupole interactions among protein, DNA, and ligand molecules
abstract
An extensive search through the Protein Databank (about 4500 nonredundant structures) was previously completed within our lab to analyze the energetic and geometric characteristics of an understudied molecular interaction known as an anion-quadrupole (AQ) interaction. Such an interaction occurs when the positively charged edge of an aromatic ring, resulting from a quadruple moment (i.e., a dual dipole moment), renders the aromatic molecule noncovalently bound to a nearby anionic molecule. The study considered a very limited scenario of molecules that can participate in AQ interactions, consisting of the phenyl group of a phenylalanine (phe) amino acid as the aromatic participant and the carboxylate group of an aspartate (asp) or glutamate (glu) amino acid as the anionic participant. The results revealed anion-quadrupole pairs to be prevalent within most of the protein structures. It was also observed that the interaction energy for AQ pairs was heavily dependent on the angle between the anion and plane of the aromatic ring, favoring a more planar interaction.
Jason B. Harris, David D. Jenkins, Jonathan Reyles, Stephanie Rickett, Jordan M. Utley, Elizabeth E. Howell, Jérôme Baudry, Robert J. Hinde
BMC Bioinform.8
2011 Comparing Hardware Accelerators in Scientific Applications: A Case Study
abstract
Multicore processors and a variety of accelerators have allowed scientific applications to scale to larger problem sizes. We present a performance, design methodology, platform, and architectural comparison of several application accelerators executing a Quantum Monte Carlo application. We compare the application's performance and programmability on a variety of platforms including CUDA with Nvidia GPUs, Brook+ with ATI graphics accelerators, OpenCL running on both multicore and graphics processors, C++ running on multicore processors, and a VHDL implementation running on a Xilinx FPGA. We show that OpenCL provides application portability between multicore processors and GPUs, but may incur a performance cost. Furthermore, we illustrate that graphics accelerators can make simulations involving large numbers of particles feasible.
Rick Weber, Akila Gothandaraman, Robert J. Hinde, Gregory D. Peterson
IEEE Trans. Parallel Distributed Syst.3
2008 FPGA acceleration of a quantum Monte Carlo application
Akila Gothandaraman, Gregory D. Peterson, G. Lee Warren, Robert J. Hinde, Robert J. Harrison
Parallel Comput.4