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.
? Tutorial for this page

James C. Phillips

dblp:40/4876 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
0since 2021 · last 2016
0000-0002-2296-3591ORCID · reported

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

Systems, architecture and hardware · 11 · 3 first-authorApplied, 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
8 papers
High-performance computing · 34% Interconnection networks and networks-on-chip · 28% Parallel and multicore computing · 19%
Interdisciplinary, comprehensive, and emerging computing
4 papers
Computational science and engineering · 71% Bioinformatics and computational biology · 29%

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

TopicWeightPapersLastEvidence papers
High-performance computing
performance optimization at scale
0.332014
Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation · SC 2014
Adapting a message-driven parallel application to GPU-accelerated clusters · SC 2008
NAMD: biomolecular simulation on thousands of processors · SC 2002
Interconnection networks and networks-on-chip
network topology
0.212014
Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation · SC 2014
Interconnection networks and networks-on-chip › network topology
topology-aware mapping
0.212014
Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation · SC 2014
Parallel and multicore computing
parallel programming runtimes
0.232011
Enabling and scaling biomolecular simulations of 100 million atoms on petascale machines with a multicore-optimized message-driven runtime · SC 2011
NAMD: biomolecular simulation on thousands of processors · SC 2002
Poster reception - Charm++ simplifies coding for the cell processor · SC 2006
High-performance computing › scientific computing systems
molecular dynamics simulation
0.112012
Optimizing fine-grained communication in a biomolecular simulation application on Cray XK6 · SC 2012
High-performance computing › scientific computing systems
biomolecular simulation
0.112011
Enabling and scaling biomolecular simulations of 100 million atoms on petascale machines with a multicore-optimized message-driven runtime · SC 2011
Parallel and multicore computing › parallel programming runtimes
message-driven runtime
0.112011
Enabling and scaling biomolecular simulations of 100 million atoms on petascale machines with a multicore-optimized message-driven runtime · SC 2011
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics
0.132014
Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation · SC 2014
Adapting a message-driven parallel application to GPU-accelerated clusters · SC 2008
NAMD: biomolecular simulation on thousands of processors · SC 2002
Distributed systems › communication optimization
communication-computation overlap
0.112008
Adapting a message-driven parallel application to GPU-accelerated clusters · SC 2008
GPUs and heterogeneous computing
GPU computing
0.112008
GPU Computing · Proc. IEEE 2008
Hardware accelerators and domain-specific architectures
accelerator programming models
0.112006
Poster reception - Charm++ simplifies coding for the cell processor · SC 2006
Processor architecture and microarchitecture › chip multiprocessor
cell processor
0.112006
Poster reception - Charm++ simplifies coding for the cell processor · SC 2006
Bioinformatics and computational biology › molecular informatics › molecular modeling
biomolecular simulation
0.022002
Scalable Molecular Dynamics for Large Biomolecular Systems · SC 2000
NAMD: biomolecular simulation on thousands of processors · SC 2002
High-performance computing
parallel i/o
0.012011
Enabling and scaling biomolecular simulations of 100 million atoms on petascale machines with a multicore-optimized message-driven runtime · SC 2011
Parallel and multicore computing
load balancing
0.012000
Scalable Molecular Dynamics for Large Biomolecular Systems · SC 2000
High-performance computing › large-scale simulation
parallel molecular dynamics
0.012000
Scalable Molecular Dynamics for Large Biomolecular Systems · SC 2000
Parallel and multicore computing
parallel programming models
0.012006
Poster reception - Charm++ simplifies coding for the cell processor · SC 2006

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

spatial decomposition · 0.5topology adaptation · 0.4kernel scheduling · 0.2communication overlap · 0.2runtime optimization · 0.1performance analysis · 0.1node-aware optimization · 0.1hierarchical load balancing · 0.1charm++ runtime · 0.1parallel programming · 0.1predictive load balancing · 0.1particle mesh ewald · 0.0force decomposition · 0.0
YearPublicationVenuePosition
2016 Atomic detail visualization of photosynthetic membranes with GPU-accelerated ray tracing
John E. Stone, Melih Sener, Kirby L. Vandivort, Angela M. Barragan, Abhishek Singharoy, Ivan Teo, João Ribeiro 0003, Barry Isralewitz, Boon Chong Goh, James C. Phillips, Craig MacGregor-Chatwin, Matthew P. Johnson 0002, Lena F. Kourkoutis, C. Neil Hunter, Klaus Schulten
Parallel Comput.11
2014 Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation
abstract
Currently deployed petascale supercomputers typically use toroidal network topologies in three or more dimensions. While these networks perform well for topology-agnostic codes on a few thousand nodes, leadership machines with 20,000 nodes require topology awareness to avoid network contention for communication-intensive codes. Topology adaptation is complicated by irregular node allocation shapes and holes due to dedicated input/output nodes or hardware failure. In the context of the popular molecular dynamics program NAMD, we present methods for mapping a periodic 3-D grid of fixed-size spatial decomposition domains to 3-D Cray Gemini and 5-D IBM Blue Gene/Q toroidal networks to enable hundred-million atom full machine simulations, and to similarly partition node allocations into compact domains for smaller simulations using multiple-copy algorithms. Additional enabling techniques are discussed and performance is reported for NCSA Blue Waters, ORNL Titan, ANL Mira, TACC Stampede, and NERSC Edison.
James C. Phillips, Yanhua Sun, Eric J. Bohm, Laxmikant V. Kalé
SC1
2012 Optimizing fine-grained communication in a biomolecular simulation application on Cray XK6
abstract
Achieving good scaling for fine-grained communication intensive applications on modern supercomputers remains challenging. In our previous work, we have shown that such an application -- NAMD -- scales well on the full Jaguar XT5 without long-range interactions; Yet, with them, the speedup falters beyond 64K cores. Although the new Gemini interconnect on Cray XK6 has improved network performance, the challenges remain, and are likely to remain for other such networks as well. We analyze communication bottlenecks in NAMD and its CHARM++ runtime, using the Projections performance analysis tool. Based on the analysis, we optimize the runtime, built on the uGNI library for Gemini. We present several techniques to improve the fine-grained communication. Consequently, the performance of running 92224-atom Apoa1 with GPUs on TitanDev is improved by 36%. For 100-million-atom STMV, we improve upon the prior Jaguar XT5 result of 26 ms/step to 13 ms/step using 298,992 cores on Jaguar XK6.
Yanhua Sun, Gengbin Zheng, Eric J. Bohm, James C. Phillips, Laximant V. Kalé, Terry R. Jones
SC5
2011 Enabling and scaling biomolecular simulations of 100 million atoms on petascale machines with a multicore-optimized message-driven runtime
abstract
A 100-million-atom biomolecular simulation with NAMD is one of the three benchmarks for the NSF-funded sustainable petascale machine. Simulating this large molecular system on a petascale machine presents great challenges, including handling I/O, large memory footprint and getting good strong-scaling results. In this paper, we present parallel I/O techniques to enable the simulation. A new SMP model is designed to efficiently utilize ubiquitous wide multicore clusters by extending the Charm++ asynchronous message-driven runtime. We exploit node-aware techniques to optimize both the application and the underlying SMP runtime. Hierarchical load balancing is further exploited to scale NAMD to the full Jaguar PF Cray XT5 (224,076 cores) at Oak Ridge National Laboratory, both with and without PME full electrostatics, achieving 93% parallel efficiency (vs 6720 cores) at 9 ms per step for a simple cutoff calculation. Excellent scaling is also obtained on 65,536 cores of the Intrepid Blue Gene/P at Argonne National Laboratory.
Yanhua Sun, Gengbin Zheng, Eric J. Bohm, Laxmikant V. Kalé, James C. Phillips, Chris Harrison 0001
SC6
2009 GPU clusters for high-performance computing
abstract
Large-scale GPU clusters are gaining popularity in the scientific computing community. However, their deployment and production use are associated with a number of new challenges. In this paper, we present our efforts to address some of the challenges with building and running GPU clusters in HPC environments. We touch upon such issues as balanced cluster architecture, resource sharing in a cluster environment, programming models, and applications for GPU clusters.
Volodymyr V. Kindratenko, Jeremy Enos, Guochun Shi, Michael T. Showerman, Galen Wesley Arnold, John E. Stone, James C. Phillips, Wen-Mei W. Hwu
CLUSTER7
2008 Overcoming scaling challenges in biomolecular simulations across multiple platforms
abstract
NAMD is a portable parallel application for biomolecular simulations. NAMD pioneered the use of hybrid spatial and force decomposition, a technique now used by most scalable programs for biomolecular simulations, including Blue Matter and Desmond developed by IBM and D. E. Shaw respectively. NAMD has been developed using Charm++ and benefits from its adaptive communication-computation overlap and dynamic load balancing. This paper focuses on new scalability challenges in biomolecular simulations: using much larger machines and simulating molecular systems with millions of atoms. We describe new techniques developed to overcome these challenges. Since our approach involves automatic adaptive runtime optimizations, one interesting issue involves dealing with harmful interaction between multiple adaptive strategies. NAMD runs on a wide variety of platforms, ranging from commodity clusters to supercomputers. It also scales to large machines: we present results for up to 65,536 processors on IBM’s Blue Gene/L and 8,192 processors on Cray XT3/XT4. In addition, we present performance results on NCSA’s Abe, SDSC’s DataStar and TACC’s LoneStar cluster, to demonstrate efficient portability. We also compare NAMD with Desmond and Blue Matter.
Abhinav Bhatele, Sameer Kumar 0001, James C. Phillips, Gengbin Zheng, Laxmikant V. Kalé
IPDPS4
2008 Adapting a message-driven parallel application to GPU-accelerated clusters
abstract
Graphics processing units (GPUs) have become an attractive option for accelerating scientific computations as a result of advances in the performance and flexibility of GPU hardware, and due to the availability of GPU software development tools targeting general purpose and scientific computation. However, effective use of GPUs in clusters presents a number of application development and system integration challenges. We describe strategies for the decomposition and scheduling of computation among CPU cores and GPUs, and techniques for overlapping communication and CPU computation with GPU kernel execution. We report the adaptation of these techniques to NAMD, a widely-used parallel molecular dynamics simulation package, and present performance results for a 64-core 64-GPU cluster.
James C. Phillips, John E. Stone, Klaus Schulten
SC1
2008 GPU Computing
abstract
The graphics processing unit (GPU) has become an integral part of today's mainstream computing systems. Over the past six years, there has been a marked increase in the performance and capabilities of GPUs. The modern GPU is not only a powerful graphics engine but also a highly parallel programmable processor featuring peak arithmetic and memory bandwidth that substantially outpaces its CPU counterpart. The GPU's rapid increase in both programmability and capability has spawned a research community that has successfully mapped a broad range of computationally demanding, complex problems to the GPU. This effort in general-purpose computing on the GPU, also known as GPU computing, has positioned the GPU as a compelling alternative to traditional microprocessors in high-performance computer systems of the future. We describe the background, hardware, and programming model for GPU computing, summarize the state of the art in tools and techniques, and present four GPU computing successes in game physics and computational biophysics that deliver order-of-magnitude performance gains over optimized CPU applications.
John D. Owens, Mike Houston, David P. Luebke, Simon Green, John E. Stone, James C. Phillips
Proc. IEEE6
2006 Poster reception - Charm++ simplifies coding for the cell processor
abstract
While the Cell processor, jointly developed by IBM, Sony, and Toshiba, has great computational power, it also presents many challenges including portability and ease of programming. We have been adapting the Charm++ Runtime System to utilize the Cell. We believe that the Charm++ model fits well with the Cell for many reasons: encapsulation of data, effective prefetching, the ability to peak ahead in message queues, virtualization, etc. To these ends, we have developed the Offload API (an independent code) which allows Charm++ applications to easily take advantage of the Cell. Our goal is to allow Charm++ programs to run on Cell-based and non-Cell-based platforms without modification to application code. Example Charm++ programs using the Offload API already exist. We have also begun modifying NAMD, a popular molecular dynamics code, to use the Cell. In this poster, we plan to present current progress and future plans for this work.
David M. Kunzman, Gengbin Zheng, Eric J. Bohm, James C. Phillips, Laxmikant V. Kalé
SC4
2002 NAMD: biomolecular simulation on thousands of processors
abstract
NAMD is a fully featured, production molecular dynamics program for high performance simulation of large biomolecular systems. We have previously, at SC2000, presented scaling results for simulations with cutoff electrostatics on up to 2048 processors of the ASCI Red machine, achieved with an object-based hybrid force and spatial decomposition scheme and an aggressive measurement-based predictive load balancing framework. We extend this work by demonstrating similar scaling on the much faster processors of the PSC Lemieux Alpha cluster, and for simulations employing efficient (order N log N) particle mesh Ewald full electrostatics. This unprecedented scalability in a biomolecular simulation code has been attained through latency tolerance, adaptation to multiprocessor nodes, and the direct use of the Quadrics Elan library in place of MPI by the Charm++/Converse parallel runtime system.
James C. Phillips, Gengbin Zheng, Sameer Kumar 0001, Laxmikant V. Kalé
SC1
2000 Scalable Molecular Dynamics for Large Biomolecular Systems
abstract
We present an optimized parallelization scheme for molecular dynamics simulations of large biomolecular systems, implemented in the production-quality molecular dynamics program NAMD. With an object-based hybrid force and spatial decomposition scheme, and an aggressive measurement-based predictive load balancing framework, we have attained speeds and speedups that are much higher than any reported in literature so far. The paper first summarizes the broad methodology we are pursuing, and the basic parallelization scheme we used. It then describes the optimizations that were instrumental in increasing performance, and presents performance results on benchmark simulations.
Robert Brunner, James C. Phillips, Laxmikant V. Kalé
SC2
1997 A Visual Computing Environment for Very Large Scale Biomolecular Modeling
abstract
Knowledge of the complex molecular structures of living cells is being accumulated at a tremendous rate. Key technologies enabling this success have been, high performance computing and powerful molecular graphics applications, but the technology is beginning to seriously lag behind challenges posed by the size and number of new structures and by the emerging opportunities in drug design and genetic engineering. A visual computing environment is being developed which permits interactive modeling of biopolymers by linking a 3D molecular graphics program with an efficient molecular dynamics simulation program executed on remote high-performance parallel computers. The system will be ideally suited for distributed computing environments, by utilizing both local 3D graphics facilities and the peak capacity of high-performance computers for the purpose of interactive biomolecular modeling. To create an interactive 3D environment three input methods will be explored: (1) a six degree of freedom "mouse" for controlling the space shared by the model and the user; (2) voice commands monitored through a microphone and recognized by a speech recognition interface; (3) hand gestures, detected through cameras and interpreted using computer vision techniques. Controlling 3D graphics connected to real time simulations and the use of voice with suitable language semantics, as well as hand gestures, promise great benefits for many types of problem solving environments. Our focus on structural biology takes advantage of existing sophisticated software, provides concrete objectives, defines a well-posed domain of tasks and offers a well-developed vocabulary for spoken communication.
Michael Zeller, James C. Phillips, Andrew Dalke, William Humphrey, Klaus Schulten, Thomas S. Huang, Vladimir Pavlovic 0001, Yunxin Zhao, Zion Lo, Stephen M. Chu, Rajeev Sharma
ASAP2