Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35

CommBench: Micro-Benchmarking Hierarchical Networks with Multi-GPU, Multi-NIC Nodes

Modern high-performance computing systems have multiple GPUs and network interface cards (NICs) per node. The resulting network architectures have multilevel hierarchies of subnetworks with different interconnect and software technologies. These systems offer multiple vendor-provided communication capabilities and library implementations (IPC, MPI, NCCL, RCCL, OneCCL) with APIs providing varying levels of performance across the different levels. Understanding this performance is currently difficult because of the wide range of architectures and programming models (CUDA, HIP, OneAPI). We present CommBench, a library with cross-system portability and a high-level API that enables developers to easily build microbenchmarks relevant to their use cases and gain insight into the performance (bandwidth & latency) of multiple implementation libraries on different networks. We demonstrate CommBench with three sets of microbenchmarks that profile the performance of six systems. Our experimental results reveal the effect of multiple NICs on optimizing the bandwidth across nodes and also present the performance characteristics of four available communication libraries within and across nodes of NVIDIA, AMD, and Intel GPU networks.

Hidayetoglu, Mert↗

A Hierarchical Charging Control of Plug-in Electric Vehicles with Simple Flexibility Model

The demand for plug-in electric vehicles (PEVs) is increasing exponentially, which could have significant effects on the power grid, because charging one PEV is nearly equivalent to adding three houses to the power system. Even though PEVs increase demand on the electric grid, their capability to actively interact with the grid presents excellent opportunities for load management, demand response, and various other grid services. This paper proposes an innovative scheduling and control framework to enable smart PEV charging for grid services while meeting PEV owners’ travel needs. In the proposed framework, each set of electric vehicle supply equipment (EVSE) is equipped with a controller that estimates charging power and energy flexibility based on vehicle characteristics, EVSE power rating, battery energy state, and upcoming trip information. With the charging flexibility model received from each EVSE controller, the central coordinator determines the optimal power allocation for a look-ahead time window for the given grid services. The proposed charging coordination strategy can help reduce the computational complexity and communication requirement compared with existing methods. It is also scalable to the expanding PEV fleet and robust to uncertainties in upcoming vehicle trips and future system condition. The proposed method is studied using a prototypical feeder developed at Pacific Northwest National Laboratory and detailed trip information extracted from the National Household Travel Survey.

Wu, Di↗

Advanced supramolecular design for direct ink writing of soft materials

The exciting advancements in 3D-printing of soft materials are changing the landscape of materials development and fabrication. Among various 3D-printers that are designed for soft materials fabrication, the direct ink writing (DIW) system is particularly attractive for chemists and materials scientists due to the mild fabrication conditions, compatibility with a wide range of organic and inorganic materials, and the ease of multi-materials 3D-printing. Inks for DIW need to possess suitable viscoelastic properties to allow for smooth extrusion and be self-supportive after printing, but molecularly facilitating 3D printability to functional materials remains nontrivial. While supramolecular binding motifs have been increasingly used for 3D-printing, these inks are largely optimized empirically for DIW. Hence, this review aims to establish a clear connection between the molecular understanding of the supramolecularly bound motifs and their viscoelastic properties at bulk. Herein, extrudable (but not self-supportive) and 3D-printable (self-supportive) polymeric materials that utilize noncovalent interactions, including hydrogen bonding, host–guest inclusion, metal–ligand coordination, micro-crystallization, and van der Waals interaction, have been discussed in detail. In particular, the rheological distinctions between extrudable and 3D-printable inks have been discussed from a supramolecular design perspective. Examples shown in this review also highlight the exciting macroscale functions amplified from the molecular design. Challenges associated with the hierarchical control and characterization of supramolecularly designed DIW inks are also outlined. The perspective of utilizing supramolecular binding motifs in soft materials DIW printing has been discussed. Finally, this review serves to connect researchers across disciplines to develop innovative solutions that connect top-down 3D-printing and bottom-up supramolecular design to accelerate the development of 3D-print soft materials for a sustainable future.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Application of the inverse fast multipole method as a preconditioner in a 3D Helmholtz boundary element method

Here we investigate an efficient preconditioning of iterative methods (such as GMRES) for solving dense linear systems Ax = b that follow from a boundary element method (BEM) for the 3D Helmholtz equation, focusing on the low-frequency regime. While matrix–vector products in GMRES can be accelerated through the low-frequency fast multipole method (LFFMM), the BEM often remains computationally expensive due to the large number of GMRES iterations. We propose the application of the inverse fast multipole method (IFMM) as a preconditioner to accelerate the convergence of GMRES. The IFMM is in essence an approximate direct solver that uses a multilevel hierarchical decomposition and low-rank approximations. The proposed IFMM-based preconditioning has a tunable parameter ε that balances the cost to construct a preconditioner M, which is an approximation of A -1 , and the cost to perform the iterative process by means of M. Namely, using a small (respectively, large) value of ε takes a long (respectively, short) time to construct M, while the number of iterations can be small (respectively, large). A comprehensive set of numerical examples involving various boundary value problems with complicated geometries and mixed boundary conditions is presented to validate the efficiency of the proposed method. We show that the IFMM preconditioner (with a nearly optimal ε of 10 -2 ) clearly outperforms some common preconditioners for the BEM, achieving 1.2–10.8 times speed-up of the computations, in particular when the scale of the underlying scatterer is about five wavelengths or more. In addition, the IFMM preconditioner is capable of solving complicated problems (in a reasonable amount of time) that BD preconditioner can not.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A windowed mean trajectory approximation for condensed phase dynamics

We propose a trajectory-based quasi-classical method for approximating dynamics in condensed phase systems. Building upon the previously developed optimized mean trajectory approximation that has been used to compute linear and nonlinear spectra, we borrow some ideas from filtering trajectory methods to obtain a novel semiclassical method for the dynamical propagation of density matrices. This new approximation is tested rigorously against standard multistate electronic models, spin-boson models, and models of the Fenna–Matthews–Olson complex. For dissipative systems, the current method is significantly better or as good as many other semiclassical methods available, especially at low temperatures and for off-diagonal density matrix elements, whereas for scattering models, the current method bears similar limitations as mean-field propagation schemes. All results are tested against the numerically exact hierarchical equations of motion method. In conclusion, the new method shows excellent agreement across various parameter regimes with numerically exact results, highlighting the robustness and accuracy of our approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Accurate and uncertainty-aware multi-task prediction of HEA properties using prior-guided deep Gaussian processes

Surrogate modeling techniques have become indispensable in accelerating the discovery and optimization of high-entropy alloys (HEAs), especially when integrating computational predictions with sparse experimental observations. This study systematically evaluates the training and testing performance of four prominent surrogate models—conventional Gaussian processes (cGP), Deep Gaussian processes (DGP), encoder-decoder neural networks for multi-output regression and eXtreme Gradient Boosting (XGBoost)—applied to a hybrid dataset of experimental and computational properties of the 8-component HEA system Al-Co-Cr-Cu-Fe-Mn-Ni-V. We specifically assess their capabilities in predicting correlated material properties, including yield strength, hardness, modulus, ultimate tensile strength, elongation, and average hardness under dynamic/quasi-static conditions, alongside auxiliary computational properties. The comparison highlights the strengths of hierarchical deep modeling approaches in handling heteroscedastic, heterotopic, and incomplete data commonly encountered in materials science. Our findings illustrate that combined surrogate models such as DGPs infused with machine-learned priors outperform other surrogates by effectively capturing inter-property correlations and by assimilating prior knowledge. This enhanced predictive accuracy positions the combined surrogate models as powerful tools for robust and data-efficient materials design.

36 MATERIALS SCIENCE↗

A GROUP FINDING ALGORITHM FOR MULTIDIMENSIONAL DATA SETS

We describe a density-based hierarchical group finding algorithm capable of identifying structures and substructures of any shape and density in multidimensional data sets where each dimension can be a numeric attribute with arbitrary measurement scale. This has applications in a wide variety of fields from finding structures in galaxy redshift surveys, to identifying halos and subhalos in N-body simulations and group finding in Local Group chemodynamical data sets. In general, clustering schemes require an a priori definition of a metric (a non-negative function that gives the distance between two points in a space) and the quality of clustering depends upon this choice. The general practice is to use a constant global metric which is optimal only if the clusters in the data are self-similar. For complex data configurations even the most finely tuned constant global metric turns out to be suboptimal. Moreover, the correct choice of metric also becomes increasingly important as the number of dimensions increase. To address these problems, we present an entropy-based binary space partitioning algorithm which uses a locally adaptive metric for each data point. The metric is employed to calculate the density at each point and a list of its nearest neighbors, and this information is then used to form a hierarchy of groups. Finally, the ratio of maximum to minimum density of points in a group is used to estimate the significance of the groups. Setting a threshold on this significance can effectively screen out groups arising due to Poisson noise and helps organize the groups into meaningful clusters. For a data set of N points, the algorithm requires only O(N) space and O(N(log N){sup 3}) time which makes it ideally suitable for analyzing large data sets. As an example, we apply the algorithm to identify structures in a simulated stellar halo using the full six-dimensional phase space coordinates.

79 ASTRONOMY AND ASTROPHYSICS↗

A Hierarchical Local Electricity Market for a DER-rich Grid Edge

We report with increasing penetration of distributed energy resources (DER) in the distribution system, it is critical to design market structures that enable smooth integration of DERs. A hierarchical local electricity market (LEM) structure is proposed in this paper with a secondary market (SM) at the lower level representing secondary feeders and a primary market (PM) at the upper level, representing primary feeders, in order to effectively use DERs to increase grid efficiency and resilience. The lower level SM enforces budget, power balance, and flexibility constraints and accounts for costs related to consumers, such as their disutility, flexibility limits, and commitment reliability, while the upper level PM enforces grid physics constraints such as power balance and capacity limits, and also minimizes line losses. The hierarchical LEM is extensively evaluated using a modified IEEE-123 bus with high DER penetration, with each primary feeder consisting of at least three secondary feeders. Data from a GridLAB-D model is used to emulate realistic power injections and load profiles over the course of 24 hours. The performance of the LEM is illustrated by delineating the family of power-injection profiles across the primary and secondary feeders as well as corresponding local electricity tariffs that vary across the distribution grid. Through numerical simulations, the hierarchical LEM is shown to improve the efficiency of the market in terms of lowering overall costs, including both the distribution-level locational marginal prices (d-LMP) as well as retail tariffs paid by customers. Together, it represents an overall framework for a Distribution System Operator (DSO) who can provide the oversight for the entire LEM.

24 POWER TRANSMISSION AND DISTRIBUTION↗

PETSc/TAO Users Manual (Rev. 3.19)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and opti mization that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than packages such as MATLAB or a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or lldb, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. There are several packages, built on PETSc, that may satisfy your needs without requiring directly using PETSc. We recommend reviewing these packages functionality before starting to code directly with PETSc. PETSc can be used to provide a “MPI parallel linear solver” in an otherwise sequential, or OpenMP parallel code. This approach cannot provide extremely large improvements in the application time by utilizing large numbers of MPI processes but can still improve the performance. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect true scalability to large numbers of MPI processes. See PCMPI for details on how to utilize the PETSc MPI linear solver server. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc has been supported for twenty-five years; see mailing list information on our website for information on contacting support.

97 MATHEMATICS AND COMPUTING↗

Hierarchical probing for estimating the trace of the matrix inverse on toroidal lattices

The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in our motivating application of Lattice QCD. Often, the elements of $A^{-1}$ display certain decay properties away from the non zero structure of $A$, but random vectors cannot exploit this induced structure of $A^{-1}$. Probing is a technique that, given a sparsity pattern of $A$, discovers elements of $A$ through matrix-vector multiplications with specially designed vectors. In the case of $A^{-1}$, the pattern is obtained by distance-$k$ coloring of the graph of $A$. For sufficiently large $k$, the method produces accurate trace estimates but the cost of producing the colorings becomes prohibitively expensive. More importantly, it is difficult to search for an optimal $k$ value, since none of the work for prior choices of $k$ can be reused.

Stathopoulos, Andreas↗

Integration of a Decentralized Linear-Quadratic-Gaussian Control into GSFC's Universal 3-D Autonomous Formation Flying Algorithm

A decentralized control is investigated for applicability to the autonomous formation flying control algorithm developed by GSFC for the New Millenium Program Earth Observer-1 (EO-1) mission. This decentralized framework has the following characteristics: The approach is non-hierarchical, and coordination by a central supervisor is not required; Detected failures degrade the system performance gracefully; Each node in the decentralized network processes only its own measurement data, in parallel with the other nodes; Although the total computational burden over the entire network is greater than it would be for a single, centralized controller, fewer computations are required locally at each node; Requirements for data transmission between nodes are limited to only the dimension of the control vector, at the cost of maintaining a local additional data vector. The data vector compresses all past measurement history from all the nodes into a single vector of the dimension of the state; and The approach is optimal with respect to standard cost functions. The current approach is valid for linear time-invariant systems only. Similar to the GSFC formation flying algorithm, the extension to linear LQG time-varying systems requires that each node propagate its filter covariance forward (navigation) and controller Riccati matrix backward (guidance) at each time step. Extension of the GSFC algorithm to non-linear systems can also be accomplished via linearization about a reference trajectory in the standard fashion, or linearization about the current state estimate as with the extended Kalman filter. To investigate the feasibility of the decentralized integration with the GSFC algorithm, an existing centralized LQG design for a single spacecraft orbit control problem is adapted to the decentralized framework while using the GSFC algorithm's state transition matrices and framework. The existing GSFC design uses both reference trajectories of each spacecraft in formation and by appropriate choice of coordinates and simplified measurement modeling is formulated as a linear time-invariant system. Results for improvements to the GSFC algorithm and a multiple satellite formation will be addressed. The goal of this investigation is to progressively relax the assumptions that result in linear time-invariance, ultimately to the point of linearization of the non-linear dynamics about the current state estimate as in the extended Kalman filter. An assessment will then be made about the feasibility of the decentralized approach to the realistic formation flying application of the EO-1/Landsat 7 formation flying experiment.

Folta, David C.↗

Locality Aware Concurrent Start for Stencil Applications

Stencil computations are at the heart of many physical simulations used in scientific codes. Thus, there exists a plethora of optimization efforts for this family of computations. Among these techniques, tiling techniques that allow concurrent start have proven to be very efficient in providing better performance for these critical kernels. Nevertheless, with many core designs being the norm, these optimization techniques might not be able to fully exploit locality (both spatial and temporal) on multiple levels of the memory hierarchy without compromising parallelism. It is no longer true that the machine can be seen as a homogeneous collection of nodes with caches, main memory and an interconnect network. New architectural designs exhibit complex grouping of nodes, cores, threads, caches and memory connected by an ever evolving network-on-chip design. These new designs may benefit greatly from carefully crafted schedules and groupings that encourage parallel actors (i.e. threads, cores or nodes) to be aware of the computational history of other actors in close proximity. In this paper, we provide an efficient tiling technique that allows hierarchical concurrent start for memory hierarchy aware tile groups. Each execution schedule and tile shape exploit the available parallelism, load balance and locality present in the given applications. We demonstrate our technique on the Intel Xeon Phi architecture with selected and representative stencil kernels. We show improvement ranging from 5.58% to 31.17% over existing state-of-the-art techniques.

Locality Aware execution, jagged tiling↗

Preparation and visible light photocatalytic activity of Bi{sub 2}O{sub 3}/Bi{sub 2}WO{sub 6} heterojunction photocatalysts

The Bi{sub 2}O{sub 3}/Bi{sub 2}WO{sub 6} heterojunction photocatalysts were prepared by a two-step solvothermal process using Bi(NO{sub 3}){sub 3}-ethylene glycol solution as Bi source. The catalysts were characterized by X-ray diffraction, scanning and transmission electron microscopy, X-ray photoelectron spectroscopy, and UV-vis diffuse reflection spectroscopy. The heterostructure catalysts are composed of Bi{sub 2}O{sub 3} nanoparticles as modifier and 3D Bi{sub 2}WO{sub 6} microspheres as substrate. Bi{sub 2}O{sub 3} nanoparticles with diameters of about 10-15 nm are tightly grown on the lateral surface of the Bi{sub 2}WO{sub 6} microspheres. The hierarchical Bi{sub 2}O{sub 3}/Bi{sub 2}WO{sub 6} microspheres exhibit higher photocatalytic activity than the single phase Bi{sub 2}WO{sub 6} or Bi{sub 2}O{sub 3} for the degradation of rhodamine B under visible light illumination ({lambda}>420 nm). The enhancement of the photocatalytic activity of the Bi{sub 2}O{sub 3}/Bi{sub 2}WO{sub 6} heterojunction catalysts can be ascribed to their improved light absorption property and the reduced recombination of the photoexcited electrons and holes during the photocatalytic reaction. The effect of loading amount of Bi{sub 2}O{sub 3} on the catalytic performance of the heterojunction catalysts was also investigated and the optimal content of Bi{sub 2}O{sub 3} is 3 wt%. The Bi{sub 2}O{sub 3}/Bi{sub 2}WO{sub 6} heterojunction photocatalysts are essentially stable during the photocatalytic process. - Graphical abstract: The Bi{sub 2}O{sub 3}/Bi{sub 2}WO{sub 6} heterojunction catalysts were constructured with improved photocatalytic activity, which can be ascribed to their improved light absorption property and the reduced recombination rate between photoexcited electrons and holes. Highlights: > Bi{sub 2}O{sub 3}/Bi{sub 2}WO{sub 6} heterojunction photocatalysts. > Effective separation of photoexcited electrons and holes. > High visible light photocatalytic activity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code

A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)

97 MATHEMATICS AND COMPUTING↗

Development of a Systematic and Extensible Force Field for Peptoids (STEPs)

Peptoids (N-substituted glycines) are a class of biomimetic polymers that have attracted significant attention due to their accessible synthesis and enzymatic and thermal stability relative to their naturally occurring counterparts (polypeptides). While these polymers provide the promise of more robust functional materials via hierarchical approaches, they present a new challenge for computational structure prediction for material design. The reliability of calculations hinges on the accuracy of interactions represented in the force field used to model peptoids. For proteins, structure prediction based on sequence and de novo design has made dramatic progress in recent years; however, these models are not readily transferable for peptoids. Current efforts to develop and implement peptoid-specific force fields are spread out, leading to replicated efforts and a fragmented collection of parameterized sidechains. Here, we developed a peptoid-specific force field containing 70 different side chains, using GAFF2 as starting point. The new model is validated based on the generation of Ramachandran-like plots from DFT optimization compared against force field reproduced potential energy and free energy surfaces as well as the reproduction of equilibrium cis/trans values for some residues experimentally known to form helical structures. In conclusion, equilibrium cis/trans distributions (Kct) are estimated for all parameterized residues to identify which residues have an intrinsic propensity for cis or trans states in the monomeric state.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Demonstrate FARM supervisory capabilities for a thermal energy storage problem for the DETAIL facility: IES Simulation Ecosystem Control System Development

The goal of the power dispatch problem for an Integrated Energy System (IES) is to adjust the power output and the heat flow of each component to maximize the profitability of the whole unit. Facilities that can integrate real-time digital signals, mock nuclear power, thermal energy storage and industrial heat use via high-temperature electrolysis were constructed at INL to support the research activities. The Dynamic Energy Technology and Integration Laboratory (DETAIL) houses the Microreactor Agile Non-nuclear Experimental Test Bed (MAGNET) and the Thermal Energy Distribution System (TEDS). In this report, the hierarchical control system architecture proposed in June 2023 milestone for the flexible operation of DETAIL facility is finalized and demonstrated. A brief description of the components and the corresponding Dymola models from the HYRBID repository is first provided. Then, the current control strategy is presented. In particular, the approach for generating the set-point trajectories to be fed to the PI controllers is analyzed, and its limits were identified. To preserve safe operation over both long-time and real-time horizons, the integration of a Supervisory Control layer embedding a modified version of FARM (Feasible Actuator Range Modifier) module is proposed. FARM is a component of the RAVEN-based FORCE framework designed to support HERON module at optimizing the operation of IES units. The proposed control system for DETAIL foresees FARM to be applied twice, i.e., the original version (“FARM-Validator”) aiding the solution of the power dispatch problem, and a modified version (“FARM-Supervisory”) coordinating the PID controllers. Despite the kernel of the two modules is the same, their tasks are quite different. The former intervenes at the beginning of each hour to prevent constraint violations over long time periods, the latter addresses real-time control tasks and monitors the response of constrained variables at a much finer time resolution. A tentative procedure for training the embedded Digital Twins with the experimental data is also proposed. Finally, the capabilities of the designed architecture and the impact of the added Supervisory Control layer are demonstrated by simulating a representative power dispatch scenario.

25 ENERGY STORAGE↗

Interfacing HDF5 with a scalable object‐centric storage system on hierarchical storage

Summary Object storage technologies that take advantage of multitier storage on HPC systems are emerging. However, to use these technologies at present, applications have to be modified significantly from current I/O libraries. HDF5, a widely used I/O middleware on HPC systems, provides a virtual object layer (VOL) that allows applications to connect to different storage mechanisms transparently without requiring significant code modifications. We recently designed the proactive data containers (PDC) object‐centric storage system that provides the capabilities of transparent, asynchronous, and autonomous data movement taking advantage of multiple storage tiers—a decision that has so far been left upon the user on most current systems. To enable PDC's features through HDF5 without modifying application codes, we have developed an HDF5 VOL connector that interfaces with PDC. We present in this article the connector interface and evaluate its performance on Cori, a Cray XC40 supercomputer located at the National Energy Research Scientific Computing Center (NERSC). Our evaluation demonstrates up to an 8× improvement compared with HDF5 that has the most recent optimizations.

Mu, Jingqing↗

Reciprocal insulation analysis of Hi-C data shows that TADs represent a functionally but not structurally privileged scale in the hierarchical folding of chromosomes

Understanding how regulatory sequences interact in the context of chromosomal architecture is a central challenge in biology. Chromosome conformation capture revealed that mammalian chromosomes possess a rich hierarchy of structural layers, from multi-megabase compartments to sub-megabase topologically associating domains (TADs) and sub-TAD contact domains. TADs appear to act as regulatory microenvironments by constraining and segregating regulatory interactions across discrete chromosomal regions. However, it is unclear whether other (or all) folding layers share similar properties, or rather TADs constitute a privileged folding scale with maximal impact on the organization of regulatory interactions. Here, we present a novel algorithm named CaTCH that identifies hierarchical trees of chromosomal domains in Hi-C maps, stratified through their reciprocal physical insulation, which is a single and biologically relevant parameter. By applying CaTCH to published Hi-C data sets, we show that previously reported folding layers appear at different insulation levels. We demonstrate that although no structurally privileged folding level exists, TADs emerge as a functionally privileged scale defined by maximal boundary enrichment in CTCF and maximal cell-type conservation. By measuring transcriptional output in embryonic stem cells and neural precursor cells, we show that the likelihood that genes in a domain are coregulated during differentiation is also maximized at the scale of TADs. Finally, we observe that regulatory sequences occur at genomic locations corresponding to optimized mutual interactions at the same scale. Our analysis suggests that the architectural functionality of TADs arises from the interplay between their ability to partition interactions and the specific genomic position of regulatory sequences.

Biochemistry & Molecular Biology↗