SUMMARY: NanoShaper is a program specifically aiming the construction and analysis of the molecular surface of nanoscopic systems. It uses ray-casting for parallelism and it performs analytical computations whenever possible to maximize robustness and accuracy of the approach. Among the other features, NanoShaper provides volume, surface area, including that of internal cavities, for any considered molecular system. It identifies pockets via a very intuitive definition based on the concept of probe radius, intrinsic to the definition of the solvent excluded surface. We show here that, with a suitable choice of the parameters, the same approach can also permit the visualisation of molecular channels. NanoShaper has now been interfaced with the widely used molecular visualization software VMD, further enriching its already well furnished toolset. AVAILABILITY AND IMPLEMENTATION: VMD is available at http://www.ks.uiuc.edu/Research/vmd/. NanoShaper, its documentation, tutorials and supporting programs are available at http://concept.iit.it/downloads. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

course Public Access Share on Communicating science through visualization in an age of alternative facts Authors: Kalina Borkiewicz University of Illinois at Urbana-Champaign University of Illinois at Urbana-ChampaignView Profile , A J Christensen University of Illinois at Urbana-Champaign University of Illinois at Urbana-ChampaignView Profile , John E. Stone University of Illinois at Urbana-Champaign University of Illinois at Urbana-ChampaignView Profile Authors Info & Claims SA '17: SIGGRAPH Asia 2017 CoursesNovember 2017 Article No.: 3Pages 1–122https://doi.org/10.1145/3134472.3134488Published:27 November 2017Publication History 0citation291DownloadsMetricsTotal Citations0Total Downloads291Last 12 Months23Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Heterogeneous parallel computing applications often process large data sets that require multiple GPUs to jointly meet their needs for physical memory capacity and compute throughput. However, the lack of high-level abstractions in previous heterogeneous parallel programming models force programmers to resort to multiple code versions, complex data copy steps and synchronization schemes when exchanging data between multiple GPU devices, which results in high software development cost, poor maintainability, and even poor performance. This paper describes the HPE runtime system, and the associated architecture support, which enables a simple, efficient programming interface for exchanging data between multiple GPUs through either interconnects or cross-node network interfaces. The runtime and architecture support presented in this paper can also be used to support other types of accelerators. We show that the simplified programming interface reduces programming complexity. The research presented in this paper started in 2009. It has been implemented and tested extensively in several generations of HPE runtime systems as well as adopted into the NVIDIA GPU hardware and drivers for CUDA 4.0 and beyond since 2011. The availability of real hardware that support key HPE features gives rise to a rare opportunity for studying the effectiveness of the hardware support by running important benchmarks on real runtime and hardware. Experimental results show that in a exemplar heterogeneous system, peer DMA and double-buffering, pinned buffers, and software techniques can improve the inter-accelerator data communication bandwidth by 2×. They can also improve the execution speed by 1.6× for a 3D finite difference, 2.5× for 1D FFT, and 1.6× for merge sort, all measured on real hardware. The proposed architecture support enables the HPE runtime to transparently deploy these optimizations under simple portable user code, allowing system designers to freely employ devices of different capabilities. We further argue that simple interfaces such as HPE are needed for most applications to benefit from advanced hardware features in practice.

Simulation of in vivo cellular processes with the reaction–diffusion master equation (RDME) is a computationally expensive task. Our previous software enabled simulation of inhomogeneous biochemical systems for small bacteria over long time scales using the MPD-RDME method on a single GPU. Simulations of larger eukaryotic systems exceed the on-board memory capacity of individual GPUs, and long time simulations of modest-sized cells such as yeast are impractical on a single GPU. We present a new multi-GPU parallel implementation of the MPD-RDME method based on a spatial decomposition approach that supports dynamic load balancing for workstations containing GPUs of varying performance and memory capacity. We take advantage of high-performance features of CUDA for peer-to-peer GPU memory transfers and evaluate the performance of our algorithms on state-of-the-art GPU devices. We present parallel efficiency and performance results for simulations using multiple GPUs as system size, particle counts, and number of reactions grow. We also demonstrate multi-GPU performance in simulations of the Min protein system in E. coli. Moreover, our multi-GPU decomposition and load balancing approach can be generalized to other lattice-based problems.

Nuclear pore complexes (NPCs) form gateways for material transfer across the nuclear envelope of eukaryotic cells. Disordered proteins, rich in phenylalanine-glycine repeat motifs (FG-nups), form the central transport channel. Understanding how nups are arranged in the interior of the NPC may explain how NPC functions as a selectivity filter for transport of large molecules and a sieve-like filter for diffusion of small molecules (<9 nm or 40 kDa). We employed molecular dynamics to model the structures formed by various assemblies of one kind of nup, namely the 609-aa-long FG domain of Nsp1 (Nsp1-FG). The simulations started from different initial conformations and geometrical arrangements of Nsp1-FGs. In all cases Nsp1-FGs collectively formed brush-like structures with bristles made of bundles of 2-27 nups, however, the bundles being cross-linked through single nups leaving one bundle and joining a nearby one. The degree of cross-linking varies with different initial nup conformations and arrangements. Structural analysis reveals that FG-repeats of the nups not only involve formation of bundle structures, but are abundantly present in cross-linking regions where the epitopes of FG-repeats are highly accessible. Large molecules that are assisted by transport factors (TFs) are selectively transported through NPC apparently by binding to FG-nups through populated FG-binding pockets on the TF surface. Therefore, our finding suggests that TFs bind concertedly to multiple FGs in cross-linking regions and break-up the bundles to create wide pores for themselves and their cargoes to pass. In addition, the cross-linking between Nsp1-FG bundles, arising from simulations, is found to set a molecular size limit of <9 nm (40 kDa) for passive diffusion of molecules. Our simulations suggest that the NPC central channel, near the periphery where tethering of nups is dominant, features brush-like moderately cross-linked bundles, but in the central region, where tethering loses its effect, features a sieve-like structure of bundles and frequent cross-links.

Heterogeneous computing combines general purpose CPUs with accelerators to efficiently execute both sequential control-intensive and data-parallel phases of applications. Existing programming models for heterogeneous computing rely on programmers to explicitly manage data transfers between the CPU system memory and accelerator memory.

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.

To address the problem of performing long time simulations of biochemical pathways under in vivo cellular conditions, we have developed a lattice-based, reaction-diffusion model that uses the graphics processing unit (GPU) as a computational co-processor. The method has been specifically designed from the beginning to take advantage of the GPU's capacity to perform massively parallel calculations by not only executing a core set of mathematical calculations, but also running much of the underlying algorithmic logic on the GPU. In this study we present our three-dimensional model for in vivo diffusion that exploits the calculation capabilities of the GPU. The implementation of the diffusion operator on the GPU is subject to architectural constraints, and we discuss its structure and the trade-offs made to accommodate the GPU hardware.

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.

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.

We have implemented a system termed Interactive Molecular Dynamics (IMD), which permits manipulation of molecules in molecular dynamics simulations with real-time force feedback and graphical display. Communication is achieved throughanefficientsocketconnectionbetweenthevisualization program (VMD) and a molecular dynamics program (NAMD) running on single or multiple machines. A natural force feedback interface for molecular steering is provided by a haptic device. We model the effect of simulation speed on the haptic feedback, and discuss results of an IMD study of a 4,000 atom system, the gramicidin A channel.