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. A simulation from public publication records: the people listed were not invited and did not agree to review.

John C. Linford

dblp:09/3118 · also John Christian Linford · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

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

Systems, architecture and hardware · 5 · 3 first-author

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
3 papers
Parallel and multicore computing · 34% GPUs and heterogeneous computing · 30% High-performance computing · 26%

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

TopicWeightPapersLastEvidence papers
GPUs and heterogeneous computing › GPU programming
CUDA code generation
0.112011
Automatic Generation of Multicore Chemical Kernels · IEEE Trans. Parallel Distributed Syst. 2011
GPUs and heterogeneous computing
GPU-accelerated scientific computing
0.112011
Automatic Generation of Multicore Chemical Kernels · IEEE Trans. Parallel Distributed Syst. 2011
Parallel and multicore computing › parallel computing
multi-core acceleration
0.112009
Multi-core acceleration of chemical kinetics for simulation and prediction · SC 2009
Parallel and multicore computing › parallel programming models › directive-based programming
OpenMP
0.112009
A comparison of programming models for multiprocessors with explicitly managed memory hierarchies · PPoPP 2009
Parallel and multicore computing
parallel programming models
0.112009
A comparison of programming models for multiprocessors with explicitly managed memory hierarchies · PPoPP 2009
High-performance computing
scientific computing systems
0.112009
Multi-core acceleration of chemical kinetics for simulation and prediction · SC 2009
Processor architecture and microarchitecture
SIMD
0.012009
Multi-core acceleration of chemical kinetics for simulation and prediction · SC 2009

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

performance parameterization · 0.1automatic code generation · 0.1sequoia · 0.1rosenbrock solver · 0.1cellgen · 0.1cell broadband engine · 0.1CUDA · 0.1
YearPublicationVenuePosition
2011 Scalable heterogeneous parallelism for atmospheric modeling and simulation
John C. Linford, Adrian Sandu
J. Supercomput.1
2011 Automatic Generation of Multicore Chemical Kernels
abstract
Abstract-This work presents the Kinetics Preprocessor: Accelerated (KPPA), a general analysis and code generation tool that achieves significantly reduced time-to-solution for chemical kinetics kernels on three multicore platforms: NVIDIA GPUs using CUDA, the Cell Broadband Engine, and Intel Quad-Core Xeon CPUs. A comparative performance analysis of chemical kernels from WRFChem and the Community Multiscale Air Quality Model (CMAQ) is presented for each platform in double and single precision on coarse and fine grids. We introduce the multicore architecture parameterization that KPPA uses to generate a chemical kernel for these platforms and describe a code generation system that produces highly tuned platform-specific code. Compared to state-of-the-art serial implementations, speedups exceeding 25x are regularly observed, with a maximum observed speedup of 41.1x in single precision.
John C. Linford, John Michalakes, Manish Vachharajani, Adrian Sandu
IEEE Trans. Parallel Distributed Syst.1
2009 A comparison of programming models for multiprocessors with explicitly managed memory hierarchies
abstract
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and error-prone even for expert programmers. Before we can allow compilers to handle this complexity for us, we must identify the abstractions that are general enough to allow us to write applications with reasonable effort, yet specific enough to exploit the vast on-chip memory bandwidth of EMM multi-processors. To this end, we compare two programming models against hand-tuned codes on the STI Cell, paying attention to programmability and performance. The first programming model, Sequoia, abstracts the memory hierarchy as private address spaces, each corresponding to a parallel task. The second, Cellgen, is a new framework which provides OpenMP-like semantics and the abstraction of a shared address space divided into private and shared data. We compare three applications programmed using these models against their hand-optimized counterparts in terms of abstractions, programming complexity, and performance.
Scott Schneider 0001, Jae-Seung Yeom, Benjamin Rose, John C. Linford, Adrian Sandu, Dimitrios S. Nikolopoulos
PPoPP4
2009 Multi-core acceleration of chemical kinetics for simulation and prediction
abstract
This work implements a computationally expensive chemical kinetics kernel from a large-scale community atmospheric model on three multi-core platforms: NVIDIA GPUs using CUDA, the Cell Broadband Engine, and Intel Quad-Core Xeon CPUs. A comparative performance analysis for each platform in double and single precision on coarse and fine grids is presented. Platform-specific design and optimization is discussed in a mechanism-agnostic way, permitting the optimization of many chemical mechanisms. The implementation of a three-stage Rosenbrock solver for SIMD architectures is discussed. When used as a template mechanism in the the Kinetic PreProcessor, the multi-core implementation enables the automatic optimization and porting of many chemical mechanisms on a variety of multi-core platforms. Speedups of 5.5x in single precision and 2.7x in double precision are observed when compared to eight Xeon cores. Compared to the serial implementation, the maximum observed speedup is 41.1x in single precision.
John C. Linford, John Michalakes, Manish Vachharajani, Adrian Sandu
SC1
2009 Scalable timestamp synchronization for event traces of message-passing applications
Daniel Becker 0001, Rolf Rabenseifner, Felix Wolf 0001, John C. Linford
Parallel Comput.4