An O(log N) Algorithm for Massively Parallel Molecular Dynamics Simulations
Explore the source record for details and available documents.
CF algorithm↗
SEARCH · Engineering Papers
Results for “parallel coordinates”
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.
Controlling Cation-Cation Interactions in Uranyl Coordination Dimers by Varying the Length of the Dicarboxylate Linker
The chemistry of linear uranyl(V/VI) dioxo cations, [O yl –U–O yl ] +/2+ , is dominated by coordination of uranium in the equatorial plane. Effects of this constraint were evaluated by experiment and theory for gas-phase mixed-valence U V/VI coordination dimers in which uranyl moieties are linked by alkyl dicarboxylates, [(UO 2 + )(UO 2 2+ )(OOC-(CH 2 ) n-2 -COO 2– ) 2 ] – (n = 3–12). Faster O 2 -addition to dimers with short linkers n = 3 and 4, vs. n ≥ 5, suggests a structural difference. Computed structures with the shortest linkers have bridging dicarboxylates and nearly parallel, non-interacting uranyls. Longer linkers, n = 5–7, accommodate uranyl orientations with distinct U V –U VI end-on cation-cation interactions (CCIs), whereby Lewis base O yl from U V coordinates to the acid U VI , denoted as U V O yl ···U VI . The dimer structure for n = 8 has a U V –U VI side-on diamond-shape CCI, with U V O yl ···U VI and U VI O yl ···U V interactions. Addition of O 2 to the n = 4 and 5 dimers yields [(UO22+)2(OOC-(CH2)n-2-COO2–)2(O2–)]–, with U V oxidized to U VI and O 2 reduced to O 2 – . Whereas O 2 can associate to and oxidize the exposed U V center for dimers with n = 3 and 4, the more crowded U V site in the CCI structures inhibits O 2 addition. Finally, the results demonstrate rational structural control of uranyl-uranyl bonding and reactivity in small coordination complexes.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
An efficient method for computation of the manipulator inertia matrix
An efficient method of computation of the manipulator inertia matrix is presented. Using spatial notations, the method leads to the definition of the composite rigid-body spatial inertia, which is a spatial representation of the notion of augmented body. The previously proposed methods, the physical interpretations leading to their derivation, and their redundancies are analyzed. The proposed method achieves a greater efficiency by eliminating the redundancy in the intrinsic equations as well as by a better choice of coordinate frame for their projection. In this case, removing the redundancy leads to greater efficiency of the computation in both serial and parallel senses.
Fijany, Amir↗
Rao-Blackwellization for Adaptive Gaussian Sum Nonlinear Model Propagation
When dealing with imperfect data and general models of dynamic systems, the best estimate is always sought in the presence of uncertainty or unknown parameters. In many cases, as the first attempt, the Extended Kalman filter (EKF) provides sufficient solutions to handling issues arising from nonlinear and non-Gaussian estimation problems. But these issues may lead unacceptable performance and even divergence. In order to accurately capture the nonlinearities of most real-world dynamic systems, advanced filtering methods have been created to reduce filter divergence while enhancing performance. Approaches, such as Gaussian sum filtering, grid based Bayesian methods and particle filters are well-known examples of advanced methods used to represent and recursively reproduce an approximation to the state probability density function (pdf). Some of these filtering methods were conceptually developed years before their widespread uses were realized. Advanced nonlinear filtering methods currently benefit from the computing advancements in computational speeds, memory, and parallel processing. Grid based methods, multiple-model approaches and Gaussian sum filtering are numerical solutions that take advantage of different state coordinates or multiple-model methods that reduced the amount of approximations used. Choosing an efficient grid is very difficult for multi-dimensional state spaces, and oftentimes expensive computations must be done at each point. For the original Gaussian sum filter, a weighted sum of Gaussian density functions approximates the pdf but suffers at the update step for the individual component weight selections. In order to improve upon the original Gaussian sum filter, Ref. [2] introduces a weight update approach at the filter propagation stage instead of the measurement update stage. This weight update is performed by minimizing the integral square difference between the true forecast pdf and its Gaussian sum approximation. By adaptively updating each component weight during the nonlinear propagation stage an approximation of the true pdf can be successfully reconstructed. Particle filtering (PF) methods have gained popularity recently for solving nonlinear estimation problems due to their straightforward approach and the processing capabilities mentioned above. The basic concept behind PF is to represent any pdf as a set of random samples. As the number of samples increases, they will theoretically converge to the exact, equivalent representation of the desired pdf. When the estimated qth moment is needed, the samples are used for its construction allowing further analysis of the pdf characteristics. However, filter performance deteriorates as the dimension of the state vector increases. To overcome this problem Ref. [5] applies a marginalization technique for PF methods, decreasing complexity of the system to one linear and another nonlinear state estimation problem. The marginalization theory was originally developed by Rao and Blackwell independently. According to Ref. [6] it improves any given estimator under every convex loss function. The improvement comes from calculating a conditional expected value, often involving integrating out a supportive statistic. In other words, Rao-Blackwellization allows for smaller but separate computations to be carried out while reaching the main objective of the estimator. In the case of improving an estimator's variance, any supporting statistic can be removed and its variance determined. Next, any other information that dependents on the supporting statistic is found along with its respective variance. A new approach is developed here by utilizing the strengths of the adaptive Gaussian sum propagation in Ref. [2] and a marginalization approach used for PF methods found in Ref. [7]. In the following sections a modified filtering approach is presented based on a special state-space model within nonlinear systems to reduce the dimensionality of the optimization problem in Ref. [2]. First, the adaptive Gaussian sum propagation is explained and then the new marginalized adaptive Gaussian sum propagation is derived. Finally, an example simulation is presented.
state estimation↗
A chloroplast diacylglycerol lipase modulates glycerolipid pathway balance in Arabidopsis
SUMMARY Two parallel pathways compartmentalized in the chloroplast and the endoplasmic reticulum contribute to thylakoid lipid synthesis in plants, but how these two pathways are coordinated during thylakoid biogenesis and remodeling remains unknown. We report here the molecular characterization of a homologous ADIPOSE TRIGLYCERIDE LIPASE‐LIKE gene, previously referred to as ATGLL . The ATGLL gene is ubiquitously expressed throughout development and rapidly upregulated in response to a wide range of environmental cues. We show that ATGLL is a chloroplast non‐regioselective lipase with a hydrolytic activity preferentially towards 16:0 of diacylglycerol (DAG). Comprehensive lipid profiling and radiotracer labeling studies revealed a negative correlation of ATGLL expression and the relative contribution of the chloroplast lipid pathway to thylakoid lipid biosynthesis. Additionally, we show that genetic manipulation of ATGLL expression resulted in changes in triacylglycerol levels in leaves. We propose that ATGLL, through affecting the level of prokaryotic DAG in the chloroplast, plays important roles in balancing the two glycerolipid pathways and in maintaining lipid homeostasis in plants.
59 BASIC BIOLOGICAL SCIENCES↗
ORNL_AISD_NiPt
This dataset describes the nickel-platinum (NiPt) solid solution binary alloy, where the two constituent elements nickel (Ni) and platinum (Pt) are randomly placed on the face centered cubic (FCC) crystal structure, with the lattice constant of 3.840 angstroms. The dataset comprises data for three different sizes of the crystal structure: 256 atoms, 864 atoms, and 2,048 atoms, each of which contains 1900 configurations. For each size of the crystal structure, the data set was generated for concentrations ranging from 0at% of Pt to 100at% of Pt in the NiPt binary system, with increasing the concentration of Pt in the system every 5at%. For each one of the chemical compositions, 100 random configurations were generated, each with a different random seed. Each of the output files contains the mass, type, atomic coordinates, energy per atom, and forces in x, y, and z directions respectively. For each atomic configuration, the output was collected every 150 steps during the minimization stage and every 1000 steps during the replica exchange stage. Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) [1], which is a molecular dynamics code, was used to generate data for NiPt alloy. The simulation used the interatomic potential for NiPt binary system MEAM_LAMMPS_KimSeolJi_2017_PtNi__MO_020840179467_001 [3] from the OpenKIM library (Open Knowledgebase of Interatomic Models) [2]. This potential was developed based on the second nearest-neighbor modified embedded-atom method (2NN MEAM). The simulation process begins with the generation of the random NiPt structure and follows with the short minimization and replica exchange simulation. The minimization procedure adjusts atomic coordinates and performs energy minimization, which typically leads to a local potential energy minimum. The method used for the minimization was the conjugate gradient algorithm. A short replica exchange (parallel tempering) simulation involves four replicas (ensembles) of a system and follows the minimization stage. Multiple snapshots of the configuration were collected during the minimization and replica exchange stages. NiPt alloy is interesting due to its magnetic and charge transfer properties [4]. The data is provided in three compressed zipped folders: atoms256.zip, atoms864.zip, atoms2048.zip Each zipped folder contains the data that describes crystals of size 256 atoms, 864 atoms, and 2,048 atoms respectively. Each one of the three zipped folders contains the data structured in the following way: -Ni_ground_state.cfg --> atomic configuration for the pure nickel -Pt_ground_state.cfg --> atomic configuration for the pure platinum -Pt#_filtered --> folders containing atomic configurations for #at% concentration of platinum. The folder contains 100 atomic configurations, each saved in a subfolder. Each subfolder named config* is associated with a specific atomic configuration. Each of these subfolders contains files with .cfg format, corresponding to outputs for each atomic configuration The total number of atomic configurations contained in atoms256.zip is 65,046. The total number of atomic configurations contained in atoms864.zip is 63,936. The total number of atomic configurations contained in atoms2048.zip is 61,997. The total number of atomic configurations spanned by the entire dataset is 190,979. References [1] https://www.lammps.org/ [2] https://openkim.org/ [3] https://openkim.org/id/MEAM_LAMMPS_KimSeolJi_2017_PtNi__MO_020840179467_001 [4] El-Gendy, Ahmed A. and Hampel, Silke and Büccchner, Bernd and Klingeler, Rüdiger, Tuneable magnetic properties of carbon-shielded NiPt-nanoalloys, RSC Adv., volume 6, issue 57, pages 52427-52433, 2016, The Royal Society of Chemistry, doi:10.1039/C6RA05910D
36 MATERIALS SCIENCE↗
ORNL_AISD_NiPt_108atoms
This dataset describes the nickel-platinum (NiPt) solid solution binary alloy, where the two constituent elements nickel (Ni) and platinum (Pt) are randomly placed on the face centered cubic (FCC) crystal structure, with the lattice constant of 3.840 angstroms. The dataset comprises data for crystal structures with 108 atoms with 1,900 configurations. The data set was generated for concentrations ranging from 0at% of Pt to 100at% of Pt in the NiPt binary system, with increasing the concentration of Pt in the system every 5at%. For each one of the chemical compositions, 100 random configurations were generated, each with a different random seed. Each of the output files contains the mass, type, atomic coordinates, energy per atom, and forces in x, y, and z directions respectively. For each atomic configuration, the output was collected every 150 steps during the minimization stage and every 1000 steps during the replica exchange stage. Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) [1], which is a molecular dynamics code, was used to generate data for NiPt alloy. The simulation used the interatomic potential for NiPt binary system 'MEAM_LAMMPS_KimSeolJi_2017_PtNi__MO_020840179467_001' [3] from the OpenKIM library (Open Knowledgebase of Interatomic Models) [2]. This potential was developed based on the second nearest-neighbor modified embedded-atom method (2NN MEAM). The simulation process begins with the generation of the random NiPt structure and follows with the short minimization and replica exchange simulation. The minimization procedure adjusts atomic coordinates and performs energy minimization, which typically leads to a local potential energy minimum. The method used for the minimization was the conjugate gradient algorithm. A short replica exchange (parallel tempering) simulation involves four replicas (ensembles) of a system and follows the minimization stage. Multiple snapshots of the configuration were collected during the minimization and replica exchange stages. NiPt alloy is interesting due to its magnetic and charge transfer properties [4]. The data is provided in a compressed zipped folders atoms108.zip. The zipped folder contains the data structured in the following way: - Ni_ground_state.cfg --> atomic configuration for the pure nickel - Pt_ground_state.cfg --> atomic configuration for the pure platinum - Pt#_filtered --> folders containing atomic configurations for #at% concentration of platinum. The folder contains 100 atomic configurations, each saved in a subfolder - Each subfolder named config* is associated with a specific atomic configuration. Each of these subfolders contains files with .cfg format, corresponding to outputs for each atomic configuration The total number of atomic configurations contained in atoms108.zip is 66,132. This dataset is an extension to the dataset ORNL_AISD_NiPt [5] that has been previously released with crystal structures of 256 atoms, 864 atoms, and 2,048 atoms, with the same methodology for data collection. References [1] https://www.lammps.org/ [2] https://openkim.org/ [3] https://openkim.org/id/MEAM_LAMMPS_KimSeolJi_2017_PtNi__MO_020840179467_001 [4] El-Gendy, Ahmed A. and Hampel, Silke and Büchner, Bernd and Klingeler, Rüdiger, Tuneable magnetic properties of carbon-shielded NiPt-nanoalloys, RSC Adv., volume 6, issue 57, pages 52427-52433, 2016, The Royal Society of Chemistry, doi:10.1039/C6RA05910D [5] M. Karabin, M. Lupo Pasini, and M. Eisenbach. ORNL_AISD_NiPt. United States: N. p., 2023. Web. doi:10.13139/OLCF/1958172.
36 MATERIALS SCIENCE↗
Orbit-averaging and deposition accuracy for runaway electron beams in hybrid kinetic-MHD simulations of the runaway plateau
We develop a new procedure that combines the kinetic orbit runaway electron code (KORC) and the NIMROD extended-magnetohydrodynamic code to simulate runaway electrons (REs) in the post-disruption plateau. KORC integrates guiding-center orbits, with a barycentric-based binary search strategy providing initial guesses for the Newton–Raphson logical-to-physical coordinate inversion, ensuring reliable particle-to-mesh mapping in NIMROD, whose fields remain static for the present study. Samples are drawn in accord with experimental parallel current profiles of RE beams during the plateau phase. Deposition in NIMROD is verified through comparison with a Python-based finite-element code that ensures periodicity in the poloidal direction and continuity at the magnetic axis. Accurate representation of near-axis fields requires finer mesh resolution to prevent under- and overshoots in current density from orbit inaccuracies. Yet, at a fixed particle count, increasing mesh resolution amplifies statistical noise in the deposited fields. An orbit-averaging method accumulates partial current deposits over multiple kinetic steps and reduces the statistical noise with little added computational cost. By coupling kinetic routines from KORC directly into the NIMROD codebase, these developments lay essential groundwork for future self-consistent KORC–NIMROD coupling.
Algorithms and data structure↗
Coordination chemistry in fused-salt solutions
Spectrophotometric work on structural determinations with fused-salt solutions is reviewed. Constraints placed on the method, as well as interpretation of the spectra, are discussed with parallels drawn to aqueous spectrophotometric curves of the same materials.
Gruen, D. M.↗
Nitrogen Fixation Symposium at ICCC 2024 (Final Report)
The symposium "Advances in Nitrogen Fixation" was part of the 45th International Conference on Coordinate Chemistry (ICCC45) in Fort Collins, Colorado. It was organized by Patrick Holland (US) and Sven Schneider (Germany). The symposium was one of four parallel sessions on the first full day of the conference (Monday July 29, 2024). There were also three posters associated with the symposium.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Multitasking the INS3D-LU code on the Cray Y-MP
This paper presents the results of multitasking the INS3D-LU code on eight processors. The code is a full Navier-Stokes solver for incompressible fluid in three dimensional generalized coordinates using a lower-upper symmetric-Gauss-Seidel implicit scheme. This code has been fully vectorized on oblique planes of sweep and parallelized using autotasking with some directives and minor modifications. The timing results for five grid sizes are presented and analyzed. The code has achieved a processing rate of over one Gflops.
Fatoohi, Rod↗
Application of Variational Methods to the Thermal Entrance Region of Ducts
A variational method is presented for solving eigenvalue problems which arise in connection with the analysis of convective heat transfer in the thermal entrance region of ducts. Consideration is given, to both situations where the temperature profile depends upon one cross-sectional coordinate (e.g. circular tube) or upon two cross-sectional coordinates (e.g. rectangular duct). The variational method is illustrated and verified by application to laminar heat transfer in a circular tube and a parallel-plate channel, and good agreement with existing numerical solutions is attained. Then, application is made to laminar heat transfer in a square duct as a check, an alternate computation for the square duct is made using a method indicated by Misaps and Pohihausen. The variational method can, in principle, also be applied to problems in turbulent heat transfer.
Sparrow, E. M.↗
DSN Beowulf Cluster-Based VLBI Correlator
The NASA Deep Space Network (DSN) requires a broadband VLBI (very long baseline interferometry) correlator to process data routinely taken as part of the VLBI source Catalogue Maintenance and Enhancement task (CAT M&E) and the Time and Earth Motion Precision Observations task (TEMPO). The data provided by these measurements are a crucial ingredient in the formation of precision deep-space navigation models. In addition, a VLBI correlator is needed to provide support for other VLBI related activities for both internal and external customers. The JPL VLBI Correlator (JVC) was designed, developed, and delivered to the DSN as a successor to the legacy Block II Correlator. The JVC is a full-capability VLBI correlator that uses software processes running on multiple computers to cross-correlate two-antenna broadband noise data. Components of this new system (see Figure 1) consist of Linux PCs integrated into a Beowulf Cluster, an existing Mark5 data storage system, a RAID array, an existing software correlator package (SoftC) originally developed for Delta DOR Navigation processing, and various custom- developed software processes and scripts. Parallel processing on the JVC is achieved by assigning slave nodes of the Beowulf cluster to process separate scans in parallel until all scans have been processed. Due to the single stream sequential playback of the Mark5 data, some ramp-up time is required before all nodes can have access to required scan data. Core functions of each processing step are accomplished using optimized C programs. The coordination and execution of these programs across the cluster is accomplished using Pearl scripts, PostgreSQL commands, and a handful of miscellaneous system utilities. Mark5 data modules are loaded on Mark5 Data systems playback units, one per station. Data processing is started when the operator scans the Mark5 systems and runs a script that reads various configuration files and then creates an experiment-dependent status database used to delegate parallel tasks between nodes and storage areas (see Figure 2). This script forks into three processes: extract, translate, and correlate. Each of these processes iterates on available scan data and updates the status database as the work for each scan is completed. The extract process coordinates and monitors the transfer of data from each of the Mark5s to the Beowulf RAID storage systems. The translate process monitors and executes the data conversion processes on available scan files, and writes the translated files to the slave nodes. The correlate process monitors the execution of SoftC correlation processes on the slave nodes for scans that have completed translation. A comparison of the JVC and the legacy Block II correlator outputs reveals they are well within a formal error, and that the data are comparable with respect to their use in flight navigation. The processing speed of the JVC is improved over the Block II correlator by a factor of 4, largely due to the elimination of the reel-to-reel tape drives used in the Block II correlator.
Rogstad, Stephen P.↗
An analysis of blade vortex interaction aerodynamics and acoustics
The impulsive noise associated with helicopter flight due to Blade-Vortex Interaction, sometimes called blade slap is analyzed especially for the case of a close encounter of the blade-tip vortex with a following blade. Three parts of the phenomena are considered: the tip-vortex structure generated by the rotating blade, the unsteady pressure produced on the following blade during the interaction, and the acoustic radiation due to the unsteady pressure field. To simplify the problem, the analysis was confined to the situation where the vortex is aligned parallel to the blade span in which case the maximum acoustic pressure results. Acoustic radiation due to the interaction is analyzed in space-fixed coordinates and in the time domain with the unsteady pressure on the blade surface as the source of chordwise compact, but spanwise non-compact radiation. Maximum acoustic pressure is related to the vortex core size and Reynolds number which are in turn functions of the blade-tip aerodynamic parameters. Finally noise reduction and performance are considered.
Lee, D. J.↗
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.↗
Bounce-Averaged Hamiltonian for Charged Particles in an Axisymmetric but Nondipolar Model Magnetosphere
In order to facilitate bounce-averaged guiding center simulations of geomagnetically trapped particles, we express the kinetic energy of a particle with magnetic coordinates (L,phi) as an analytic function of the first two adiabatic invariants (M, J) and the L value of the field line. The magnetic field model is axisymmetric, consisting of a dipolar B field plus a uniform southward magnetic field parallel to the dipole moment mu(sub E). This model magnetosphere is surrounded by a circular equatorial neutral line whose radius b is an adjustable parameter. The L value of a field line is (by definition) inversely proportional to the flux enclosed by the corresponding magnetic shell of equatorial radius r(sub 0), and the L value at the neutral line (r(sub 0) = b) is denoted L*. The azimuthal coordinate phi measures magnetic local time. The best functional representation found for the normalized difference (L(exp 3)a(exp 3)/mu(sub E))(B(sub m) - B(sub 0)) between mirror-point field B(sub m) and equatorial field B(sub 0) along any field line is a 5-term expansion in powers (2/3 through 6/3) of the quantity X equivalent to (La/mu(sub E))(exp 1/2)K, where K equivalent to (J(exp 2)/8m(sub 0)M)(exp 1/2) is an adiabatically conserved quantity independent of particle energy, m(sub 0) is the rest mass of the particle, and a is the radius of the Earth. This functional form is motivated by results for limiting cases in which particles mirror very near and very far from the magnetic equator. Expansion coefficients corresponding to various powers of X are obtained from least squares fits to numerically computed results for X as a function of L and B(sub m). These are accurately expressible as fourth-order polynomials in (r(sub 0)/b)(exp 3), hence indirectly as functions of L/L* = 3La/2b. This representation, which leads (except for a manageably small region of parameter space) to better than 1% accuracy in the specification of B(sub m) as a function of K and L, allows bounce-averaged guiding center simulations to be performed without actually tracing the bounce motions of individual particles. Bounce-averaged drifts L' (meridional) and phi' (azimuthal) are proportional to derivatives of the Hamiltonian H (sum of kinetic and potential energies) with respect to phi and L, respectively. Our formulation thus provides a computationally efficient method for tracing the bounce-averaged adiabatic motion (conserving all three invariants) and nonadiabatic transport (violating the third invariant while conserving the first two invariants) of geomagnetically trapped particles in the model magnetosphere.
Schulz, Michael↗
A Sparse Tensor Benchmark Suite for CPUs and GPUs
Tensor computations present significant performance chal- lenges that impact a wide spectrum of applications ranging from machine learning, healthcare analytics, social network analysis, data mining to quantum chemistry and signal processing. Efforts to improve the perfor- mance of tensor computations include exploring data layout, execution scheduling, and parallelism in common tensor kernels. This work presents a benchmark suite for arbitrary-order sparse tensor kernels using state- of-the-art tensor formats: coordinate (COO) and hierarchical coordinate (HiCOO) on CPUs and GPUs. It presents a set of reference tensor kernel implementations that are compatible with real-world tensors and power law tensors extended from synthetic graph generation techniques. We also propose Roofline performance models for these kernels to provide insights of computer platforms from sparse tensor view. This benchmark suite along with the synthetic tensor generator is publicly available.
Li, Jiajia↗
Planar double delay-line readout technique for microchannel plate detectors
A two-dimensional position-sensitive electrical readout system for microchannel plate detectors in spectroscopic applications has been devised. Two adjacent parallel coplanar delay lines are used. The difference in time of arrival of the electron event signal between the ends of the delay lines gives one coordinate of the centroid of each event pulse. The ratio of the event amplitudes on the two delay lines gives the orthogonal coordinate by means of charge partitioning. The performance characteristics of operational double delay lines for systems of this type are presented.
Lampton, M.↗