Search NASA⌕ Search

SEARCH · Search NASA

Results for “asynchronous progress”

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.

28 records · Page 2

Unified differentiable digital twin for the IOTA/FAST facility

As the design complexity of modern accelerators grows, there is more interest in using advanced simulations that have fast execution time or produce insights about accelerator state. One notable example of additional information are gradients of physical observables with respect to design parameters produced by differentiable simulations. The IOTA/FAST facility has recently begun a program to implement and experimentally validate a unified start-to-end differentiable digital twin to serve as a virtual accelerator test stand, allowing for rapid prototyping of new software and experiments with minimal beam time costs. In this contribution we will discuss our plans and progress. Specifically, we will cover the selection and benchmarking of both physics and ML codes, the development of generic interfaces between device models and surrogate or physics-based sections, and the export of the parameters through either a deterministic event loop or a fully asynchronous EPICS soft input/output controller. We will also discuss challenges in model calibration and uncertainty quantification, as well as future plans to support larger proton accelerators like PIPII and Booster.

Kuklev, Nikita [Fermilab]↗

MSFC institutional area network and ATM technology

The New Institutional Area Network (NEWIAN) at Marshall supports over 5000 end users with access to 26 file servers providing work presentation services. It is comprised of some 150 Ethernet LAN's interconnected by bridges/routers which are in turn connected to servers over two dual FDDI rings. The network supports various higher level protocols such as IP, IPX, AppleTalk (AT), and DECNet. At present IPX and AT protocols packets are routed, and IP protocol packets are bridged; however, work is in progress to route all IP packets. The impact of routing IP packets on network operation is examined. Broadband Integrated Services Data Network (BISDN), presently at various stages of development, is intended to provide voice, video, and data transfer services over a single network. BISDN will use asynchronous transfer mode (ATM) as a data transfer technique which provides for transmission, multiplexing, switching, and relaying of small size data units called cells. Limited ATM Wide Area Network (WAN) services are offered by Wiltel, AT&T, Sprint, and others. NASA is testing a pilot ATM WAN with a view to provide Program Support Communication Network services using ATM. ATM supports wide range of data rates and quality of service requirements. It is expected that ATM switches will penetrate campus networks as well. However, presently products in these areas are at various stages of development and standards are not yet complete. We examine development of ATM to help assess its role in the evolution of NEWIAN.

Amin, Ashok T.↗

End-to-end differentiable digital twin for the IOTA/FAST facility

As the design complexity of modern accelerators grows, there is more interest in using controllable-fidelity simulations that have fast execution time or can yield additional insights about accelerator state. One notable example of additional information are gradients of physical observables with respect to design parameters produced by differentiable simulations. The IOTA/FAST facility has recently begun a program to implement and experimentally validate an end-to-end digital twin to serve as a virtual accelerator test stand, allowing for rapid prototyping of new software and experiments with minimal beam time costs. In this contribution we will discuss our plans and progress. Specifically, we will cover the selection and benchmarking of both physics and ML codes for linac and ring simulation, the development of generic interfaces between surrogate and physics-based sections, and presenting the control interface as either a deterministic event loop or a fully asynchronous EPICS soft input/output controller. We will also discuss challenges in model calibration and uncertainty quantification, as well as future plans to implement larger proton accelerators like PIPII and Booster.

Kuklev, N. [Fermilab]↗

Reduced cost alternatives to premise wiring using ATM and microcellular technologies

The cost of premises wiring keeps increasing due to personnel moves, new equipment, capacity upgrades etc. It would be desirable to have a wireless interface from the workstations to the fixed network, so as to minimize the wiring changes needed. New technologies such as microcellular personal communication systems are promising to bring down the cost of wireless communication. Another promising technology is Code Division Multiple Access (CDMA), which could dramatically increase the bandwidth available for wireless connections. In addition, Asynchronous Transfer Mode (ATM) technology is emerging as a technique for integrated management of voice, data, and video traffic on a single network. The focus of this investigation will be to assess the future utility of these new technologies for reducing the premise wiring cost at KSC. One of the issues to be studied is the cost comparison of 'old' versus 'new,' especially as time and technology progress. An additional issue for closer study is a feasible time-line for progress in technological capability.

Gejji, Raghvendra R.↗

O(N) Quantum Molecular Dynamics (QMD) Algorithms, Code Requirements, Release Notes, and Library Deployment

The Exascale Computing Project (ECP) Co-design Center for Particle Applications (CoPA) is addressing the challenges for particle applications to run on upcoming exascale computing architectures. This includes short- and long-range molecular dynamics (MD), particle-in-cell (PIC), and quantum molecular dynamics (QMD). This document addresses $\mathcal{O}(N)$ QMD. The goal of this CoPA team is to develop $\mathcal{O}(N)$ linear scaling methods for QMD optimized for new and next generation architectures. This will provide the capability to simulate larger systems and run for longer timeframes than is possible today. Focus is initially on the density matrix construction. This requires efficient matrix formats and linear algebra operations for distributed architectures. A significant reduction in the wallclock time for an MD timestep is necessary to achieve practical large scale QMD. Equally challenging is to develop scalable distributed implementations. This requires the exploration of efficient data formats (dense, sparse, etc.), data decomposition and distribution across compute nodes using block- and graph-based methods. Traditional programming models such as MPI/OpenMP, hybrid MPI/OpenMP/Accelerator, as well as asynchronous task-based models will be explored to achieve maximum parallelism. Parallelism at the level of a matrix operation, solver, and/or application needs to be explored to gain the most benefit on new and emerging architectures. This report serves as a “living document” of the additions and enhancements throughout the ECP CoPA project for $\mathcal{O}(N)$ QMD. The following sections address the applications we are working with, the quantum chemistry libraries (BML and PROGRESS), and our co-design exploration through the use of a proxy application.

36 MATERIALS SCIENCE↗

A mathematical model of asynchronous data flow in parallel computers *

Abstract We present a simplified model of data flow on processors in a high-performance computing framework involving computations necessitating inter-processor communications. From this ordinary differential model, we take its asymptotic limit, resulting in a model which treats the computer as a continuum of processors and data flow as an Eulerian fluid governed by a conservation law. We derive a Hamilton–Jacobi equation associated with this conservation law for which the existence and uniqueness of solutions can be proven. We then present the results of numerical experiments for both discrete and continuum models; these show a qualitative agreement between the two and the effect of variations in the computing environment’s processing capabilities on the progress of the modelled computation.

Barnard, Richard C.↗

CCSDS - Advancing Spaceflight Technology for International Collaboration

The Consultative Committee for Space Data Systems (CCSDS) has been developing data and communications standards since 1982, with the objective of providing interoperability for enabling international collaboration for spaceflight missions. As data and communications technology has advanced, CCSDS has progressed to capitalize on existing products when available and suitable for spaceflight, and to develop innovative new approaches when available products fail. The current scope of the CCSDS architecture spans the end-to-end data architecture of a spaceflight mission, with ongoing efforts to develop and standardize cutting-edge technology. This manuscript describes the overall architecture, the position of CCSDS in the standards and international mission community, and some CCSDS processes. It then highlights in detail several of the most interesting and critical technical areas in work right now, and how they support collaborative missions. Special topics include: Delay/Disruption Tolerant Networking (DTN), Asynchronous Message Service (AMS), Multispectral/Hyperspectral Data Compression (MHDC), Coding and Synchronization, Onboard Wireless, Spacecraft Monitor and Control, Navigation, Security, and Time Synchronization/Correlation. Broad international participation in development of CCSDS standards is encouraged.

Kearney, Mike↗

Physics-Dynamics Coupling in Weather, Climate, and Earth System Models: Challenges and Recent Progress

Geophysical models of the atmosphere and ocean invariably involve parameterizations. These represent two distinct areas: a) Subgrid processes which the model cannot (yet) resolve, due to its discrete resolution, and b) sources in the equation, due to radiation for example. Hence coupling between these physics parameterizations and the resolved fluid dynamics and also between the dynamics of the different fluids in the system (air and water) is necessary. This coupling is an important aspect of geophysical models. However, often model development is strictly segregated into either physics or dynamics. Hence, this area has many more unanswered questions than in-depth understanding. Furthermore, recent developments in the design of dynamical cores (significant increase of resolution, move to non-hydrostatic equation sets etc), extended process physics (prognostic micro physics, 3D turbulence, non-vertical radiation etc) and predicted future changes of the computational infrastructure (Exascale with its need for task parallelism, data locality and asynchronous time stepping for example) is adding even more complexity and new questions.

Gross, Markus↗

Time Resolved Spectroscopy of Eclipsing Polars

No changes have been made since the last annual progress report was submitted in conjunction with a unilateral NCX. Dr. Barrett was affected by an STScI Reduction in Force (RIF). He is now employed by the Johns Hopkins University and plans to continue his research there. No expenses have been charged to this grant, however the FUSE data for the eclipsing polar V1432 Aql has been received and processed using CALFWSE v3.0.6. The resulting summed spectrum has been used for a preliminary analysis of the interstellar absorption towards V1432 Aql. We find a hydrogen column density of less than 1.5e21 cm^-2. We have used this result in the paper "X-Ray Emission and Optical Polarization of V1432 Aquilae: An Asynchronous Polar" to fix the hydrogen column density in the soft (<0.5 keV) X-ray band when analyzing the XMM-Newton spectra of this polar. This has enabled us to find an accurate temperature for the blackbody component of 88+/-2 eV, which is significantly higher than that of other polars (20 - 40 eV). We hope to complete our analysis of the phase-resolved emission line spectra of V1432 Aql and to prepare the results for publication in a refereed journal. We hope to begin work on this star within the next few months.

Barrett, Paul↗

Adaptive Runtime Features For Distributed Graph Algorithms

Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages. However, due to their dynamic and irregular nature of computation, distributed graph algorithms written in different programming models impose varying degree of workload pressure on the runtime. To cope with such vastly different workload characteristics, a runtime has to make several trade-offs. One such trade-off arises, for example, when the runtime scheduler has to choose among alternatives such as whether to execute algorithmic work, or progress the network by probing network buffers, or throttle sending messages (termed flow control). This tradeoff decides between optimizing the throughput of a runtime scheduler by increasing the rate of execution of algorithmic work, and reducing the latency of the network messages. Another trade-off exists when a decision has to be made about when to send aggregated messages in buffers (message coalescing). This decision chooses between trading off latency for network bandwidth and vice versa. At any instant, such trade-offs emphasize either on improving the quantity of work being executed (by maximizing the scheduler throughput) or on improving the quality of work (by prioritizing better work). However, encoding static policies for different runtime features (such as flow control, coalescing) can prevent graph algorithms from achieving their full potential, thus can undermine the actual performance of a distributed graph algorithm . In this paper, we investigate runtime support for distributed graph algorithms in the context of two paradigms: variants of wellknown Bulk-Synchronous Parallel model and asynchronous programming model. We explore generic runtime features such as message coalescing (aggregation) and flow control and show that execution policies of these features need to be adjusted over time to make a positive impact on the execution time of a distributed graph algorithm. Since synchronous and asynchronous graph algorithms have different workload characteristics, not all of such runtime features may be good candidates for adaptation. Each of these algorithmic paradigms may require different set of features to be adapted over time. We demonstrate which set of feature(s) can be useful in each case to achieve the right balance of work in the runtime layer. Existing implementation of different graph algorithms can benefit from adapting dynamic policies in the underlying runtime.

Firoz, Jesun S.↗