SEARCH · Engineering Papers
Results for “Algorithms.”
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.
A grand canonical genetic algorithm for the prediction of multi-component phase diagrams and testing of empirical potentials
Explore the source record for details and available documents.
A neural network clustering algorithm for the ATLAS silicon pixel detector
A novel technique to identify and split clusters created by multiple charged particles in the ATLAS pixel detector using a set of artificial neural networks is presented. Such merged clusters are a common feature of tracks originating from highly energetic objects, such as jets. Neural networks are trained using Monte Carlo samples produced with a detailed detector simulation. This technique replaces the former clustering approach based on a connected component analysis and charge interpolation. The performance of the neural network splitting technique is quantified using data from proton-proton collisions at the LHC collected by the ATLAS detector in 2011 and from Monte Carlo simulations. This technique reduces the number of clusters shared between tracks in highly energetic jets by up to a factor of three. It also provides more precise position and error estimates of the clusters in both the transverse and longitudinal impact parameter resolution.
Probing the surface-to-bulk transition: A closed-form constant-scaling algorithm for computing subsurface Green functions
Explore the source record for details and available documents.
Schwinger-Keldysh formalism on the lattice: A faster algorithm and its application to field theory
Not Available
Computationally efficient algorithms for Brownian dynamics simulation of long flexible macromolecules modeled as bead-rod chains
Not Available
Unveiling the Interplay Between Global Link Arrangements and Network Management Algorithms on Dragonfly Networks.
Abstract not provided.
Resistive Memory Device Requirements for a Neural Algorithm Accelerator.
Abstract not provided.
Spiking Neural Algorithms for Markov Process Random Walk.
Abstract not provided.
Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening.
Abstract not provided.
Comparing Binary-Swap Algorithms for Odd Factors of Processes.
Abstract not provided.
Task-Specific Compressive Optical System Design through Genetic Algorithms.
Abstract not provided.
N-k Failure Analysis Algorithm for Identification of Extreme Events for Cascading Outage Pre-screening process
Explore the source record for details and available documents.
Algorithms to Effectively Quantize Scenarios for PV Impact Analysis using QSTS Simulation.
Abstract not provided.
The Anatomy of Mr. Scan: A Dissection of Performance of an Extreme Scale GPU-Based Clustering Algorithm, In: 2014 5th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems
The emergence of leadership class systems with GPU-equipped nodes has the potential to vastly increase the performance of existing distributed applications. However, the inclusion of GPU computation into existing extreme scale distributed applications can reveal scalability issues that were absent in the CPU version. The issues exposed in scaling by a GPU can become limiting factors to overall application performance. We developed an extreme scale GPU-based application to perform data clustering on multi-billion point datasets. In this application, called Mr. Scan, we ran into several of these performance limiting issues. Through the use of complete end-to-end benchmarking of Mr. Scan (measuring time from reading and distribution to final output), we were able to identify three major sources of real world performance issues: data distribution, GPU load balancing, and system specific issues such as start-up time. These issues comprised a vast majority of the run time of Mr. Scan. Data distribution alone accounted for 68% of the total run time of Mr. Scan when processing 6.5 billion points on Cray Titan at 8192 nodes. With improvements in these areas, we have been able able to cut total run time of Mr. Scan from 17.5 minutes to 8.3 minutes when clustering 6.5 billion points.