SEARCH · Engineering Papers

Results for “triangle counting”

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.

SourceResearch connectionFrom yearThrough year

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

11 records

All sources NASA NTRS DOE OSTI

DOE OSTI2022

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Improved Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graphs are ubiquitous in modeling complex systems and representing interactions between entities to uncover structural information of the domain. Traditionally, graph analytics workloads are challenging to efficiently scale (both strong and weak cases) on distributed memory due to the irregular memory-access driven nature (with little or no computations) of the methods. The structure of graphs and their relative distribution over the processing elements poses another level of complexity, making it difficult to attain sustainable scalability across platforms. In this paper, we discuss enhancements to TriC, a distributed-memory implementation of graph triangle counting using Message Passing Interface (MPI), which was featured in the 2020 Graph Challenge competition. We have made some incremental enhancements to TriC, primarily adopting a user-defined buffering strategy to overcome the startup problem for large graphs (by fixing the memory for intermediate data), and experimenting with probabilistic data structures such as bloom filter to improve the query response time for assessing edge existence, at the expense of increasing the overall false positive rate. These adjustments have led to a modest improvements in most cases, as compared to the previous version.

Graph Analytics, HPC↗

DOE OSTI2022

Exploring the Use of Novel Spatial Accelerators in Scientific Applications

Driven by the need to find alternative accelerators which can viably replace GPUs in next-generation Supercomputing systems, this paper proposes a methodology to enable agile application/hardware co-design. The application-first methodology provides the ability to come up with design of accelerators while working with real-world workloads, available accelerators, and system software. The iterative design process targets a set of kernels in a workload for performance estimates that can prune the design space for later phases of detailed architectural evaluations. To this effect, in this paper, a novel data-parallel device model is introduced that simulates the latency of performance-sensitive operations in an accelerator including data transfers and kernel computation using multi-core CPUs. The use of off-the-shelf simulators, such as pre-RTL simulator Aladdin or multiple tools available for exploring the design of deep neural network accelerators (e.g., Timeloop) is demonstrated for evaluation of various accelerator designs using applications with realistic inputs. Examples of multiple device configurations that are instantiable in a system are explored to evaluate the performance benefit of deploying novel accelerators. The proposed device is integrated with a programming model and system software to potentially explore the impacts of high-level programming languages/compilers and low-level effects such as task scheduling on multiple accelerators. We analyze our methodology for a set of applications that represent high-performance computing (HPC) and graph analytics. The applications include a computational chemistry kernel realized using tensor contractions, triangle counting, GraphSAGE and Breadth-first Search. These applications include kernels such as dense matrix-dense matrix multiplication, sparse matrix-spare matrix multiplication, and sparse matrix-dense vector multiplication. Our results indicate potential performance benefits and insights for system design by including accelerators that realize these kernels along-side general purpose accelerators.

AI, codesign, Accelerated Computing, Modeling and ↗

DOE OSTI2023

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

DOE OSTI2022

Illustrations of integrand-basis building at two loops

We outline the concrete steps involved in building prescriptive master integrand bases for scattering amplitudes beyond the planar limit. We highlight the role of contour choices in such bases, and illustrate the full process by constructing a complete, triangle power-counting basis at two loops for six particles. We show how collinear contour choices can be used to divide integrand bases into separately finite and divergent subspaces, and how double-poles can be used to further subdivide these spaces according to (transcendental) weight. Complete details of the basis constructed for six particles is provided in the supplementary material.

1/N expansion↗

DOE OSTI2023

Faster approximate subgraph counts with privacy

One of the most common problems studied in the context of differential privacy for graph data is counting the number of non-induced embeddings of a subgraph in a given graph. These counts have very high global sensitivity. Therefore, adding noise based on powerful alternative techniques, such as smooth sensitivity and higher-order local sensitivity have been shown to give significantly better accuracy. However, all these alternatives to global sensitivity become computationally very expensive, and to date efficient polynomial time algorithms are known only for few selected subgraphs, such as triangles, k-triangles, and k-stars. In this paper, we show that good approximations to these sensitivity metrics can be still used to get private algorithms. Using this approach, we much faster algorithms for privately counting the number of triangles in real-world social networks, which can be easily parallelized. We also give a private polynomial time algorithm for counting any constant size subgraph using less noise than the global sensitivity; we show this can be improved significantly for counting paths in special classes of graphs

Nguyen, Dung↗

DOE OSTI2025

Measurements of short-lived fission product yields from photofission of 238 U using 13.0 MeV monoenergetic photons

Photon-induced fission product yield (FPY) measurements were conducted on the isotope 238U. Fission was induced using Eγ = 13.0 MeV monoenergetic photons produced by the Triangle Universities Nuclear Laboratory’s (TUNL’s) High Intensity γ-ray Source (HIγS) facility. Short-lived FPYs were measured by performing cyclic activation of the sample using a rapid target transfer system. Following activation, the 238U target was rapidly (0.4 s) transferred to a counting station consisting of two well-shielded high-purity germanium (HPGe) detectors. The irradiation-counting cycle was repeated until the summed data had sufficient statistical accuracy. Twenty-eight unique fission products with half-lives ranging from 1 s to 450 s were identified, and their cumulative FPYs determined. Furthermore, the results are compared with previous independent FPY measurements using inverse kinematics. Good agreement between the data sets is found despite the different excitation energy distributions of the fissioning nucleus in the experiments.

Physics - Nuclear physics and radiation physics↗

DOE OSTI2022

Effective field theory of Stückelberg vector bosons

We explore the effective field theory of a vector field $X^μ$ that has a Stückelberg mass. The absence of a gauge symmetry for $X^μ$ implies Lorentz-invariant operators are constructed directly from Xμ. Beyond the kinetic and mass terms, allowed interactions at the renormalizable level include $X_μX^μH^†H, (X_μX^μ)^2$, and $X_μj^μ$, where $j^μ$ is a global current of the SM or of a hidden sector. We show that all of these interactions lead to scattering amplitudes that grow with powers of $\sqrt{s}/m_X$, except for the case of $X_μj^μ$ where $j^μ$ is a nonanomalous global current. The latter is well-known when $\textit{X}$ is identified as a dark photon coupled to the electromagnetic current, often written equivalently as kinetic mixing between $\textit{X}$ and the photon. The power counting for the energy growth of the scattering amplitudes is facilitated by isolating the longitudinal enhancement. We examine in detail the interaction with an anomalous global vector current $X_μj^μ_{\text{anom}}$, carefully isolating the finite contribution to the fermion triangle diagram. We calculate the longitudinally-enhanced observables $Z → X_γ$ (when $m_X < m_Z), f\bar{f} → X_γ$, and $Z_γ → Z_γ$ when $\textit{X}$ couples to the baryon number current. Introducing a "fake" gauge-invariance by writing $X^μ = A^μ – ∂^μπ/m_X$, the would-be gauge anomaly associated with $A_μj^μ_{\text{anom}}$ is canceled by $j^μ_{\text{anom}}∂_μπ/m_X$; this is the four-dimensional Green-Schwarz anomaly-cancellation mechanism at work. Our analysis demonstrates there is a much larger set of possible interactions that an EFT with a Stückelberg vector field can have, revealing scattering amplitudes that grow with energy. The growth of these amplitudes can be tamed by a dark Higgs sector, but this requires dark Higgs boson interactions (and reintroduces fine-tuning in the dark Higgs sector) that can be separated from X interactions only in the limit $g \ll 1$ .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Spherical time-encoded radiation imaging simulations

Radiation source localization is important for nuclear nonproliferation and can be obtained using time-encoded imaging systems with unsegmented detectors. A scintillation crystal can be used with a moving coded-aperture mask to vary the detected count rate produced from radiation sources in the far field. The modulation of observed counts over time can be used to reconstruct an image with the known coded-aperture mask pattern. Current time-encoded imaging systems incorporate cylindrical coded-aperture masks and have limits to their fully coded imaging field-of-view. This work focuses on expanding the field-of-view to 4π by using a novel spherical coded-aperture mask. A regular icosahedron is used to approximate a spherical mask. This icosahedron consists of 20 equilateral triangles; the faces of which are each subdivided into four equilateral triangle-shaped voxels which are then projected onto a spherical surface, creating an 80-voxel coded-aperture mask. Furthermore, these polygonal voxels can be made from high-Z materials for gamma-ray modulation and/or low-Z materials for neutron modulation. In this work, we present Monte Carlo N-Particle (MCNP) simulations and simple models programmed in Mathematica to explore image reconstruction capabilities of this 80-voxel coded-aperture mask.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2025

Evidence of Coherent Elastic Neutrino-Nucleus Scattering with COHERENT’s Germanium Array

We report the first detection of coherent elastic neutrino-nucleus scattering (CEvNS) on natural germanium, measured at the Spallation Neutron Source at Oak Ridge National Laboratory. The Ge-Mini detector of the COHERENT collaboration employs large-mass, low-noise, high-purity germanium spectrometers, enabling excellent energy resolution, and an analysis threshold of 1.5 keV electron-equivalent ionization energy. We observe an on-beam excess of 20.6$^{+7.1}_{−6.3}$ counts with a total exposure of 10.22 GWhkg, and we reject the no-CEvNS hypothesis with 3.9⁢𝜎 significance. The result agrees with the predicted standard model of particle physics signal rate within 2⁢𝜎.

Electroweak interaction↗

DOE OSTI2026

Enhanced sensitivity to trace 238 U impurity of sapphire via coincidence neutron activation analysis

Sapphire has mechanical and electrical properties that are advantageous for the construction of internal components of radiation detectors such as time projection chambers and bolometers. However, it has proved difficult to assess its 232 Th and 238 U content down to the picogram per gram level. Here, this work reports an experimental verification of a computational study that demonstrates 𝛾⁢𝛾 coincidence counting, coupled with neutron activation analysis (NAA), can reach ppt sensitivities. Combining results from 𝛾⁢𝛾 coincidence counting with those of earlier single-𝛾 counting based NAA shows that a sample of Saint Gobain sapphire has 232 Th and 238 U concentrations of <0.26 ppt and <2.3 ppt, respectively; the best constraints on the radiopurity of sapphire.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗