Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nodes”

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 1,441 records · Page 80

Insights into dual-functional modification for water stability enhancement of mesoporous zirconium metal–organic frameworks

The stability of metal–organic frameworks (MOFs) in water affects their ability to function as chemical catalysts, their capacity as adsorbents for separations in water vapor presence, and their usefulness as recyclable water harvesters. Here, we have examined water stability of four node-modified variants of the mesoporous MOF, NU-1000, namely formate-, Acac-, TFacac-, and Facac-NU-1000, comparing these with node-accessible NU-1000. These NU-1000 variants present ligands grafted to NU-1000's hexa-Zr(IV)-oxy nodes by displacing terminal aqua and hydroxo ligands. Facac-NU-1000, containing the most hydrophobic ligands, showed the greatest water stability, being able to undergo at least 20 water adsorption/desorption cycles without loss of water uptake capacity. Computational studies revealed dual salutary functions of installed Facac ligands: (1) enhancement of framework mechanical stability due to electrostatic interactions; and (2) transformation and shielding of the otherwise highly hydrophilic nodes from H-bonding interactions with free water, presumably leading to weaker channel-stressing capillary forces during water evacuation – consistent with trends in free energies of dehydration across the NU-1000 variants. Water harvesting and hydrolysis of chemical warfare agent simulants were examined to gauge the functional consequences of modification and mechanical stabilization of NU-1000 by Facac ligands. The studies revealed a harvesting capacity of ~1.1 L of water vapor per gram of Facac-NU-1000 per sorption cycle. They also revealed retention of catalytic MOF activity following 20 water uptake and release cycles. This study provides insights into the basis for node-ligand-engendered stabilization of wide-channel MOFs against collapse during water removal.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Nodal surfaces and interdimensional degeneracies

The aim of this paper is to shed light on the topology and properties of the nodes (i.e., the zeros of the wave function) in electronic systems. Using the “electrons on a sphere” model, we study the nodes of two-, three-, and four-electron systems in various ferromagnetic configurations (sp, p{sup 2}, sd, pd, p{sup 3}, sp{sup 2}, and sp{sup 3}). In some particular cases (sp, p{sup 2}, sd, pd, and p{sup 3}), we rigorously prove that the non-interacting wave function has the same nodes as the exact (yet unknown) wave function. The number of atomic and molecular systems for which the exact nodes are known analytically is very limited and we show here that this peculiar feature can be attributed to interdimensional degeneracies. Although we have not been able to prove it rigorously, we conjecture that the nodes of the non-interacting wave function for the sp{sup 3} configuration are exact.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-core processing and scheduling performance in CMS

Commodity hardware is going many-core. We might soon not be able to satisfy the job memory needs per core in the current single-core processing model in High Energy Physics. In addition, an ever increasing number of independent and incoherent jobs running on the same physical hardware not sharing resources might significantly affect processing performance. It will be essential to effectively utilize the multi-core architecture. CMS has incorporated support for multi-core processing in the event processing framework and the workload management system. Multi-core processing jobs share common data in memory, such us the code libraries, detector geometry and conditions data, resulting in a much lower memory usage than standard single-core independent jobs. Exploiting this new processing model requires a new model in computing resource allocation, departing from the standard single-core allocation for a job. The experiment job management system needs to have control over a larger quantum of resource since multi-core aware jobs require the scheduling of multiples cores simultaneously. CMS is exploring the approach of using whole nodes as unit in the workload management system where all cores of a node are allocated to a multi-core job. Whole-node scheduling allows for optimization of the data/workflow management (e.g. I/O caching, local merging) but efficient utilization of all scheduled cores is challenging. Dedicated whole-node queues have been setup at all Tier-1 centers for exploring multi-core processing workflows in CMS. We present the evaluation of the performance scheduling and executing multi-core workflows in whole-node queues compared to the standard single-core processing workflows.

Hernandez, J. M.↗

Singlet generation in mixed-state quantum networks

We study the generation of singlets in quantum networks with nodes initially sharing a finite number of partially entangled bipartite mixed states. We prove that singlets between arbitrary nodes in such networks can be created if and only if the initial states connecting the nodes have a particular form. We then generalize the method of entanglement percolation, previously developed for pure states, to mixed states of this form. As part of this, we find and compare different distillation protocols necessary to convert groups of mixed states shared between neighboring nodes of the network into singlets. In addition, we discuss protocols that only rely on local rules for the efficient connection of two remote nodes in the network via entanglement swapping. Further improvements of the success probability of singlet generation are developed by using particular forms of ''quantum preprocessing'' on the network. This includes generalized forms of entanglement swapping and we show how such strategies can be embedded in regular and hierarchical quantum networks.

74 ATOMIC AND MOLECULAR PHYSICS↗

Magnetism and magnetotransport in the kagome antiferromagnet Mn 3 Ge

We perform classical Monte Carlo and stochastic Landau-Lifshitz-Gilbert simulations to study the temperature-dependent magnetism of the kagome antiferromagnet Weyl metal Mn3Ge, and we find that a long-range chiral order sets in at a transition temperature well below the Neel temperature (T N ). Based on the crystalline symmetries imposed by the chiral magnetic order, we argue for the presence of multiple isoenergetic Weyl nodes (nodes that are at the same energy and with a congruent Fermi surface around them) near the chemical potential. Using the semiclassical Boltzmann equations, we show that the combined contribution to the net longitudinal magnetoconductance (LMC) and the planar Hall conductance (PHC) from tilted Weyl nodes can lead to signatures that are qualitatively distinct from that of a single pair of Weyl nodes. In particular, we show that magnetic orders with different chiralities can give rise to different periods in LMC and PHC as a function of the in-plane magnetic field direction. As a result, this is ultimately related to differences in the symmetry-imposed constraints on the Weyl nodes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Disorder-dependent slopes of the upper critical field in nodal and nodeless superconductors

In this work we study the slopes of the upper critical field S = ∂H c2 /∂T at the superconducting transition temperature T c in anisotropic superconductors with transport (nonmagnetic) scattering employing the Ginzburg-Landau theory, developed for this case by Pokrovsky and Pokrovsky [Phys. Rev. B 54, 13275 (1996)]. We find unexpected behavior of the slopes for a d -wave superconductor and, in a more general case, of materials with line nodes in the order parameter. Specifically, the presence of line nodes causes S to decrease with increasing nonmagnetic scattering parameter P = ℏ/2πT c0 τ (T c0 is for the clean limit, τ is the scattering time), unlike the nodeless case where the slope increases. In a pure d -wave case, the slope changes from decreasing to increasing when the scattering parameter approaches P ≈ 0.91 P crit , where P crit ≈ 0.28, at which T c → 0, which implies the existence of a “gapless” state in d -wave superconductors with transport scattering in the interval, 0.91 P crit < P < P crit . Furthermore, we consider the mixed (s + d)-wave order parameter with four nodes on a cylindrical Fermi surface when the d part is dominant, or no nodes at all when the s-wave phase dominates. We find that the presence of nodes causes the slope S(P) to decrease initially with increasing P, whereas in the nodeless state, S(P) monotonically increases. Therefore, relatively straightforward measurements of the disorder dependence of the slope of H c2 at T c can help distinguish between nodal and nodeless order parameters, which is particularly useful for quickly assessing newly discovered superconductors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Robust Nodal Behavior in the Thermal Conductivity of Superconducting UTe 2

The superconducting state of the heavy-fermion metal UTe 2 has attracted considerable interest because of evidence of spin-triplet Cooper pairing and nontrivial topology. Progress on these questions requires identifying the presence or absence of nodes in the superconducting gap function and their dimension. In this article, we report a comprehensive study of the influence of disorder on the thermal transport in the superconducting state of UTe 2 . Through detailed measurements of the magnetic-field dependence of the thermal conductivity in the zero-temperature limit, we obtain clear evidence of the presence of point nodes in the superconducting gap for all samples with transition temperatures ranging from 1.6 to 2.1 K obtained by different synthesis methods, including a refined self-flux method. This robustness implies the presence of symmetry-imposed nodes throughout the range studied, further confirmed via disorder-dependent calculations of the thermal transport in a model with a single pair of nodes. In addition to capturing the temperature dependence of the thermal conductivity up to 𝑇 𝑐 , this model provides some information about the locations of the nodes, suggesting a 𝐵 1⁢𝑢 or 𝐵 2⁢𝑢 symmetry for the superconducting order parameter. Additionally, comparing the new, ultrahigh conductivity samples to older samples reveals a crossover between a low-field and a high-field regime at a single value of the magnetic field in all samples. In the high-field regime, the thermal conductivity at different disorder levels differs from each other by a simple offset, suggesting that some simple principle determines the physics of the mixed state, a fact which may illuminate trends observed in other clean nodal superconductors.

spin-triplet pairing↗

Hvac: Removing I/O Bottleneck for Large-Scale Deep Learning Applications

Scientific communities are increasingly adopting deep learning (DL) models in their applications to accelerate scientific discovery processes. However, with rapid growth in the computing capabilities of HPC supercomputers, large-scale DL applications have to spend a significant portion of training time performing I/O to a parallel storage system. Previous research works have investigated optimization techniques such as prefetching and caching. Unfortunately, there exist non-trivial challenges to adopting the existing solutions on HPC supercomputers for large-scale DL training applications, which include non-performance and/or failures at extreme scale, lack of portability and generality in design, complex deployment methodology, and being limited to a specific application or dataset. To address these challenges, we propose High-Velocity AI Cache (HVAC), a distributed read-cache layer that targets and fully exploits the node-local storage or near node-local storage technology. HVAC seamlessly accelerates read I/O by aggregating node-local or near node-local storage, avoiding metadata lookups and file locking while preserving portability in the application code. We deploy and evaluate HVAC on 1,024 nodes (with over 6000 NVIDIA V100 GPUS) of the Summit supercomputer. In particular, we evaluate the scalability, efficiency, accuracy, and load distribution of HVAC compared to GPFS and XFS-on-NVMe. With four different DL applications, we observe an average 25 % performance improvement atop GPFS and 9% drop against XFS-on-NVMe, which scale linearly and are considered the performance upper bound. We envision HVAC as an important caching library for upcoming HPC supercomputers such as Frontier.

Khan, Awais↗

Resource Management for Processing Wide Area Data Streams on Supercomputers

Modern scientific instruments generate enormous amount of data. Typically, the data collected from the instruments are stored in one or more files that are then moved to a distant supercomputer for processing. The final results are sent back to the user. In order to make effective use of the time on expensive instruments, experimenters want to process the data as they are generated. They want to stream the data from instruments' memory directly to a supercomputer's memory for analysis. Since the compute nodes in a supercomputer are not connected directly to the wide area network, the data streams need to be passed through intermediate gateway nodes. As opposed to the best effort file transfers, data streaming applications require resources at a specific time for a specific period. In this paper, we present a system model for enabling data streaming through gateway nodes and an algorithm to efficiently allocate gateway node resources along with compute nodes. We evaluate the algorithm using real-world traces on the Chameleon Cloud. The results show that our system can schedule compute and gateway resources efficiently for streaming analysis.

data streaming↗

Scaling Out a Combinatorial Algorithm for Discovering Carcinogenic Gene Combinations to Thousands of GPUs

Cancer is a leading cause of death in the US, second only to heart disease. It is primarily a result of a combination of an estimated two-nine genetic mutations (multi-hit combinations). Although a body of research has identified hundreds of cancer-causing genetic mutations, we don’t know the specific combination of mutations responsible for specific instances of cancer for most cancer types. An approximate algorithm for solving the weighted set cover problem was previously adapted to identify combinations of genes with mutations that may be responsible for individual instances of cancer. However, the algorithm’s computational requirement scales exponentially with the number of genes, making it impractical for identifying more than three-hit combinations, even after the algorithm was parallelized and scaled up to a V100 GPU. Since most cancers have been estimated to require more than three hits, we scaled out the algorithm to identify combinations of four or more hits using 1000 nodes (6000 V100 GPUs with ≈48×106 processing cores) on the Summit supercomputer at Oak Ridge National Laboratory. Efficiently scaling out the algorithm required a series of algorithmic innovations and optimizations for balancing an exponentially divergent workload across processors and for minimizing memory latency and inter-node communication. We achieved an average strong scaling efficiency of 90.14% (80.96%–97.96% for 200 to 1000 nodes), compared to a 100 node run, with 84.18% scaling efficiency for 1000 nodes. With experimental validation, the multi-hit combinations identified here could provide further insight into the etiology of different cancer subtypes and provide a rational basis for targeted combination therapy.

Dash, Sajal↗

Quantum/AI Topology-Aware Latency-Adaptive HPC Workflow Scheduling Optimization

The growing demand for more powerful high-performance computing (HPC) systems has led to a steady rise in energy consumption by supercomputing worldwide. This study is focused on comparing our Application-Topology Mapper (ATMapper) to the popular Simple Linux Utility for Resource Management (SLURM) for the purpose of exploring methods that can further optimize job-scheduling within HPC systems. ATMapper is an Artificial-Intelligence based approach to job-scheduling that is currently being enhanced with quantum annealing (QA) to generate optimal schedules faster. We are applying QA to speedup our ATMapper process to achieve higher computing efficiency, thereby reducing HPC energy consumption. Here, we examine how four job-scheduling approaches perform in processor node assignment when using an example network architecture of 4 interconnected nodes. Using a specialized script, we are assessing the schedule of a computation flow with 11 interdependent tasks. The data movements among nodes were tracked to count for the number of interactions (network hops) between nodes needed to complete the tasks. The total number of hops and the job completion time were then used to quantify the efficiency of the different mapping approaches. In addition to SLURM, we also compare our ATMapper to the QA-enabled LBNL TIGER and the D-Wave Distributed Computing processor assignment approaches. The preliminary results showed that our topology-aware, latency-adaptive ATMapper is significantly more efficient when compared to the other scheduling approaches due to its load-imbalance network allocation. The scheduler displayed a computing efficiency of 53% by performing significantly fewer network hops than its alternatives. By reducing the number of hops, ATMapper was able to perform all 11 tasks by using only 3 nodes out of given 4. This research indicates the potential to use QA/AI for HPC job-scheduling. Later, we will test a SLURM simulator program to draw further comparisons on the effectiveness of ATMapper's scheduling approach. The results of this comparison will serve as a baseline for later improving SLURM's performance using a QA-enhanced ATMapper approach.

Caraveo, Braulio [University of Huston - Clear Lak↗

Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation, In: SC '14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

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.

Computer Science↗

Topology Inference of Unknown Networks Based on Robust Virtual Coordinate Systems

Learning and exploring the connectivity of unknown networks represent an important problem in practical applications of communication networks and social-media networks. Modeling large-scale networks as connected graphs is highly desirable to extract their connectivity information among nodes to visualize network topology, disseminate data, and improve routing efficiency. This paper investigates a simple measurement model in which a small subset of source nodes collect hop distance information from networked nodes in order to generate a virtual coordinate system (VCS) for networks of unknown topology. We establish the VCS to define logical distance among nodes based on principal component analysis and to determine connectivity relationship and effective routing methods. More importantly, we present a robust analytical algorithm to derive the VCS against practical issues of missing and corrupted measurements. We also develop a connectivity inference method which classifies nodes into layers based on the hop distances and derives partial information on network connectivity.

97 MATHEMATICS AND COMPUTING↗

The Dominant Influencer of Voltage Fluctuation (DIVF) for Power Distribution System

Variability in power generation at multiple consumer owned renewable energy sources can cause random voltage fluctuations, which may result in voltage violations at multiple nodes in a power distribution system. Traditional methods of voltage control are ineffective to address fast voltage variations. New dynamic methods of voltage control using end user devices can significantly benefit from the knowledge of the dominant influencer of voltage fluctuation (DIVF). This paper introduces information theoretic metrics to identify DIVF for every node in the power distribution system. A node can be DIVF due to its location in the distribution system and its capacity to generate and change its power. Use of traditional power flow algorithms to identify the DIVF is computationally complex which limits their use in real-time applications. In this work, information theoretic indicators of the DIVF are computed analytically in a computationally efficient manner, and their effectiveness to identify the DIVF is tested using the IEEE 69 node test system. From simulations, it is illustrated that differential entropy, Kullback-Leibler distance and Frechet distance are effective indicators of the DIVF and can successfully identify the most influential nodes providing the foundation for intelligent voltage control.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Space-Filling Visualization Technique for Multivariate Small World Graphs

We introduce an information visualization technique, known as GreenCurve, for large sparse graphs that exhibit small world properties. Our fractal-based design approach uses spatial cues to approximate the node connections and thus eliminates the links between the nodes in the visualization. The paper describes a sophisticated algorithm to order the neighboring nodes of a large sparse graph by solving the Fiedler vector of its graph Laplacian, and then fold the graph nodes into a space-filling fractal curve based on the Fiedler vector. The result is a highly compact visualization that gives a succinct overview of the graph with guaranteed visibility of every graph node. We show in the paper that the GreenCurve technology is (1) theoretically sustainable by introducing an error estimation metric to measure the fidelity of the new graph representation, (2) empirically rigorous by conducting a usability study to investigate its strengths and weaknesses against the traditional graph layout, and (3) pragmatically feasible by applying it to analyze stressed conditions of the large scale electric power grid on the west coast.

99 GENERAL AND MISCELLANEOUS↗

SU-E-T-206: Improving Radiotherapy Toxicity Based On Artificial Neural Network (ANN) for Head and Neck Cancer Patients

Purpose/Objective(s): The aim of this study is to build the estimator of toxicity using artificial neural network (ANN) for head and neck cancer patients Materials/Methods: An ANN can combine variables into a predictive model during training and considered all possible correlations of variables. We constructed an ANN based on the data from 73 patients with advanced H and N cancer treated with external beam radiotherapy and/or chemotherapy at our institution. For the toxicity estimator we defined input data including age, sex, site, stage, pathology, status of chemo, technique of external beam radiation therapy (EBRT), length of treatment, dose of EBRT, status of post operation, length of follow-up, the status of local recurrences and distant metastasis. These data were digitized based on the significance and fed to the ANN as input nodes. We used 20 hidden nodes (for the 13 input nodes) to take care of the correlations of input nodes. For training ANN, we divided data into three subsets such as training set, validation set and test set. Finally, we built the estimator for the toxicity from ANN output. Results: We used 13 input variables including the status of local recurrences and distant metastasis and 20 hidden nodes for correlations. 59 patients for training set, 7 patients for validation set and 7 patients for test set and fed the inputs to Matlab neural network fitting tool. We trained the data within 15% of errors of outcome. In the end we have the toxicity estimation with 74% of accuracy. Conclusion: We proved in principle that ANN can be a very useful tool for predicting the RT outcomes for high risk H and N patients. Currently we are improving the results using cross validation.

60 APPLIED LIFE SCIENCES↗

SU-E-T-314: The Application of Cloud Computing in Pencil Beam Scanning Proton Therapy Monte Carlo Simulation

Purpose: Monte Carlo simulation plays an important role for proton Pencil Beam Scanning (PBS) technique. However, MC simulation demands high computing power and is limited to few large proton centers that can afford a computer cluster. We study the feasibility of utilizing cloud computing in the MC simulation of PBS beams. Methods: A GATE/GEANT4 based MC simulation software was installed on a commercial cloud computing virtual machine (Linux 64-bits, Amazon EC2). Single spot Integral Depth Dose (IDD) curves and in-air transverse profiles were used to tune the source parameters to simulate an IBA machine. With the use of StarCluster software developed at MIT, a Linux cluster with 2–100 nodes can be conveniently launched in the cloud. A proton PBS plan was then exported to the cloud where the MC simulation was run. Results: The simulated PBS plan has a field size of 10×10cm{sup 2}, 20cm range, 10cm modulation, and contains over 10,000 beam spots. EC2 instance type m1.medium was selected considering the CPU/memory requirement and 40 instances were used to form a Linux cluster. To minimize cost, master node was created with on-demand instance and worker nodes were created with spot-instance. The hourly cost for the 40-node cluster was $0.63 and the projected cost for a 100-node cluster was $1.41. Ten million events were simulated to plot PDD and profile, with each job containing 500k events. The simulation completed within 1 hour and an overall statistical uncertainty of < 2% was achieved. Good agreement between MC simulation and measurement was observed. Conclusion: Cloud computing is a cost-effective and easy to maintain platform to run proton PBS MC simulation. When proton MC packages such as GATE and TOPAS are combined with cloud computing, it will greatly facilitate the pursuing of PBS MC studies, especially for newly established proton centers or individual researchers.

07 ISOTOPE AND RADIATION SOURCES↗