Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “geometric partitioning”

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 19 records

Exploiting Geometric Partitioning in Task Mapping for Parallel Computes

We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network, although our methods generalize to contiguous allocations as well. The goal is to assign tasks to cores so that interdependent tasks are performed by "nearby' cores, thus lowering the distance messages must travel, the amount of congestion in the network, and the overall cost of communication. Our new method applies a geometric partitioning algorithm to both the tasks and the processors, and assigns task parts to the corresponding processor parts. We also present a number of algorithmic optimizations that exploit specific features of the network or application. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 32K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗

Multi-jagged: A scalable parallel spatial partitioning algorithm

Geometric partitioning is fast and effective for load-balancing dynamic applications, particularly those requiring geometric locality of data (particle methods, crash simulations). We present, to our knowledge, the first parallel implementation of a multidimensional-jagged geometric partitioner. In contrast to the traditional recursive coordinate bisection algorithm (RCB), which recursively bisects subdomains perpendicular to their longest dimension until the desired number of parts is obtained, our algorithm does recursive multi-section with a given number of parts in each dimension. By computing multiple cut lines concurrently and intelligently deciding when to migrate data while computing the partition, we minimize data movement compared to efficient implementations of recursive bisection. We demonstrate the algorithm's scalability and quality relative to the RCB implementation in Zoltan on both real and synthetic datasets. Our experiments show that the proposed algorithm performs and scales better than RCB in terms of run-time without degrading the load balance. Lastly, our implementation partitions 24 billion points into 65,536 parts within a few seconds and exhibits near perfect weak scaling up to 6K cores.

97 MATHEMATICS AND COMPUTING↗

Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks

We present a new method for reducing parallel applications' communication time by mapping their MPI tasks to processors in a way that lowers the distance messages travel and the amount of congestion in the network. Assuming geometric proximity among the tasks is a good approximation of their communication interdependence, we use a geometric partitioning algorithm to order both the tasks and the processors, assigning task parts to the corresponding processor parts. In this way, interdependent tasks are assigned to “nearby” cores in the network. We also present a number of algorithmic optimizations that exploit specific features of the network or application to further improve the quality of the mapping. We specifically address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network. Furthermore, our methods generalize to contiguous allocations as well, and results are shown for both contiguous and non-contiguous allocations. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 16K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗

Soft functions for generic jet algorithms and observables at hadron colliders

Here, we introduce a method to compute one-loop soft functions for exclusive N - jet processes at hadron colliders, allowing for different definitions of the algorithm that determines the jet regions and of the measurements in those regions. In particular, we generalize the N -jettiness hemisphere decomposition of ref. [1] in a manner that separates the dependence on the jet boundary from the observables measured inside the jet and beam regions. Results are given for several factorizable jet definitions, including anti- k T , XCone, and other geometric partitionings. We calculate explicitly the soft functions for angularity measurements, including jet mass and jet broadening, in pp → L + 1 jet and explore the differences for various jet vetoes and algorithms. This includes a consistent treatment of rapidity divergences when applicable. We also compute analytic results for these soft functions in an expansion for a small jet radius R . We find that the small- R results, including corrections up to O(R 2 ), accurately capture the full behavior over a large range of R .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Lagrangian Decomposition of the Atlantic Ocean Heat Transport at 26.5°N

Abstract The Atlantic Meridional Overturning Circulation (AMOC) plays a critical role in the global climate system through the redistribution of heat, freshwater and carbon. At 26.5°N, the meridional heat transport has traditionally been partitioned geometrically into vertical and horizontal circulation cells; however, attributing these components to the AMOC and Subtropical Gyre (STG) flow structures remains widely debated. Using water parcel trajectories evaluated within an eddy‐rich ocean hindcast, we present the first Lagrangian decomposition of the meridional heat transport at 26.5°N. We find that water parcels recirculating within the STG account for 37% (0.36 PW) of the total heat transport across 26.5°N, more than twice that of the classical horizontal gyre component (15%). Our findings indicate that STG heat transport cannot be meaningfully distinguished from that of the basin‐scale overturning since water parcels cooled within the gyre subsequently feed the northward, subsurface limb of the AMOC.

Tooth, Oliver J.↗

A toric varieties approach to geometrical structure of multi partite states

We investigate the geometrical structures of multipartite states based on construction of toric varieties. In particular, we describe pure quantum systems in terms of affine toric varieties and projective embedding of these varieties in complex projective spaces. We show that a quantum system can be corresponds to a toric variety of a fan which is constructed by gluing together affine toric varieties of polytopes. Moreover, we show that the projective toric varieties are the spaces of separable multipartite quantum states. The construction is a generalization of the complex multi-projective Segre variety. Our construction suggests a systematic way of looking at the structures of multipartite quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluation of PGAS communication paradigms with geometric multigrid

Partitioned Global Address Space (PGAS) languages and one-sided communication enable application developers to select the communication paradigm that balances the performance needs of applications with the productivity desires of programmers. In this paper, we evaluate three different one-sided communication paradigms in the context of geometric multigrid using the miniGMG benchmark. Although miniGMG's static, regular,and predictable communication does not exploit the ultimate potential of PGAS models, multigrid solvers appear in many contemporary applications and represent one of the most important communication patterns. We use UPC++, a PGAS extension of C++, as the vehicle for our evaluation, though our work is applicable to any of the existing PGAS languages and models. We compare performance with the highly tuned MPI baseline, and the results indicate that the most promising approach towards achieving performance and ease of programming is to use high-level abstractions, such as the multidimensional arrays provided by UPC++, that hide data aggregation and messaging in the runtime library.

Shan, H↗

Shocks in the Scrape-off Layer: Hydrodynamical Aspects (Summary) [Slides]

Hydrodynamical model provides a robust description of mass, momentum, and energy transfer. It can be used for benchmarking hydrodynamical modules of SOL codes. It clarifies the role of boundary conditions at the end-plates. It provides a “geometrical” model for partition of power flows between two divertor legs, both for the steady-state and pulsed flows. It indicates possible presence of shocks in the divertor legs. A framework for finding the shock location and strength has been developed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Ray tracing a three-dimensional scene using a hierarchical data structure

Ray tracing a three-dimensional scene made up of geometric primitives that are spatially partitioned into a hierarchical data structure. One example embodiment is a method for ray tracing a three-dimensional scene made up of geometric primitives that are spatially partitioned into a hierarchical data structure. In this example embodiment, the hierarchical data structure includes at least a parent node and a corresponding plurality of child nodes. The method includes a first act of determining that a first active ray in the packet hits the parent node and a second act of descending to each of the plurality of child nodes.

97 MATHEMATICS AND COMPUTING↗

Off-shell Partition Functions in 3d Gravity

We explore three-dimensional gravity with negative cosmological constant via canonical quantization. We focus on chiral gravity which is related to a single copy of PSL(2,R) Chern-Simons theory and is simpler to treat in canonical quantization. Its phase space for an initial value surface Σ is given by the appropriate moduli space of Riemann surfaces. We use geometric quantization to compute partition functions of chiral gravity on three-manifolds of the form Σ×S 1 , where Σ can have asymptotic boundaries. Most of these topologies do not admit a classical solution and are thus not amenable to a direct semiclassical path integral computation. We use an index theorem that expresses the partition function as an integral of characteristic classes over phase space. In the presence of n asymptotic boundaries, we use techniques from equivariant cohomology to localize the integral to a finite-dimensional integral over $\overline{M}$ g,n , which we evaluate in low genus cases. Higher genus partition functions quickly become complicated since they depend in an oscillatory way on Newton's constant. There is a precise sense in which one can isolate the non-oscillatory part which we call the fake partition function. We establish that there is a topological recursion that computes the fake partition functions for arbitrary Riemann surfaces Σ. As a result, there is a scaling limit in which the model reduces to JT gravity and our methods give a novel way to compute JT partition functions via equivariant localization.

Classical and Quantum Gravity↗

Specular reflection treatment for the 3D radiative transfer equation solved with the discrete ordinates method

The contribution of this paper relies in the development of numerical algorithms for the mathematical treatment of specular reflection on borders when dealing with the numerical solution of radiative transfer problems. The radiative transfer equation being integro-differential, the discrete ordinates method allows to write down a set of semi-discrete equations in which weights are to be calculated. The calculation of these weights is well known to be based on either a quadrature or on angular discretization, making the use of such method straightforward for the state equation. Also, the diffuse contribution of reflection on borders is usually well taken into account. However, the calculation of accurate partition ratio coefficients is much more tricky for the specular condition applied on arbitrary geometrical borders. This paper presents algorithms that calculate analytically partition ratio coefficients needed in numerical treatments. The developed algorithms, combined with a decentered finite element scheme, are validated with the help of comparisons with analytical solutions before being applied on complex geometries.

97 MATHEMATICS AND COMPUTING↗

Holographic entropy relations repackaged

We explore the structure of holographic entropy relations (associated with ‘information quantities’ given by a linear combination of entanglement entropies of spatial sub-partitions of a CFT state with geometric bulk dual). Such entropy relations can be recast in multiple ways, some of which have significant advantages. Motivated by the already-noted simplification of entropy relations when recast in terms of multipartite information, we explore additional simplifications when recast in a new basis, which we dub the K-basis, constructed from perfect tensor structures. For the fundamental information quantities such a recasting is surprisingly compact, in part due to the interesting fact that entropy vectors associated to perfect tensors are in fact extreme rays in the holographic entropy cone (as well as the full quantum entropy cone). More importantly, we prove that all holographic entropy inequalities have positive coefficients when expressed in the K-basis, underlying the key advantage over the entropy basis or the multipartite information basis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quadratic forms involving Green's and Robin functions

General inequalities for quadratic forms with coefficients depending on the values of Green's and Robin functions are obtained. These inequalities cover also the reduced moduli of strips and half-strips. Some applications of the results obtained to extremal partitioning problems and related questions of geometric function theory are discussed. Bibliography: 29 titles.

97 MATHEMATICS AND COMPUTING↗

Space-time geometry of topological phases

The 2 + 1 dimensional lattice models of Levin and Wen (2005) provide the most general known microscopic construction of topological phases of matter. Based heavily on the mathematical structure of category theory, many of the special properties of these models are not obvious. In the current paper, we present a geometrical space-time picture of the partition function of the Levin-Wen models which can be described as doubles (two copies with opposite chiralities) of underlying anyon theories. Our space-time picture describes the partition function as a knot invariant of a complicated link, where both the lattice variables of the microscopic Levin-Wen model and the terms of the Hamiltonian are represented as labeled strings of this link. This complicated link, previously studied in the mathematical literature, and known as Chain-Mail, can be related directly to known topological invariants of 3-manifolds such as the so-called Turaev-Viro invariant and the Witten-Reshitikhin-Turaev invariant. We further consider quasi-particle excitations of the Levin-Wen models and we see how they can be understood by adding additional strings to the Chain-Mail link representing quasi-particle world-lines. Our construction gives particularly important new insight into how a doubled theory arises from these microscopic models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Target design optimization for an electron accelerator driven subcritical facility with circular and square beam profiles.

A subcritical facility driven by an electron accelerator is planned at the Kharkov Institute of Physics and Technology (KIPT) in Ukraine for medical isotope production, materials research, training, and education. The conceptual design of the facility is being pursued through collaborations between ANL and KIPT. As part of the design effort, the high-fidelity analyses of various target options are performed with formulations to reflect the realistic configuration and the three dimensional geometry of each design. This report summarizes the results of target design optimization studies for electron beams with two different beam profiles. The target design optimization is performed via the sequential neutronic, thermal-hydraulic, and structural analyses for a comprehensive assessment of each configuration. First, a target CAD model is developed with proper emphasis on manufacturability to provide a basis for separate but consistent models for subsequent neutronic, thermal-hydraulic, and structural analyses. The optimizations are pursued for maximizing the neutron yield, streamlining the flow field to avoid hotspots, and minimizing the thermal stresses to increase the durability. In addition to general geometric modifications, the inlet/outlet channel configurations, target plate partitioning schemes, flow manipulations and rates, electron beam diameter/width options, and cladding material choices are included in the design optimizations. The electron beam interactions with the target assembly and the neutronic response of the subcritical facility are evaluated using the MCNPX code. the results for the electron beam energy deposition, neutron generation, and utilization in the subcritical pile are then used to characterize the axisymmetric heat generation profiles in the target assembly with explicit simulations of the beam tube, the coolant, the clad, and the target materials. Both tungsten and uranium are considered as target materials. Neutron spectra from tungsten and uranium are very similar allowing the use of either material in the subcritical assembly without changing its characteristics. However, the uranium target has a higher neutron yield, which increases the neutron flux of the subcritical assembly. Based on the considered dimensions and heat generation profiles, the commercial CFD software Star-CD is used for the thermal-hydraulic analysis of each target design to satisfy a set of thermal criteria, the most limiting of which being to maintain the water temperature 50 below the boiling point. It is found that the turbulence in the inlet channels dissipates quickly in narrow gaps between the target plates and, as a result, the heat transfer is limited by the laminar flow conditions. On average, 3-D CFD analyses of target assemblies agree well with 1-D calculations using RELAP (performed by KIPT). However, the recirculation and stagnation zones predicted with the CFD models prove the importance of a 3-D analysis to avoid the resulting hotspots. The calculated temperatures are subsequently used for the structural analysis of each target configuration to satisfy the other engineering design requirements. The thermo-structural calculations are performed mostly with NASTRAN and the results occasionally compared with the results from MARC. Both, NASTRAN and MARC are commercially available structural-mechanics analysis software. Although, a significant thermal gradient forms in target elements along the beam direction, the high thermal stresses are generally observed peripherally around the edge of thin target disks/plates. Due to its high thermal conductivity, temperatures and thermal stresses in tungsten target are estimated to be significantly lower than in uranium target. The deformations of the target disks/plates are found to be insignificant, which eliminate concerns for flow blockages in narrow coolant channels. Consistent with the specifications of the KIPT accelerator to be used in this facility, the electron beam power is 100-kW with electron energy in the range of 100 to 200 MeV. As expected, the 100 MeV electrons deposit their energy faster while the 200-MeV electrons spread their energy deposition further along the beam direction. However in that electron energy range, the energy deposition profiles near the beam window require very thin target plates/disks to limit the temperatures and thermal stresses.

43 PARTICLE ACCELERATORS↗