SEARCH · Engineering Papers
Results for “history of 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.
Complexity in scalable computing.
The rich history of scalable computing research owes much to a rapid rise in computing platform scale in terms of size and speed. As platforms evolve, so must algorithms and the software expressions of those algorithms. Unbridled growth in scale inevitably leads to complexity. This special issue grapples with two facets of this complexity: scalable execution and scalable development. The former results from efficient programming of novel hardware with increasing numbers of processing units (e.g., cores, processors, threads or processes). The latter results from efficient development of robust, flexible software with increasing numbers of programming units (e.g., procedures, classes, components or developers). The progression in the above two parenthetical lists goes from the lowest levels of abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Research and Development Department at Sandia National Laboratories in Livermore, CA. Their co-authors hail from other parts of Sandia, other national laboratories and academia. Their research sponsors include several programs within the Department of Energy's Office of Advanced Scientific Computing Research and its National Nuclear Security Administration, along with Sandia's Laboratory Directed Research and Development program and the Office of Naval Research. The breadth of interests of these authors and their customers reflects in the breadth of applications this issue covers. This article demonstrates how to obtain scalable execution on the increasingly dominant high-performance computing platform: a Linux cluster with multicore chips. The authors describe how deep memory hierarchies necessitate reducing communication overhead by using threads to exploit shared register and cache memory. On a matrix-matrix multiplication problem, they achieve up to 96% parallel efficiency with a three-part strategy: intra-node multithreading, non-blocking inter-node message passing, and a dedicated communications thread to facilitate concurrent communications and computations. On a quantum chemistry problem, they spawn multiple computation threads and communication threads on each node and use one-sided communications between nodes to minimize wait times. They reduce software complexity by evolving a multi-threaded factory pattern in C++ from a working, message-passing program in C.
Computer Supported Indexing: A History and Evaluation of NASA's MAI System
Computer supported or machine aided indexing (MAI) can be categorized in multiple ways. The system used by the National Aeronautics and Space Administration's (NASA's) Center for AeroSpace Information (CASI) is described as semantic and computational. It's based on the co-occurrence of domain-specific terminology in parts of a sentence, and the probability that an indexer will assign a particular index term when a given word or phrase is encountered in text. The NASA CASI system is run on demand by the indexer and responds in 3 to 9 seconds with a list of suggested, authorized terms. The system was originally based on a syntactic system used in the late 1970's by the Defense Technical Information Center (DTIC). The NASA mainframe-supported system consists of three components: two programs and a knowledge base (KB). The evolution of the system is described and flow charts illustrate the MAI procedures. Tests used to evaluate NASA's MAI system were limited to those that would not slow production. A very early test indicated that MAI saved about 3 minutes and provided several additional terms for each document indexed. It also was determined that time and other resources spent in careful construction of the KB pay off with high-quality output and indexer acceptance of MAI results.
Computer Supported Indexing: A History and Evaluation of NASA's MAI System
Computer supported indexing systems may be categorized in several ways. One classification scheme refers to them as statistical, syntactic, semantic or knowledge-based. While a system may emphasize one of these aspects, most systems actually combine two or more of these mechanisms to maximize system efficiency. Statistical systems can be based on counts of words or word stems, statistical association, and correlation techniques that assign weights to word locations or provide lexical disambiguation, calculations regarding the likelihood of word co-occurrences, clustering of word stems and transformations, or any other computational method used to identify pertinent terms. If words are counted, the ones of median frequency become candidate index terms. Syntactical systems stress grammar and identify parts of speech. Concepts found in designated grammatical combinations, such as noun phrases, generate the suggested terms. Semantic systems are concerned with the context sensitivity of words in text. The primary goal of this type of indexing is to identify without regard to syntax the subject matter and the context-bearing words in the text being indexed. Knowledge-based systems provide a conceptual network that goes past thesaurus or equivalent relationships to knowing (e.g., in the National Library of Medicine (NLM) system) that because the tibia is part of the leg, a document relating to injuries to the tibia should he indexed to LEG INJURIES, not the broader MeSH term INJURIES, or knowing that the term FEMALE should automatically be added when the term PREGNANCY is assigned, and also that the indexer should be prompted to add either HUMAN or ANIMAL. Another way of categorizing indexing systems is to identify them as producing either assigned- or derived-term indexes.
Help Wanted: A Modern-Day Turing
Here, the National Strategic Computing Initiative will inevitably produce new computer hardware, but what about software?
It's Time to Redefine Moore's Law Again
The familiar story of Moore's law is actually inaccurate. Here, this article corrects the story, leading to different projections for the future. Moore's law is a fluid idea whose definition changes over time. It thus doesn't have the ability to "end," as is popularly reported, but merely takes different forms as the semiconductor and computer industries evolve.
A Future with Quantum Machine Learning
Could combining quantum computing and machine learning with Moore's law produce a true “rebooted computer”? Furthermore, this article posits that a three-technology hybrid-computing approach might yield sufficiently improved answers to a broad class of problems such that energy efficiency will no longer be the dominant concern.
Solution of the equation of heat conduction with time dependent sources: Programmed application to planetary thermal history
A computer program (Program SPHERE) solving the inhomogeneous equation of heat conduction with radiation boundary condition on a thermally homogeneous sphere is described. The source terms are taken to be exponential functions of the time. Thermal properties are independent of temperature. The solutions are appropriate to studying certain classes of planetary thermal history. Special application to the moon is discussed.
Reliability history of the Apollo guidance computer
The Apollo guidance computer was designed to provide the computation necessary for guidance, navigation and control of the command module and the lunar landing module of the Apollo spacecraft. The computer was designed using the technology of the early 1960's and the production was completed by 1969. During the development, production, and operational phase of the program, the computer has accumulated a very interesting history which is valuable for evaluating the technology, production methods, system integration, and the reliability of the hardware. The operational experience in the Apollo guidance systems includes 17 computers which flew missions and another 26 flight type computers which are still in various phases of prelaunch activity including storage, system checkout, prelaunch spacecraft checkout, etc. These computers were manufactured and maintained under very strict quality control procedures with requirements for reporting and analyzing all indications of failure. Probably no other computer or electronic equipment with equivalent complexity has been as well documented and monitored. Since it has demonstrated a unique reliability history, it is important to evaluate the techniques and methods which have contributed to the high reliability of this computer.
Computational structural analysis and advanced commercial engines
The history of computational structural analysis is reviewed and anticipated requirements for the design, development, and support of advanced commercial engines is discussed. The present commercial engine environment is comprised primarily of turbofan engines containing monolithic titanium and nickel alloys. Future commercial engines will make extensive use of composite materials to meet demanding high temperature requirement and aggressive weight goals, since only modestly higher capabilities can be anticipated in monolithic materials. Engine configurations will include ducted and/or unducted propfans and super turbojet in addition to turbofans.
Computer-made motion pictures and time history plots of ion-polar molecule collisions
Computer made motion pictures and time history plots of ion-polar molecule collisions
Nuclear Weapons Computational Physics [Slides]
This presentation provides an overview of computational physics, the role LANL played in the history of computational physics, and how computational physics differs at LANL. Next, the presentation addresses computational physics as part of the LANL weapons program. Finally, the computational physics structure at LANL is addressed.
Computers Take Flight: A History of NASA's Pioneering Digital Fly-By-Wire Project
An overview of the NASA F-8 Fly-by Wire project is presented. The project made two significant contributions to the new technology: (1) a solid design base of techniques that work and those that do not, and (2) credible evidence of good flying qualities and the ability of such a system to tolerate real faults and to continue operation without degradation. In 1972 the F-8C aircraft used in the program became he first digital fly-by-wire aircraft to operate without a mechanical backup system.
By the Numbers: The History of Sandia Telecommunications & Computing Timeline Mural.
Abstract not provided.
GFiRe—Gauge Field integrator for Reheating
We present a new numerical algorithm and code, GFiRe, for solving the nonlinear evolution of Abelian gauge fields coupled to complex scalar fields in homogeneous and isotropic spacetimes. We adopt a hybrid approach to solving the system: the spatial derivatives are discretized using standard Lattice Gauge Field Theory techniques, whereas the time evolution of the fields and scale factor is implemented with explicit, composite, symplectic integrators. An important property of our compound algorithm is that the discretized Gauss constraint is respected exactly, regardless of the order of the symplectic integrator. This remains true even when the background expansion is computed “self-consistently”; that is, when the expansion history is computed using spatial averaged components of the energy momentum tensor in the simulation volume. Hence, our code can also be used in cases where the fields dominate the energy density of the universe, for example, during reheating after inflation. We test the algorithm in scenarios of reheating where the inflaton is a complex scalar field with a potential ∝(2|Φ| 2 - v 2 ) 2 and is coupled to an Abelian gauge field. Tracing the evolution of the system through complex dynamics (including resonant excitation of fields, backreaction, formation of solitons, and changes in the equation of state) in a self-consistently expanding universe, we find the energy conservation violation (<10 -4 ) to be very stable and the Gauss constraint violation (<10 -6 ) to be dominated by differencing noise.
Compressible studies on dynamic stall
The purpose of this work is to investigate the effects of compressibility on the dynamic stall phenomenon by numerical simulation of the unsteady flow. The full two-dimensional unsteady compressible Navier-Stokes equations are solved for flows over oscillating airfoils and airfoils pitching rapidly to high angles of attack. The free-stream speeds vary from low subsonic with mild compressibility effects, to moderate subsonic where strong compressibility effects appear close to the leading edge at high angles of attack. An Alternating Direction Implicit scheme is implemented for the numerical solution with the viscous terms retained in both directions. The numerical results are compared with available experimental data for a Sikorsky airfoil for compressible high Reynolds number flows. There is good agreement between the computed and measured unsteady lift and pitching moment coefficient time histories. The computed high-speed subsonic unsteady results give a good picture of the entire flow field, and the dynamic stall progression in the compressible flow regime. It was observed that compressibility effects are more severe close to the leading edge at moderate angles of attack, and that the dynamic stall vortex appears at lower angles of attack as the free-stream speed increases.
Extreme Scale Computing to Secure the Nation
Since the dawn of modern electronic computing in the mid 1940's, U.S. national security programs have been dominant users of every new generation of high-performance computer. Indeed, the first general-purpose electronic computer, ENIAC (the Electronic Numerical Integrator and Computer), was used to calculate the expected explosive yield of early thermonuclear weapons designs. Even the U. S. numerical weather prediction program, another early application for high-performance computing, was initially funded jointly by sponsors that included the U.S. Air Force and Navy, agencies interested in accurate weather predictions to support U.S. military operations. For the decades of the cold war, national security requirements continued to drive the development of high performance computing (HPC), including advancement of the computing hardware and development of sophisticated simulation codes to support weapons and military aircraft design, numerical weather prediction as well as data-intensive applications such as cryptography and cybersecurity U.S. national security concerns continue to drive the development of high-performance computers and software in the U.S. and in fact, events following the end of the cold war have driven an increase in the growth rate of computer performance at the high-end of the market. This mainly derives from our nation's observance of a moratorium on underground nuclear testing beginning in 1992, followed by our voluntary adherence to the Comprehensive Test Ban Treaty (CTBT) beginning in 1995. The CTBT prohibits further underground nuclear tests, which in the past had been a key component of the nation's science-based program for assuring the reliability, performance and safety of U.S. nuclear weapons. In response to this change, the U.S. Department of Energy (DOE) initiated the Science-Based Stockpile Stewardship (SBSS) program in response to the Fiscal Year 1994 National Defense Authorization Act, which requires, 'in the absence of nuclear testing, a progam to: (1) Support a focused, multifaceted program to increase the understanding of the enduring stockpile; (2) Predict, detect, and evaluate potential problems of the aging of the stockpile; (3) Refurbish and re-manufacture weapons and components, as required; and (4) Maintain the science and engineering institutions needed to support the nation's nuclear deterrent, now and in the future'. This program continues to fulfill its national security mission by adding significant new capabilities for producing scientific results through large-scale computational simulation coupled with careful experimentation, including sub-critical nuclear experiments permitted under the CTBT. To develop the computational science and the computational horsepower needed to support its mission, SBSS initiated the Accelerated Strategic Computing Initiative, later renamed the Advanced Simulation & Computing (ASC) program (sidebar: 'History of ASC Computing Program Computing Capability'). The modern 3D computational simulation capability of the ASC program supports the assessment and certification of the current nuclear stockpile through calibration with past underground test (UGT) data. While an impressive accomplishment, continued evolution of national security mission requirements will demand computing resources at a significantly greater scale than we have today. In particular, continued observance and potential Senate confirmation of the Comprehensive Test Ban Treaty (CTBT) together with the U.S administration's promise for a significant reduction in the size of the stockpile and the inexorable aging and consequent refurbishment of the stockpile all demand increasing refinement of our computational simulation capabilities. Assessment of the present and future stockpile with increased confidence of the safety and reliability without reliance upon calibration with past or future test data is a long-term goal of the ASC program. This will be accomplished through significant increases in the scientific bases that underlie the computational tools. Computer codes must be developed that replace phenomenology with increased levels of scientific understanding together with an accompanying quantification of uncertainty. These advanced codes will place significantly higher demands on the computing infrastructure than do the current 3D ASC codes. This article discusses not only the need for a future computing capability at the exascale for the SBSS program, but also considers high performance computing requirements for broader national security questions. For example, the increasing concern over potential nuclear terrorist threats demands a capability to assess threats and potential disablement technologies as well as a rapid forensic capability for determining a nuclear weapons design from post-detonation evidence (nuclear counterterrorism).
Seventy Years of Computing in the Nuclear Weapons Program
Los Alamos has continuously been on the forefront of scientific computing since it helped found the field. This talk will explore the rich history of computing in the Los Alamos weapons program. The current status of computing will be discussed, as will the expectations for the near future.