Search NASA⌕ Search

Engineering topics

Ren, Bin

Publications and source records attributed to Ren, Bin.

Disk Evolution Study through Imaging of Nearby Young Stars (DESTINYS): A Panchromatic View of DO Tau’s Complex Kilo-astronomical-unit Environment

While protoplanetary disks are often treated as isolated systems in planet formation models, observations increasingly suggest that vigorous interactions between Class II disks and their environments are not rare. DO Tau is a T Tauri star that has previously been hypothesized to have undergone a close encounter with the HV Tau system. As part of the DESTINYS ESO Large Programme, we present new Very Large Telescope (VLT)/SPHERE polarimetric observations of DO Tau and combine them with archival Hubble Space Telescope (HST) scattered-light images and Atacama Large Millimeter/submillimeter Array (ALMA) observations of CO isotopologues and CS to map a network of complex structures. The SPHERE and ALMA observations show that the circumstellar disk is connected to arms extending out to several hundred astronomical units. HST and ALMA also reveal stream-like structures northeast of DO Tau, some of which are at least several thousand astronomical units long. These streams appear not to be gravitationally bound to DO Tau, and comparisons with previous Herschel far-IR observations suggest that the streams are part of a bridge-like structure connecting DO Tau and HV Tau. We also detect a fainter redshifted counterpart to a previously known blueshifted CO outflow. While some of DO Tau's complex structures could be attributed to a recent disk–disk encounter, they might be explained alternatively by interactions with remnant material from the star formation process. These panchromatic observations of DO Tau highlight the need to contextualize the evolution of Class II disks by examining processes occurring over a wide range of size scales.

79 ASTRONOMY AND ASTROPHYSICS↗

MICCO: An Enhanced Multi-GPU Scheduling Framework for Many-Body Correlation Functions

Calculation of many-body correlation functions is one of the critical kernels utilized in many scientific computing areas, especially in Lattice Quantum Chromodynamics (Lattice QCD). It is formalized as a sum of a large number of contraction terms each of which can be represented by a graph consisting of vertices describing quarks inside a hadron node and edges designating quark propagations at specific time intervals. Due to its computation- and memory-intensive nature, real-world physics systems (e.g., multi-meson or multi-baryon systems) explored by Lattice QCD prefer to leverage multi-GPUs. Different from general graph processing, many-body correlation function calculations show two specific features: a large number of computation-/data-intensive kernels and frequently repeated appearances of original and intermediate data. The former results in expensive memory operations such as tensor movements and evictions. The latter offers data reuse opportunities to mitigate the data-intensive nature of many-body correlation function calculations. However, existing graph-based multi-GPU schedulers cannot capture these data-centric features, thus resulting in a sub-optimal performance for many-body correlation function calculations. To address this issue, this paper presents a multi-GPU scheduling framework, MICCO, to accelerate contractions for correlation functions particularly by taking the data dimension (e.g., data reuse and data eviction) into account. This work first performs a comprehensive study on the interplay of data reuse and load balance, and designs two new concepts: local reuse pattern and reuse bound to study the opportunity of achieving the optimal trade-off between them. Based on this study, MICCO proposes a heuristic scheduling algorithm and a machine-learning-based regression model to generate the optimal setting of reuse bounds. Specifically, MICCO is integrated into a real-world Lattice QCD system, Redstar, for the first time running on multiple GPUs. The evaluation demonstrates MICCO outperforms other state-of-art works, achieving up to 2.25× speedup in synthesized datasets, and 1.49× speedup in real-world correlation functions.

Wang, Qihan↗

MemHC: An Optimized GPU Memory Management Framework for Accelerating Many-body Correlation

The many-body correlation function is a fundamental computation kernel in modern physics computing applications, e.g., Hadron Contractions in Lattice quantum chromodynamics (QCD). This kernel is both computation and memory intensive, involving a series of tensor contractions, and thus usually runs on accelerators like GPUs. Existing optimizations on many-body correlation mainly focus on individual tensor contractions (e.g., cuBLAS libraries and others). In contrast, this work discovers a new optimization dimension for many-body correlation by exploring the optimization opportunities among tensor contractions. More specifically, it targets general GPU architectures (both NVIDIA and AMD) and optimizes many-body correlation’s memory management by exploiting a set of memory allocation and communication redundancy elimination opportunities: first, GPU memory allocation redundancy: the intermediate output frequently occurs as input in the subsequent calculations; second, CPU-GPU communication redundancy: although all tensors are allocated on both CPU and GPU, many of them are used (and reused) on the GPU side only, and thus, many CPU/GPU communications (like that in existing Unified Memory designs) are unnecessary; third, GPU oversubscription: limited GPU memory size causes oversubscription issues, and existing memory management usually results in near-reuse data eviction, thus incurring extra CPU/GPU memory communications.

97 MATHEMATICS AND COMPUTING↗

COMET: A Domain-Specific Compilation of High-Performance Computational Chemistry

The computational power increases over the past decades have greatly enhanced the ability to simulate chemical reactions and understand ever more complex transformations. Tensor contractions are the fundamental computational building block of these simulations. These simulations have often been tied to one platform and restricted in generality by the interface provided to the user. The expanding prevalence of accelerators and researcher demands necessitate a more general approach which is not tied to specific hardware or requires contortion of algorithms to specific hardware platforms. In this paper we present COMET, a domain-specific programming language and compiler infrastructure for tensor contractions targeting heterogeneous accelerators. We present a system of progressive lowering through multiple layers of abstraction and optimization that achieves up to 1.98×speedup for 30 tensor contractions commonly used in computational chemistry and beyond.

Mutlu, Erdal↗

A High Performance Sparse Tensor Algebra Compiler in MLIR

Sparse tensor algebra is widely used in many applications, including scientific computing, machine learning, and data analytics. The performance of sparse tensor algebra kernels strongly depends on the intrinsic characteristics of the input tensors, hence many storage formats are designed for tensors to achieve optimal performance for particular applications/architectures, which makes it challenging to implement and optimize every tensor operation of interest on a given architecture. We propose a tensor algebra domain-specific language (DSL) and compiler framework to automatically generate kernels for mixed sparse-dense tensor algebra operations. The proposed DSL provides high-level programming abstractions that resemble the familiar Einstein notation to represent tensor algebra operations. The compiler introduces a new Sparse Tensor Algebra dialect built on top of LLVM's extensible MLIR compiler infrastructure for efficient code generation while covering a wide range of tensor storage formats. Our compiler also leverages input-dependent code optimization to enhance data locality for better performance. Our results show that the performance of automatically generated kernels outperforms the state-of-the-art sparse tensor algebra compiler, with up to 20.92x, 6.39x, and 13.9x performance improvement over state-of-the-art tensor algebra compilers, for parallel SpMV, SpMM, and TTM, respectively.

Tian, Ruiqin↗

MemXCT: Design, Optimization, Scaling, and Reproducibility of X-Ray Tomography Imaging

Here, this work extends our previous research entitled "MemXCT: Memory-centric X-ray CT Reconstruction with Massive Parallelization" that was originally published at SC19 conference (Hidayetoglu et al., 2019) with reproducibility of the computational imaging performance. X-ray computed tomography (XCT) is regularly used at synchrotron light sources to study the internal morphology of materials at high resolution. However, experimental constraints, such as radiation sensitivity, can result in noisy or undersampled measurements. Further, depending on the resolution, sample size and data acquisition rates, the resulting noisy dataset can be in the order of terabytes. Advanced iterative reconstruction techniques can produce high-quality images from noisy measurements, but their computational requirements have made their use an exception rather than the rule. We propose a novel memory-centric approach that avoids redundant computations at the expense of additional memory complexity. We develop a memory-centric iterative reconstruction system, MemXCT, that uses an optimized SpMV implementation with two-level pseudo-Hilbert ordering and multi-stage input buffering. We evaluate MemXCT on various supercomputer architectures involving KNL and GPU. MemXCT can reconstruct a large (11Kx11K) mouse brain tomogram in 10 seconds using 4096 KNL nodes (256K cores). The results presented in our original article at the SC19 were based on large-scale supercomputing resources. The MemXCT application was selected for the Student Cluster Competition (SCC) Reproducibility Challenge and evaluated on a variety of cloud computing resources by universities around the world in the SC20 conference. We summarize the results of the top-ranked SCC Reproducibility Challenge teams and identify the most pertinent measures for ensuring the reproducibility of our experiments in this article.

47 OTHER INSTRUMENTATION↗

The Gemini Planet Imager View of the HD 32297 Debris Disk

We present new H-band scattered light images of the HD 32297 edge-on debris disk obtained with the Gemini Planet Imager. The disk is detected in total and polarized intensity down to a projected angular separation of 0.″15, or 20 au. On the other hand, the large-scale swept-back halo remains undetected, likely a consequence of its markedly blue color relative to the parent body belt. We analyze the curvature of the disk spine and estimate a radius of ≈100 au for the parent body belt, smaller than past scattered light studies but consistent with thermal emission maps of the system. We employ three different flux-preserving post-processing methods to suppress the residual starlight and evaluate the surface brightness and polarization profile along the disk spine. Unlike past studies of the system, our high-fidelity images reveal the disk to be highly symmetric and devoid of morphological and surface brightness perturbations. We find the dust scattering properties of the system to be consistent with those observed in other debris disks, with the exception of HR 4796. Finally, we find no direct evidence for the presence of a planetary-mass object in the system.

79 ASTRONOMY AND ASTROPHYSICS↗

Extracting SIMD Parallelism from Recursive Task-Parallel Programs

The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations. In the absence of data parallelism, it seems that such algorithms are not well suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data parallelism latent in recursive, task- parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel’s SSE4.2 vector units, as well as accelerators using Intel’s AVX512 units. We then show through rigorous sampling that, in practice, our vectorization techniques are effective for a much larger class of programs.

Recursive Programs, task parallelism, vectorizatio↗

An Exo–Kuiper Belt with an Extended Halo around HD 191089 in Scattered Light

We have obtained Hubble Space Telescope STIS and NICMOS and Gemini/GPI scattered-light images of the HD 191089 debris disk. We identify two spatial components: a ring resembling the Kuiper Belt in radial extent (FWHM ~ 25 au, centered at ~46 au) and a halo extending to ~640 au. We find that the halo is significantly bluer than the ring, consistent with the scenario that the ring serves as the "birth ring" for the smaller dust in the halo. We measure the scattering phase functions in the 30°–150° scattering-angle range and find that the halo dust is more forward- and backward-scattering than the ring dust. We measure a surface density power-law index of -0.68 ± 0.04 for the halo, which indicates the slowdown of the radial outward motion of the dust. Using radiative transfer modeling, we attempt to simultaneously reproduce the (visible) total and (near-infrared) polarized intensity images of the birth ring. Our modeling leads to mutually inconsistent results, indicating that more complex models, such as the inclusion of more realistic aggregate particles, are needed.

79 ASTRONOMY AND ASTROPHYSICS↗

The Gemini Planet Imager Exoplanet Survey: Giant Planet and Brown Dwarf Demographics from 10 to 100 au

Here, we introduce a statistical analysis of the first 300 stars observed by the Gemini Planet Imager Exoplanet Survey. This subsample includes six detected planets and three brown dwarfs; from these detections and our contrast curves we infer the underlying distributions of substellar companions with respect to their mass, semimajor axis, and host stellar mass. We uncover a strong correlation between planet occurrence rate and host star mass, with stars M * > 1.5 M ⊙ more likely to host planets with masses between 2 and 13$M$ Jup and semimajor axes of 3–100 au at 99.92% confidence. We fit a double power-law model in planet mass ($m$) and semimajor axis ($a$) for planet populations around high-mass stars (M * > 1.5 M ⊙ ) of the form ${d}^{2}N/({dm}\,{da})\propto {m}^{\alpha }\,{a}^{\beta }$, finding α = –2.4 ± 0.8 and β = –2.0 ± 0.5, and an integrated occurrence rate of ${9}_{-4}^{+5}$% between 5–13M Jup and 10–100 au. A significantly lower occurrence rate is obtained for brown dwarfs around all stars, with ${0.8}_{-0.5}^{+0.8}$% of stars hosting a brown dwarf companion between 13–80$M$ Jup and 10–100 au. Brown dwarfs also appear to be distributed differently in mass and semimajor axis compared to giant planets; whereas giant planets follow a bottom-heavy mass distribution and favor smaller semimajor axes, brown dwarfs exhibit just the opposite behaviors. Comparing to studies of short-period giant planets from the radial velocity method, our results are consistent with a peak in occurrence of giant planets between ~1 and 10 au. These trends, including the preference of giant planets for high-mass host stars, point to formation of giant planets by core/pebble accretion, and formation of brown dwarfs by gravitational instability, according to this work.

79 ASTRONOMY AND ASTROPHYSICS↗

A Decade of MWC 758 Disk Images: Where are the Spiral-Arm-Driving Planets?

Large-scale spiral arms have been revealed in scattered light images of a few protoplanetary disks. Theoretical models suggest that such arms may be driven by and corotate with giant planets, which has called for remarkable observational efforts to look for them. By examining the rotation of the spiral arms for the MWC 758 system over a 10 year timescale, we are able to provide dynamical constraints on the locations of their perturbers. We present reprocessed Hubble Space Telescope (HST)/NICMOS F110W observations of the target in 2005, and the new Keck/NIRC2 L'-band observations in 2017. MWC 758's two well-known spiral arms are revealed in the NICMOS archive at the earliest observational epoch. With additional Very Large Telescope (VLT)/SPHERE data, our joint analysis leads to a pattern speed of 0.°6(sup +3.°3, sub -0.°6)/yr at 3σ for the two major spiral arms. If the two arms are induced by a perturber on a near-circular orbit, its best-fit orbit is at 89 au (0."59), with a 3σ lower limit of 30 au (0."20). This finding is consistent with the simulation prediction of the location of an arm-driving planet for the two major arms in the system.

MWC 758↗

Exploiting Vector and Multicore Parallelsim for Recursive, Data- and Task-Parallel Programs

Modern hardware contains parallel execution resources that are well-suited for data-parallelism-vector units-and task parallelism-multicores. However, most work on parallel scheduling focuses on one type of hardware or the other. In this work, we present a scheduling framework that allows for a unified treatment of task- and data-parallelism. Our key insight is an abstraction, task blocks, that uniformly handles data-parallel iterations and task-parallel tasks, allowing them to be scheduled on vector units or executed independently as multicores. Our framework allows us to define schedulers that can dynamically select between executing task- blocks on vector units or multicores. We show that these schedulers are asymptotically optimal, and deliver the maximum amount of parallelism available in computation trees. To evaluate our schedulers, we develop program transformations that can convert mixed data- and task-parallel pro- grams into task block-based programs. Using a prototype instantiation of our scheduling framework, we show that, on an 8-core system, we can simultaneously exploit vector and multicore parallelism to achieve 14×-108× speedup over sequential baselines.

Ren, Bin↗

User-Assisted Store Recycling for Dynamic Task Graph Schedulers

The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recycling functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.

97 MATHEMATICS AND COMPUTING↗

On the Impact of Widening Vector Registers on Sequence Alignment

Vector extensions, such as SSE, have been part of the x86 since the 1990s, with applications in graphics, signal processing, and scientific applications. Although many algorithms and applications can naturally benefit from automatic vectorization techniques, there are still many that are difficult to vectorize due to their dependence on irregular data structures, dense branch operations, or data dependencies. Sequence alignment, one of the most widely used operations in bioinformatics workflows, has a computational footprint that features complex data dependencies. In this paper, we demonstrate that the trend of widening vector registers adversely affects the state-of-the-art sequence alignment algorithm based on striped data layouts. We present a practically efficient SIMD implementation of a parallel scan based sequence alignment algorithm that can better exploit wider SIMD units. We conduct comprehensive workload and use case analyses to characterize the relative behavior of the striped and scan approaches and identify the best choice of algorithm based on input length and SIMD width.

Needleman-Wunsch↗

Efficient Execution of Recursive Programs on Commodity Vector Hardware

The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly-wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations; in the absence of data parallelism, it seems that such algorithms are not well-suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data-parallelism latent in recursive, task-parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel's SSE4.2 vector units as well as accelerators using Intel's AVX512 units.

resursion↗

X-RAY ABSORPTION BY THE WARM-HOT INTERGALACTIC MEDIUM IN THE HERCULES SUPERCLUSTER

''Missing baryons'', in the form of warm-hot intergalactic medium (WHIM), are expected to reside in cosmic filamentary structures that can be traced by signposts such as large-scale galaxy superstructures. The clear detection of an X-ray absorption line in the Sculptor Wall demonstrated the success of using galaxy superstructures as a signpost to search for the WHIM. Here we present an XMM -Newton Reflection Grating Spectrometer observation of the blazar Mkn 501, located in the Hercules Supercluster. We detected an O VII Kα absorption line at the 98.7% level (2.5σ) at the redshift of the foreground Hercules Supercluster. The derived properties of the absorber are consistent with theoretical expectations of the WHIM. We discuss the implication of our detection for the search for the ''missing baryons''. While this detection shows again that using signposts is a very effective strategy to search for the WHIM, follow-up observations are crucial both to strengthen the statistical significance of the detection and to rule out other interpretations. A local, z ∼ 0 O VII Kα absorption line was also clearly detected at the 4σ level, and we discuss its implications for our understanding of the hot gas content of our Galaxy.

79 ASTRONOMY AND ASTROPHYSICS↗