Search NASA⌕ Search

SEARCH · Search NASA

Results for “Serialization”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Efficient Approximation Algorithms for Weighted $b$-Matching

We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a speci ed number b(v) of edges in M are incident on each vertex v. Subject to this restriction we maximize the sum of the weights of the edges in M. We prove that the b-Suitor algorithm computes the same b-Matching as the one obtained by the greedy algorithm for the problem. We implement the algorithm on serial and shared-memory parallel processors, and compare its performance against a collection of approximation algorithms that have been proposed earlier. Our results show that the b-Suitor algorithm outperforms the Greedy and Locally Dominant edge algorithms by one to two orders of magnitude on a serial processor. The b-Suitor algorithm has a high degree of concurrency, and it scales well up to 240 threads on a shared memory multiprocessor. The b-Suitor algorithm outperforms the Locally Dominant edge algorithm by a factor of fourteen on 16 cores of an Intel Xeon multiprocessor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A Framework Including Recombination for Analyzing the Dynamics of Within-Host HIV Genetic Diversity

This paper presents a novel population genetic model and a computationally and statistically tractable framework for analyzing within-host HIV diversity based on serial samples of HIV DNA sequences. This model considers within-host HIV evolution during the chronic phase of infection and assumes that the HIV population is homogeneous at the beginning, corresponding to the time of seroconversion, and evolves according to the Wright-Fisher reproduction model with recombination and variable mutation rate across nucleotide sites. In addition, the population size and generation time vary over time as piecewise constant functions of time. Under this model I approximate the genealogical and mutational processes for serial samples of DNA sequences by a continuous coalescent-recombination process and an inhomogeneous Poisson process, respectively. Based on these derivations, an efficient algorithm is described for generating polymorphisms in serial samples of DNA sequences under the model including various substitution models. Extensions of the algorithm are also described for other demographic scenarios that can be more suitable for analyzing the dynamics of genetic diversity of other pathogens in vitro and in vivo . For the case of the infinite-sites model, I derive analytical formulas for the expected number of polymorphic sites in sample of DNA sequences, and apply the developed simulation and analytical methods to explore the fit of the model to HIV genetic diversity based on serial samples of HIV DNA sequences from 9 HIV-infected individuals. The results particularly show that the estimates of the ratio of recombination rate over mutation rate can vary over time between very high and low values, which can be considered as a consequence of the impact of selection forces.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

Verifying speculative multithreading in an application

Verifying speculative multithreading in an application executing in a computing system, including: executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied; executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and determining whether a speculative multithreading error exists including: comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Verifying speculative multithreading in an application

Verifying speculative multithreading in an application executing in a computing system, including: executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied; executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and determining whether a speculative multithreading error exists including: comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Wire like link for cycle reproducible and cycle accurate hardware accelerator

First and second field programmable gate arrays are provided which implement first and second blocks of a circuit design to be simulated. The field programmable gate arrays are operated at a first clock frequency and a wire like link is provided to send a plurality of signals between them. The wire like link includes a serializer, on the first field programmable gate array, to serialize the plurality of signals; a deserializer on the second field programmable gate array, to deserialize the plurality of signals; and a connection between the serializer and the deserializer. The serializer and the deserializer are operated at a second clock frequency, greater than the first clock frequency, and the second clock frequency is selected such that latency of transmission and reception of the plurality of signals is less than the period corresponding to the first clock frequency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Accelerating functional verification of an integrated circuit

Illustrative embodiments include a method, system, and computer program product for accelerating functional verification in simulation testing of an integrated circuit (IC). Using a processor and a memory, a serial operation is replaced with a direct register access operation, wherein the serial operation is configured to perform bit shifting operation using a register in a simulation of the IC. The serial operation is blocked from manipulating the register in the simulation of the IC. Using the register in the simulation of the IC, the direct register access operation is performed in place of the serial operation.

42 ENGINEERING↗
DOE OSTI2017

Cyber security using multi-threaded architecture data diode at the NBSR - 114

Ongoing upgrades for the control room of the National Bureau of Standards Reactor (NBSR) located at the National Institute of Standards and Technology (NIST) require the ability to collect sensor data from the secured reactor network and transfer to the outside network for trend analysis, while maintaining the security of the reactor network. To accomplish this, a data diode was created to provide a physical barrier that prevents any outside data from reaching the secured reactor network. The hardware of the data diode consists of two embedded computers, running Unix based operating systems, connected by three DB-9 serial cables. The serial cables have been modified so that only two wires, a ground and a transmission line, provide connection between the computers. The data diode relies on a multi-threaded architecture to collect and simultaneously transfer data over three serial connections. A software program, implemented in Java, has been written to request data from the digital recorders installed to monitor the NBSR process instrumentation and transfer that data across the serial connections. The data diode can collect over 1200 data points from multiple digital recorders each second. The collected data can then be stored in a relational database for later analysis. The source codes for the software are available open source on GitHub. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2019

32 Channel × 40 Gb/s WDM optical communication system utilizing different configurations of hybrid fiber amplifier

In this paper, a simulation analysis of 40 Gb/s wavelength division multiplexing system of 32 channels is implemented through RZ modulation format by using a different hybrid fiber amplifier (HFA) configurations, namely, serial HFA, parallel HFA, and combined serial–parallel hybrid fiber amplifier (CSP-HFA). The performance of the proposed amplifiers is compared in terms of average gain level, average noise figure, flat gain bandwidth. In addition, quality factor, bit error rate, and eye diagram for the demonstrated 32 channel × 40 Gb/s wavelength division multiplexing optical communication system utilizing different configurations of the hybrid fiber amplifier is compared. The CSP-HFA shows better performance than serial and parallel hybrid amplifiers in terms of wider flat gain bandwidth, higher quality factor, lower bit error rate, and wider and clearer eye opening. Furthermore, CSP-HFA exhibits a flat gain bandwidth of 65 nm with an acceptable average gain of 16 dB and average noise figure of 7 dB.

42 ENGINEERING↗
DOE OSTI2014

The role of growth factors in maintenance of stemness in bone marrow-derived mesenchymal stem cells

Highlights: • Expression of FGF-2, FGF-4, EGF, and HGF decreased during long-term culture of BMSCs. • Loss of growth factors induced autophagy, senescence and decrease of stemness. • FGF-2 increased proliferation potential via AKT and ERK activation in BMSCs. • FGF-2 suppressed LC3-II expression and down-regulated senescence of BMSCs. • HGF was important in maintenance of the differentiation potential of BMSCs. - Abstract: Mesenchymal stem cells (MSCs) are an active topic of research in regenerative medicine due to their ability to secrete a variety of growth factors and cytokines that promote healing of damaged tissues and organs. In addition, these secreted growth factors and cytokines have been shown to exert an autocrine effect by regulating MSC proliferation and differentiation. We found that expression of EGF, FGF-4 and HGF were down-regulated during serial passage of bone marrow-derived mesenchymal stem cells (BMSCs). Proliferation and differentiation potentials of BMSCs treated with these growth factors for 2 months were evaluated and compared to BMSCs treated with FGF-2, which increased proliferation of BMSCs. FGF-2 and -4 increased proliferation potentials at high levels, about 76- and 26-fold, respectively, for 2 months, while EGF and HGF increased proliferation of BMSCs by less than 2.8-fold. Interestingly, differentiation potential, especially adipogenesis, was maintained only by HGF treatment. Treatment with FGF-2 rapidly induced activation of AKT and later induced ERK activation. The basal level of phosphorylated ERK increased during serial passage of BMSCs treated with FGF-2. The expression of LC3-II, an autophagy marker, was gradually increased and the population of senescent cells was increased dramatically at passage 7 in non-treated controls. But FGF-2 and FGF-4 suppressed LC3-II expression and down-regulated senescent cells during long-term (i.e. 2 month) cultures. Taken together, depletion of growth factors during serial passage could induce autophagy, senescence and down-regulation of stemness (proliferation via FGF-2/-4 and differentiation via HGF) through suppression of AKT and ERK signaling.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

TOUGH3: A new efficient version of the TOUGH suite of multiphase flow and transport simulators

The TOUGH suite of nonisothermal multiphase flow and transport simulators has been updated by various developers over many years to address a vast range of challenging subsurface problems. The increasing complexity of the simulated processes as well as the growing size of model domains that need to be handled call for an improvement in the simulator's computational robustness and efficiency. Moreover, modifications have been frequently introduced independently, resulting in multiple versions of TOUGH that (1) led to inconsistencies in feature implementation and usage, (2) made code maintenance and development inefficient, and (3) caused confusion to users and developers. TOUGH3—a new base version of TOUGH—addresses these issues. It consolidates both the serial (TOUGH2 V2.1) and parallel (TOUGH2-MP V2.0) implementations, enabling simulations to be performed on desktop computers and supercomputers using a single code. New PETSc parallel linear solvers are added to the existing serial solvers of TOUGH2 and the Aztec solver used in TOUGH2-MP. The PETSc solvers generally perform better than the Aztec solvers in parallel and the internal TOUGH3 linear solver in serial. TOUGH3 also incorporates many new features, addresses bugs, and improves the flexibility of data handling. So due to the improved capabilities and usability, TOUGH3 is more robust and efficient for solving tough and computationally demanding problems in diverse scientific and practical applications related to subsurface flow modeling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multichannel Analysis of Surface Waves Accelerated (MASWAccelerated): Software for efficient surface wave inversion using MPI and GPUs

Multichannel Analysis of Surface Waves (MASW) is a technique frequently used in geotechnical engineering and engineering geophysics to infer 1D layered models of seismic shear wave velocities in the top tens to hundreds of meters of the subsurface. We aim to accelerate MASW calculations by capitalizing on modern computer hardware available in the workstations of most engineers: multiple cores and graphics processing units (GPUs). We propose new parallel and GPU accelerated algorithms for computing 1D MASW inversion, and provide software implementations in C using Message Passing Interface (MPI) and CUDA. These algorithms take advantage of sparsity that arises in the problem, and the work balance between processes considers typical data trends. We compare our methods to an existing open source Matlab MASW tool. Our serial C implementation achieves a 2x speedup over the Matlab software, and we continue to see improvements by parallelizing the problem with MPI. Here we see nearly perfect strong and weak scaling for uniform data, and improve strong scaling for realistic data by repartitioning the problem to process mapping. By utilizing GPUs available on most modern workstations, we observe an additional 1.3x speedup over the serial C implementation on the first use of the method. We typically repeatedly evaluate theoretical dispersion curves as part of an optimization procedure, and on the GPU the kernel can be cached for faster reuse on later runs. We observe a 3.2x speedup on the cached GPU runs compared to the serial C runs. This work is the first open-source parallel or GPU-accelerated software tool for MASW imaging, and should enable geotechnical engineers to fully utilize all computer hardware at their disposal.

58 GEOSCIENCES↗
DOE OSTI2013

Fixman compensating potential for general branched molecules

The technique of constraining high frequency modes of molecular motion is an effective way to increase simulation time scale and improve conformational sampling in molecular dynamics simulations. However, it has been shown that constraints on higher frequency modes such as bond lengths and bond angles stiffen the molecular model, thereby introducing systematic biases in the statistical behavior of the simulations. Fixman proposed a compensating potential to remove such biases in the thermodynamic and kinetic properties calculated from dynamics simulations. Previous implementations of the Fixman potential have been limited to only short serial chain systems. In this paper, we present a spatial operator algebra based algorithm to calculate the Fixman potential and its gradient within constrained dynamics simulations for branched topology molecules of any size. Our numerical studies on molecules of increasing complexity validate our algorithm by demonstrating recovery of the dihedral angle probability distribution function for systems that range in complexity from serial chains to protein molecules. We observe that the Fixman compensating potential recovers the free energy surface of a serial chain polymer, thus annulling the biases caused by constraining the bond lengths and bond angles. The inclusion of Fixman potential entails only a modest increase in the computational cost in these simulations. We believe that this work represents the first instance where the Fixman potential has been used for general branched systems, and establishes the viability for its use in constrained dynamics simulations of proteins and other macromolecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Advanced manufacturing provides tailor-made solutions for crystallography with x-ray free-electron lasers

Serial crystallography at large facilities, such as x-ray free-electron lasers and synchrotrons, evolved as a powerful method for the high-resolution structural investigation of proteins that are critical for human health, thus advancing drug discovery and novel therapies. However, a critical barrier to successful serial crystallography experiments lies in the efficient handling of the protein microcrystals and solutions at microscales. Microfluidics are the obvious approach for any high-throughput, nano-to-microliter sample handling, that also requires design flexibility and rapid prototyping to deal with the variable shapes, sizes, and density of crystals. Here, we discuss recent advances in polymer 3D printing for microfluidics-based serial crystallography research and present a demonstration of emerging, large-scale, nano-3D printing approaches leading into the future of 3D sample environment and delivery device fabrication from liquid jet gas-dynamic virtual nozzles devices to fixed-target sample environment technology.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Concurrent implicit spectral deferred correction scheme for low-Mach number combustion with detailed chemistry

We present a parallel multi-implicit time integration scheme for the advection-diffusion-reaction systems arising from the equations governing low-Mach number combustion with complex chemistry. Here, our strategy employs parallelisation across the method to accelerate the serial Multi-Implicit Spectral Deferred Correction (MISDC) scheme used to couple the advection, diffusion, and reaction processes. In our approach, the diffusion solves and the reaction solves are performed concurrently by different processors. Our analysis shows that the proposed parallel scheme is stable for stiff problems and that the sweeps converge to the fixed-point solution at a faster rate than with serial MISDC. We present numerical examples to demonstrate that the new algorithm is high-order accurate in time, and achieves a parallel speedup compared to serial MISDC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Scalable Contour Tree Computation by Data Parallel Peak Pruning

As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Furthermore, we report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lg t) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

SU-E-T-399: Determination of the Radiobiological Parameters That Describe the Dose-Response Relations of Xerostomia and Disgeusia From Head and Neck Radiotherapy

Purpose: To estimate the radiobiological parameters that describe the doseresponse relations of xerostomia and disgeusia from head and neck cancer radiotherapy. To identify the organs that are best correlated with the manifestation of those clinical endpoints. Finally, to evaluate the goodnessof- fit by comparing the model predictions against the actual clinical results. Methods: In this study, 349 head and neck cancer patients were included. For each patient the dose volume histograms (DVH) of parotids (separate and combined), mandible, submandibular glands (separate and combined) and salivary glands were calculated. The follow-up of those patients was recorded at different times after the completion of the treatment (7 weeks, 3, 7, 12, 18 and 24 months). Acute and late xerostomia and acute disgeusia were the clinical endpoints examined. A maximum likelihood fitting was performed to calculate the best estimates of the parameters used by the relative seriality model. The statistical methods of the error distribution, the receiver operating characteristic (ROC) curve, the Pearson's test and the Akaike's information criterion were utilized to assess the goodness-of-fit and the agreement between the pattern of the radiobiological predictions with that of the clinical records. Results: The estimated values of the radiobiological parameters of salivary glands are D50 = 25.2 Gy, γ = 0.52, s = 0.001. The statistical analysis confirmed the clinical validity of those parameters (area under the ROC curve = 0.65 and AIC = 38.3). Conclusion: The analysis proved that the treatment outcome pattern of the patient material can be reproduced by the relative seriality model and the estimated radiobiological parameters. Salivary glands were found to have strong volume dependence (low relative seriality). Diminishing the biologically effective uniform dose to salivary glands below 30 Gy may significantly reduce the risk of complications to the patients irradiated for prostate cancer.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

SU-E-T-466: Implementation of An Extension Module for Dose Response Models in the TOPAS Monte Carlo Toolkit

Purpose: To develop and verify an extension to TOPAS for calculation of dose response models (TCP/NTCP). TOPAS wraps and extends Geant4. Methods: The TOPAS DICOM interface was extended to include structure contours, for subsequent calculation of DVH’s and TCP/NTCP. The following dose response models were implemented: Lyman-Kutcher-Burman (LKB), critical element (CE), population based critical volume (CV), parallel-serials, a sigmoid-based model of Niemierko for NTCP and TCP, and a Poisson-based model for TCP. For verification, results for the parallel-serial and Poisson models, with 6 MV x-ray dose distributions calculated with TOPAS and Pinnacle v9.2, were compared to data from the benchmark configuration of the AAPM Task Group 166 (TG166). We provide a benchmark configuration suitable for proton therapy along with results for the implementation of the Niemierko, CV and CE models. Results: The maximum difference in DVH calculated with Pinnacle and TOPAS was 2%. Differences between TG166 data and Monte Carlo calculations of up to 4.2%±6.1% were found for the parallel-serial model and up to 1.0%±0.7% for the Poisson model (including the uncertainty due to lack of knowledge of the point spacing in TG166). For CE, CV and Niemierko models, the discrepancies between the Pinnacle and TOPAS results are 74.5%, 34.8% and 52.1% when using 29.7 cGy point spacing, the differences being highly sensitive to dose spacing. On the other hand, with our proposed benchmark configuration, the largest differences were 12.05%±0.38%, 3.74%±1.6%, 1.57%±4.9% and 1.97%±4.6% for the CE, CV, Niemierko and LKB models, respectively. Conclusion: Several dose response models were successfully implemented with the extension module. Reference data was calculated for future benchmarking. Dose response calculated for the different models varied much more widely for the TG166 benchmark than for the proposed benchmark, which had much lower sensitivity to the choice of DVH dose points. This work was supported by National Cancer Institute Grant R01CA140735.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

A copula-based rank histogram ensemble filter

Serial ensemble filters implement triangular probability transport maps to reduce high-dimensional inference problems to sequences of state-by-state univariate inference problems. The univariate inference problems are solved by sampling posterior probability densities obtained by combining constructed prior densities with observational likelihoods according to Bayes' rule. Many serial filters in the literature focus on representing the marginal posterior densities of each state. However, rigorously capturing the conditional dependencies between the different univariate inferences is crucial to correctly sampling multidimensional posteriors. This work proposes a new serial ensemble filter, called the copula rank histogram filter (CoRHF), that seeks to capture the conditional dependency structure between variables via empirical copula estimates; these estimates are used to rigorously implement the triangular (state-by-state univariate) Bayesian inference. The success of the CoRHF is demonstrated on two-dimensional examples and the Lorenz'63 problem. A practical extension to the high-dimensional setting is developed by localizing the empirical copula estimation, and is demonstrated on the Lorenz'96 problem.

97 MATHEMATICS AND COMPUTING↗