Search NASA⌕ Search

SEARCH · Search NASA

Results for “Edge Computing”

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,045 records · Page 58

Crystal ball gazing

Over the last seven years, the CPU on my desk has increased speed by two orders of magnitude, from around 1 MIP to more than 100 MIPS; more important is that it is about as fast as any uniprocessor of any type available for any price, for compute bound problems. Memory on the system is also about 100 times as big, while disk is only about 10 times as big. Local network and I/O performance have increased greatly, though not quite at the same rate as processor speed. More important, I will argue, is that the CPU's address space is 64 bits, rather than 32 bits, allowing us to rethink some time honored presumptions. The Internet has gone from a few hundred machines to a million, and now have grown to span the entire globe, and wide area networks have now becoming commercial services. 'PC's' are now real computers, bringing what was top of the line computing capability to the masses only a few years behind the leading edge. So even a year or two from now, we can anticipate commonplace desktop machines running at speeds hundreds of MIPS, with main memories in the hundreds of megabytes to a gigabyte, able to draw millions of vectors/second, and all capable of some reasonable 3D graphics. And only a few years later, this will be the $1500 PC. So the 1990's certainly brings: 64 bit processors becoming standard; BIP/BFLOP class uniprocessors; large scale multiprocessors for special purpose applications; I/O as the most significant computer engineering problem; Hierarchical data servers in everyday use; routine access to archived data around the world; and what else? What do systems such as those we will have this decade imply to those building data analysis systems today? Many of the presumptions of the 1970's and 1980's need to be reexamined in the light of 1990's technology.

Gettys, Jim↗

Modeling L 2,3 -edge X-ray absorption spectroscopy with linear response exact two-component relativistic time-dependent density functional theory

X-ray absorption spectroscopy (XAS) is a powerful tool that can provide physical insights into element-specific chemical processes and reactivities. Although relativistic time-dependent density functional theory (TDDFT) has been previously applied to model the L-edge region in XAS, there has not been a more comprehensive study of the choices of basis sets and density functional kernels available for variational relativistic excited state methods. In this work, we introduce the implementation of the generalized preconditioned locally harmonic residual algorithm to solve the complex-valued relativistic TDDFT for modeling the L-edge X-ray absorption spectra. Further, we investigate the L 2,3 -edge spectra of a series of molecular complexes using relativistic linear response TDDFT with a hybrid iterative diagonalization algorithm. A systematic error analysis was carried out with a focus on the energetics, intensities, and magnitude of L 2 –L 3 splitting compared to experiments. Additionally, the results from relativistic TDDFT calculations are compared to those computed using other theoretical methods, and the multideterminantal effects on the L-edge XAS were investigated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

2015 HPC Annual Report

Center 9300 is very proud to provide a wide range of computing and networking resources ranging from desktop support to high performance computing that enable Sandia’s national security mission needs. Our goal is to provide these services in the most efficient, secure, user friendly, and agile means necessary. High performance computing is one example of how we are delivering on this goal. Thanks to investments from NNSA’s Advanced Simulation and Computing program, coupled with Sandia’s Institutional Computing program, a wide variety of computing resources are available and used to support national security needs. This year we are expanding our high performance computing infrastructure with the procurement of institutional resources for information computing or analytics. Big data analytics has been the buzzword in the computing industry for over a decade now and industries in finance, food and drug, business, and security organizations have been leading the charge. Much like how scientific computing has changed the way science and engineering are performed, data analytics is changing just about every aspect of our lives and more especially our ability to contribute to the national security mission of Sandia. This third edition of our HPC Annual Report continues our commitment to communicate the details and impact of Sandia’s large-scale computing resources that support missions work across Sandia. The Laboratories’ and NNSA’s strategic investments in high performance computing demonstrate our commitment to keeping mission-related research on the cutting edge of science, at pace with technology advances, and at a scale that meets the toughest demands of the nation we so proudly serve.

97 MATHEMATICS AND COMPUTING↗

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗

EFFIS: and End-to-end Framework for Fusion Integrated Simulation

The purpose of the Fusion Simulation Project is to develop a predictive capability for integrated modeling of magnetically confined burning plasmas. In support of this mission, the Center for Plasma Edge Simulation has developed an End-to-end Framework for Fusion Integrated Simulation (EFFIS) that combines critical computer science technologies in an effective manner to support leadership class computing and the coupling of complex plasma physics models. We describe here the main components of EFFIS and how they are being utilized to address our goal of integrated predictive plasma edge simulation.

99 GENERAL AND MISCELLANEOUS↗

Polarization-Directed Surface Plasmon Polariton Launching

The relative intensities of propagating surface plasmons (PSPs) simultaneously launched from opposing edges of a symmetric trench structure etched into a silver thin film may be controllably varied by tuning the linear polarization of the driving field. This is demonstrated through transient multiphoton photoemission electron microscopy measurements performed using a pair of spatially separated phase-locked femtosecond pulses. Our measurements are rationalized using finite-difference time domain simulations, which reveal that the coupling efficiency into the PSP modes is inversely proportional to the magnitude of the localized surface plasmon fields excited at the trench edges. Additional experiments on single step edges also show asymmetric PSP launching with respect to polarization, analogous to the trench results. Our combined experimental and computational results allude to the interplay between localized and propagating surface plasmon modes in the trench; strong coupling to the localized modes at the edges correlates to weak coupling to the PSP modes. Simultaneous excitation of the electric fields localized at both edges of the trench results in complex interactions between the right- and left-side PSP modes with Fabry-Perot and cylindrical modes. This results in a trench width-dependent PSP intensity ratio using otherwise identical driving fields. A systematic exploration of polarization directed PSP launching from a series of trench structures reveals an optimal PSP contrast ratio of 4.2 using a 500 nm-wide trench.

Environmental Molecular Sciences Laboratory↗

ASCR Workshop on In Situ Data Management: Enabling Scientific Discovery from Diverse Data Sources

In January 2019, the U.S. Department of Energy, Office of Science program in Advanced Scientific Computing Research, convened a workshop to identify priority research directions for in situ data management (ISDM). The workshop defined ISDM as the practices, capabilities, and procedures to control the organization of data and enable the coordination and communication among heterogeneous tasks, executing simultaneously in a high-performance computing system, cooperating toward a common objective. The workshop revealed two primary, interdependent motivations for processing and managing data in situ. The first motivation is that the in situ methodology enables scientific discovery from a broad range of data sources over a wide scale of computing platforms: leadership-class systems, clusters, clouds, workstations, and embedded devices at the edge. The successful development of ISDM capabilities will benefit real-time decision-making, design optimization, and data-driven scientific discovery. The second motivation is the need to decrease data volumes. ISDM can make critical contributions to managing large data volumes from computations and experiments to minimize data movement, save storage space, and boost resource efficiency, often while simultaneously increasing scientific precision. A fundamental finding of this workshop is that the methodologies used to manage data among a variety of tasks in situ can be used to facilitate scientific discovery from many different data sources—simulation, experiment, and sensors, for example—and that being able to do so at numerous computing scales will benefit real-time decision-making, design optimization, and data-driven scientific discovery across the Office of Science mission space. Applications wanting to use the in situ capabilities include those where data analysis feeds back to the simulation, decisions are made autonomously, big data or machine learning is among the tasks to be coordinated, and computations need to be completed in real time. The workshop identified six priority research directions that highlight the components and capabilities needed for ISDM to be successful for the wide variety of applications discussed: making ISDM capabilities more pervasive, controllable, composable, and transparent, with a focus on greater coordination with the software stack and a diversity of fundamentally new data algorithms.

97 MATHEMATICS AND COMPUTING↗

ASCR Workshop on In Situ Data Management

In January 2019, the U.S. Department of Energy, Office of Science program in Advanced Scientific Computing Research, convened a workshop to identify priority research directions for in situ data management (ISDM). The workshop defined ISDM as the practices, capabilities, and procedures to control the organization of data and enable the coordination and communication among heterogeneous tasks, executing simultaneously in a high-performance computing system, cooperating toward a common objective. The workshop revealed two primary, interdependent motivations for processing and managing data in situ. The first motivation is that the in situ methodology enables scientific discovery from a broad range of data sources over a wide scale of computing platforms: leadership-class systems, clusters, clouds, workstations, and embedded devices at the edge. The successful development of ISDM capabilities will benefit real-time decision-making, design optimization, and data-driven scientific discovery. The second motivation is the need to decrease data volumes. ISDM can make critical contributions to managing large data volumes from computations and experiments to minimize data movement, save storage space, and boost resource efficiency, often while simultaneously increasing scientific precision.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

High Performance Computing Facility Operational Assessment 2015: Oak Ridge Leadership Computing Facility

Oak Ridge National Laboratory’s (ORNL’s) Leadership Computing Facility (OLCF) continues to surpass its operational target goals: supporting users; delivering fast, reliable systems; creating innovative solutions for high-performance computing (HPC) needs; and managing risks, safety, and security aspects associated with operating one of the most powerful computers in the world. The results can be seen in the cutting-edge science delivered by users and the praise from the research community. Calendar year (CY) 2015 was filled with outstanding operational results and accomplishments: a very high rating from users on overall satisfaction that ties the highest-ever mark set in CY 2014; the greatest number of core-hours delivered to research projects; the largest percentage of capability usage since the OLCF began tracking the metric in 2009; and success in delivering on the allocation of 60, 30, and 10% of core hours offered for the INCITE (Innovative and Novel Computational Impact on Theory and Experiment), ALCC (Advanced Scientific Computing Research Leadership Computing Challenge), and Director’s Discretionary programs, respectively. These accomplishments, coupled with the extremely high utilization rate, represent the fulfillment of the promise of Titan: maximum use by maximum-size simulations. The impact of all of these successes and more is reflected in the accomplishments of OLCF users, with publications this year in notable journals Nature, Nature Materials, Nature Chemistry, Nature Physics, Nature Climate Change, ACS Nano, Journal of the American Chemical Society, and Physical Review Letters, as well as many others. The achievements included in the 2015 OLCF Operational Assessment Report reflect first-ever or largest simulations in their communities; for example Titan enabled engineers in Los Angeles and the surrounding region to design and begin building improved critical infrastructure by enabling the highest-resolution Cybershake map for Southern California to date. The Titan system provides the largest extant heterogeneous architecture for computing and computational science. Usage is high, delivering on the promise of a system well-suited for capability simulations for science. This success is due in part to innovations in tracking and reporting the activity on the compute nodes, and using this information to further enable and optimize applications, extending and balancing workload across the entire node. The OLCF continues to invest in innovative processes, tools, and resources necessary to meet continuing user demand. The facility’s leadership in data analysis and workflows was featured at the Department of Energy (DOE) booth at SC15, for the second year in a row, highlighting work with researchers from the National Library of Medicine coupled with unique computational and data resources serving experimental and observational data across facilities. Effective operations of the OLCF play a key role in the scientific missions and accomplishments of its users. Building on the exemplary year of 2014, as shown by the 2014 Operational Assessment Report (OAR) review committee response in Appendix A, this OAR delineates the policies, procedures, and innovations implemented by the OLCF to continue delivering a multi-petaflop resource for cutting-edge research. This report covers CY 2015, which, unless otherwise specified, denotes January 1, 2015, through December 31, 2015.

97 MATHEMATICS AND COMPUTING↗

Use of edge-based finite elements for solving three dimensional scattering problems

Edge based finite elements are free from drawbacks associated with node based vectorial finite elements and are, therefore, ideal for solving 3-D scattering problems. The finite element discretization using edge elements is checked by solving for the resonant frequencies of a closed inhomogeneously filled metallic cavity. Great improvements in accuracy are observed when compared to the classical node based approach with no penalty in terms of computational time and with the expected absence of spurious modes. A performance comparison between the edge based tetrahedra and rectangular brick elements is carried out and tetrahedral elements are found to be more accurate than rectangular bricks for a given storage intensity. A detailed formulation for the scattering problem with various approaches for terminating the finite element mesh is also presented.

Chatterjee, A.↗

Reflections on the Shifting Experiences of Scientific Infrastructure

Infrastructure of all types is fundamental to modern work and life. Computing for scientific work, especially, extends from distributed local research sites, often at the edges of other major systems, outward into globally connected high-performance facilities and infrastructures. This commentary reviews longstanding research on the social characteristics of infrastructure. We reflect on social concerns that affect the ongoing development, use, and maintenance of a wide range of scientific computing and data resources. Reflecting on the social nature of infrastructure is timely for Computing in Science & Engineering readers, given continued emphasis on developing even more expansive platforms for data and artificial intelligence work in science (e.g., the United States’ Genesis Mission). We assert that, regardless of technological advances, the complex nature of scientific research and data will require continued understanding of longstanding and nascent social practices across varied communities. This is fundamentally necessary to build and sustain usable infrastructure or platforms that can productively advance scientific research.

Paine, Drew [Lawrence Berkeley National Laboratory↗

Nonlinear Simulations of Peeling-Ballooning Modes with Anomalous Electron Viscosity and their Role in Edge Localized Mode Crashes

A minimum set of equations based on the peeling-ballooning (P-B) model with nonideal physics effects (diamagnetic drift, ExB drift, resistivity, and anomalous electron viscosity) is found to simulate pedestal collapse when using the new BOUT++ simulation code, developed in part from the original fluid edge code BOUT. Nonlinear simulations of P-B modes demonstrate that the P-B modes trigger magnetic reconnection, which leads to the pedestal collapse. With the addition of a model of the anomalous electron viscosity under the assumption that the electron viscosity is comparable to the anomalous electron thermal diffusivity, it is found from simulations using a realistic high-Lundquist number that the pedestal collapse is limited to the edge region and the edge localized mode (ELM) size is about 5%-10% of the pedestal stored energy. This is consistent with many observations of large ELMs.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computation of Lifting Wing-Flap Configurations

Research has been carried out on the computation of lifting wing-flap configurations. The long term goal of the research is to develop improved computational tools for the analysis and design of high lift systems. Results show that state-of-the-art computational methods are sufficient to predict time-averaged lift and overall flow field characteristics on simple high-lift configurations. Recently there has been an increased interest in the problem of airframe generated noise and experiments carried out in the 7 x 10 wind tunnel at NASA Ames have identified the flap edge as an important source of noise. A follow-on set of experiments will be conducted toward the end of 1995. The computations being carried out under this project are coordinated with these experiments. In particular, the model geometry being used in the computations is the same as that in the experiments. The geometry consists of a NACA 63-215 Mod B airfoil section which spans the 7 x lO tunnel. The wing is unswept and has an aspect ratio of two. A 30% chord Fowler flap is deployed modifications of the flap edge geometry have been shown to be effective in reducing noise and the existing code is currently being used to compute the effect of a modified geometry on the edge flow.

Cantwell, Brian↗

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗

EFFIS: An End-to-end Framework for Fusion Integrated Simulation

The purpose of the Fusion Simulation Project is to develop a predictive capability for integrated modeling of magnetically confined burning plasmas. In support of this mission, the Center for Plasma Edge Simulation has developed an End-to-end Framework for Fusion Integrated Simulation (EFFIS) that combines critical computer science technologies in an effective manner to support leadership class computing and the coupling of complex plasma physics models. We describe here the main components of EFFIS and how they are being utilized to address our goal of integrated predictive plasma edge simulation.

Computer Science↗

SU-C-207-06: In Vivo Quantification of Gold Nanoparticles Using K-Edge Imaging Via Spectrum Shaping by Gold Filter

Purpose: Gold nanoparticles (AuNP) are multifunctional platforms ideal for drug delivery, targeted imaging and radiosensitization. We have investigated quantitative imaging of AuNPs using on board imager (OBI) cone beam computed tomography (CBCT). To this end, we also present, for the first time, a novel method for k-edge imaging of AuNP by filter-based spectral shaping. Methods: We used a digital 25 cm diameter water phantom, embedded with 3 cm spheres filled with AuNPs of different concentrations (0 mg/ml – 16 mg/ml). A poly-energetic X-ray spectrum of 140 kVp from a conventional X-ray tube is shaped by balanced K-edge filters to create an excess of photons right above the K-edge of gold at 80.7 keV. The filters consist of gold, tin, copper and aluminum foils. The phantom with appropriately assigned attenuation coefficients is forward projected onto a detector for each energy bin and then integrated. FKD reconstruction is performed on the integrated projections. Scatter, detector efficiency and noise are included. Results: We found that subtracting the results of two filter sets (Filter A:127 µm gold foil with 254 µm tin, 330 µm copper and 1 mm aluminum, and Filter B: 635 µm tin with 264 µm copper and 1 mm aluminum), provides substantial image contrast. The resulting filtered spectra match well below 80.7 keV, while maintaining sufficient X-ray quanta just above that. Voxel intensities of AuNP containing spheres increase linearly with AuNP concentration. K-edge imaging provides 18% more sensitivity than the tin filter alone, and 38% more sensitivity than the gold filter alone. Conclusion: We have shown that it is feasible to quantitatively detect AuNP distributions in a patient-sized phantom using clinical CBCT and K-edge spectral shaping.

60 APPLIED LIFE SCIENCES↗

ECP-ExaGraph/Submodular-b-matching

A b-MATCHING is a subset of edges M such that at most b(v) edges in M are incident on each vertex v, where b(v) is specified. We present a distributed-memory parallel algorithm, b-SUITOR, that computes a b-MATCHING with more than half the maximum weight in a graph with weights on the edges

Ferdous, S M↗

A preconditioned dual–primal finite element tearing and interconnecting method for solving three-dimensional time-harmonic Maxwell's equations

A new preconditioned dual–primal nonoverlapping domain decomposition method is proposed for the finite element solution of three-dimensional large-scale electromagnetic problems. With the aid of two Lagrange multipliers, the new method converts the original volumetric problem to a surface problem by using a higher-order transmission condition at the subdomain interfaces to significantly improve the convergence of the iterative solution of the global interface equation. Similar to the previous version, a global coarse problem related to the degrees of freedom at the subdomain corner edges is formulated to propagate the residual error to the whole computational domain at each iteration, which further increases the rate of convergence. In addition, a fully algebraic preconditioner based on matrix splitting is constructed to make the proposed domain decomposition method even more robust and scalable. Perfectly matched layers (PMLs) are considered for the boundary truncation when solving open-region problems. The influence of the PML truncation on the convergence performance is investigated by examining the convergence of the transmission condition for an interface inside the PML. Numerical examples including wave propagation and antenna radiation problems truncated with PMLs are presented to demonstrate the validity and the capability of this method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗