Data for EMSL Project 50414 from September 2025
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Three clinically relevant ebolaviruses – Ebola (EBOV), Bundibugyo (BDBV), and Sudan (SUDV) viruses, are responsible for severe disease and occasional deadly outbreaks in Africa. The largest Ebola virus disease (EVD) epidemic to date in 2013-2016 in West Africa highlighted the urgent need for countermeasures, leading to the development and FDA approval of the Ebola virus vaccine rVSV-ZEBOV (Ervebo ® ) in 2020 and two monoclonal antibody (mAb)-based therapeutics (Inmazeb ® [atoltivimab, maftivimab, and odesivimab-ebgn] and Ebanga ® (ansuvimab-zykl) in 2020. The humoral response plays an indispensable role in ebolavirus immunity, based on studies of mAbs isolated from the antibody genes in peripheral blood circulating ebolavirus-specific human memory B cells. However, antibodies in the body are not secreted by circulating memory B cells in the blood but rather principally by plasma cells in the bone marrow. Little is known about the protective polyclonal antibody responses in convalescent plasma. Here we exploited both single-cell antibody gene sequencing and proteomic sequencing approaches to assess the composition of the ebolavirus glycoprotein (GP)-reactive antibody repertoire in the plasma of an EVD survivor. We first identified 1,512 GP-specific mAb variable gene sequences from single cells in the memory B cell compartment. Using mass spectrometric analysis of the corresponding GP-specific plasma IgG, we found that only a portion of the large B cell antibody repertoire was represented in the plasma. Molecular and functional analysis of proteomics-identified mAbs revealed recognition of epitopes in three major antigenic sites - the GP head domain, the glycan cap, and the base region, with a high prevalence of neutralizing and protective mAb specificities that targeted the base and glycan cap regions on the GP. Polyclonal plasma antibodies from the survivor reacted broadly to EBOV, BDBV, and SUDV GP, while reactivity of the potently neutralizing mAbs we identified was limited mostly to the homologous EBOV GP. Together these results reveal a restricted diversity of neutralizing humoral response in which mAbs targeting two antigenic sites on GP – glycan cap and base – play a principal role in plasma-antibody-mediated protective immunity against EVD.
Filoviruses such as Ebola and Marburg virus bud from the host membrane as enveloped virions. This process is achieved by the matrix protein VP40. When expressed alone, VP40 induces budding of filamentous virus-like particles, suggesting that localization to the plasma membrane, oligomerization into a matrix layer, and generation of membrane curvature are intrinsic properties of VP40. There has been no direct information on the structure of VP40 matrix layers within viruses or virus-like particles. We present structures of Ebola and Marburg VP40 matrix layers in intact virus-like particles, and within intact Marburg viruses. VP40 dimers assemble extended chains via C-terminal domain interactions. These chains stack to form 2D matrix lattices below the membrane surface. These lattices form a patchwork assembly across the membrane and suggesting that assembly may begin at multiple points. Our observations define the structure and arrangement of the matrix protein layer that mediates formation of filovirus particles.
We present performance results for version 2.1 of the NAS Parallel Benchmarks (NPB) on the following architectures: IBM SP2/66 MHz; SGI Power Challenge Array/90 MHz; Cray Research T3D; and Intel Paragon. The NAS Parallel Benchmarks are a widely-recognized suite of benchmarks originally designed to compare the performance of highly parallel computers with that of traditional supercomputers.
A job management system is a critical component of a production supercomputing environment, permitting oversubscribed resources to be shared fairly and efficiently. Job management systems that were originally designed for traditional vector supercomputers are not appropriate for the distributed-memory parallel supercomputers that are becoming increasingly important in the high performance computing industry. Newer job management systems offer new functionality but do not solve fundamental problems. We address some of the main issues in resource allocation and job scheduling we have encountered on two parallel computers - a 160-node IBM SP2 and a cluster of 20 high performance workstations located at the Numerical Aerodynamic Simulation facility. We describe the requirements for resource allocation and job management that are necessary to provide a production supercomputing environment on these machines, prioritizing according to difficulty and importance, and advocating a return to fundamental issues.
The IBM SP2 is one of the most promising parallel computers for scientific supercomputing - it is fast and usually reliable. One of its biggest problems is a lack of robust and comprehensive system software. Among other things, this software allows a collection of Unix processes to be treated as a single parallel application. It does not, however, provide accounting for parallel jobs other than what is provided by AIX for the individual process components. Without parallel job accounting, it is not possible to monitor system use, measure the effectiveness of system administration strategies, or identify system bottlenecks. To address this problem, we have written jsd, a daemon that collects accounting data for parallel jobs. jsd records information in a format that is easily machine- and human-readable, allowing us to extract the most important accounting information with very little effort. jsd also notifies system administrators in certain cases of system failure.
NPB2 (NAS (NASA Advanced Supercomputing) Parallel Benchmarks 2) is an implementation, based on Fortran and the MPI (message passing interface) message passing standard, of the original NAS Parallel Benchmark specifications. NPB2 programs are run with little or no tuning, in contrast to NPB vendor implementations, which are highly optimized for specific architectures. NPB2 results complement, rather than replace, NPB results. Because they have not been optimized by vendors, NPB2 implementations approximate the performance a typical user can expect for a portable parallel program on distributed memory parallel computers. Together these results provide an insightful comparison of the real-world performance of high-performance computers. New NPB2 features: New implementation (CG), new workstation class problem sizes, new serial sample versions, more performance statistics.
In this paper a number of techniques for improving the cache performance of a representative piece of numerical software is presented. Target machines are popular processors from several vendors: MIPS R5000 (SGI Indy), MIPS R8000 (SGI PowerChallenge), MIPS R10000 (SGI Origin), DEC Alpha EV4 + EV5 (Cray T3D & T3E), IBM RS6000 (SP Wide-node), Intel PentiumPro (Ames' Whitney), Sun UltraSparc (NERSC's NOW). The optimizations all attempt to increase the locality of memory accesses. But they meet with rather varied and often counterintuitive success on the different computing platforms. We conclude that it may be genuinely impossible to obtain portable performance on the current generation of cache-based machines. At the least, it appears that the performance of modern commodity processors cannot be described with parameters defining the cache alone.
Obtaining high performance without machine-specific tuning is an important goal of scientific application programmers. Since most scientific processing is done on commodity microprocessors with hierarchical memory systems, this goal of "portable performance" can be achieved if a common set of optimization principles is effective for all such systems. It is widely believed, or at least hoped, that portable performance can be realized. The rule of thumb for optimization on hierarchical memory systems is to maximize temporal and spatial locality of memory references by reusing data and minimizing memory access stride. We investigate the effects of a number of optimizations on the performance of three related kernels taken from a computational fluid dynamics application. Timing the kernels on a range of processors, we observe an inconsistent and often counterintuitive impact of the optimizations on performance. In particular, code variations that have a positive impact on one architecture can have a negative impact on another, and variations expected to be unimportant can produce large effects. Moreover, we find that cache miss rates - as reported by a cache simulation tool, and confirmed by hardware counters - only partially explain the results. By contrast, the compiler-generated assembly code provides more insight by revealing the importance of processor-specific instructions and of compiler maturity, both of which strongly, and sometimes unexpectedly, influence performance. We conclude that it is difficult to obtain performance portability on modern cache-based computers, and comment on the implications of this result.
Obtaining high performance without machine-specific tuning is an important goal of scientific application programmers. Since most scientific processing is done on commodity microprocessors with hierarchical memory systems, this goal of "portable performance" can be achieved if a common set of optimization principles is effective for all such systems. It is widely believed, or at least hoped, that portable performance can be realized. The rule of thumb for optimization on hierarchical memory systems is to maximize temporal and spatial locality of memory references by reusing data and minimizing memory access stride. We investigate the effects of a number of optimizations on the performance of three related kernels taken from a computational fluid dynamics application. Timing the kernels on a range of processors, we observe an inconsistent and often counterintuitive impact of the optimizations on performance. In particular, code variations that have a positive impact on one architecture can have a negative impact on another, and variations expected to be unimportant can produce large effects. Moreover, we find that cache miss rates-as reported by a cache simulation tool, and confirmed by hardware counters-only partially explain the results. By contrast, the compiler-generated assembly code provides more insight by revealing the importance of processor-specific instructions and of compiler maturity, both of which strongly, and sometimes unexpectedly, influence performance. We conclude that it is difficult to obtain performance portability on modern cache-based computers, and comment on the implications of this result.
We report the results of a study on the immunoglobulin levels of rhesus monkeys (Macaca mulatta) in a colony consisting of the survivors of monkeys that received a single whole-body exposure to protons, electrons or X rays between 1964 and 1969. This colony has been maintained to assess the long-term effects of ionizing radiation on astronauts and high-flying pilots. Of the original 358 monkeys that were retained for lifetime studies, 129 (97 irradiated and 32 controls) were available for our study. We found no significant difference between the irradiated and control monkeys in mean levels of IgA, IgG and IgM, irrespective of the radiation treatment. The availability of these aged monkeys provided a unique opportunity to compare their immunoglobulin levels to those of other monkeys of various ages, and thus assess the effect of age on immunoglobulin levels. We found that only the IgA levels increase with age.