A lower bound to the distribution of computation for sequential decoding.
Sequential decoding algorithm with memoryless channel, obtaining lower bound to distribution of computation and limiting factor
SEQUENTIAL ANALYSIS↗
SEARCH · Engineering Papers
Results for “distributed computation”
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.
Distributed Quantum Computing with Photons and Atomic Memories
The promise of universal quantum computing requires scalable single- and inter-qubit control interactions. Currently, three of the leading candidate platforms for quantum computing are based on superconducting circuits, trapped ions, and neutral atom arrays. However, these systems have strong interaction with environmental and control noises that introduce decoherence of qubit states and gate operations. Alternatively, photons are well decoupled from the environment and have advantages of speed and timing for quantum computing. Photonic systems have already demonstrated capability for solving specific intractable problems like Boson sampling, but face challenges for practically scalable universal quantum computing solutions because it is extremely difficult for a single photon to “talk” to another deterministically. Here, a universal distributed quantum computing scheme based on photons and atomic-ensemble-based quantum memories is proposed. Taking the established photonic advantages, two-qubit nonlinear interaction is mediated by converting photonic qubits into quantum memory states and employing Rydberg blockade for the controlled gate operation. Spatial and temporal scalability of this scheme is demonstrated further. Furthermore, these results show photon-atom network hybrid approach can be a potential solution to universal distributed quantum computing.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Liquid rocket combustion computer model with distributed energy release. DER computer program documentation and user's guide, volume 1
A computer program for analyzing rocket engine performance was developed. The program is concerned with the formation, distribution, flow, and combustion of liquid sprays and combustion product gases in conventional rocket combustion chambers. The capabilities of the program to determine the combustion characteristics of the rocket engine are described. Sample data code sheets show the correct sequence and formats for variable values and include notes concerning options to bypass the input of certain data. A seperate list defines the variables and indicates their required dimensions.
Combs, L. P.↗
Advantages of Parallel Processing and the Effects of Communications Time
Many computing tasks involve heavy mathematical calculations, or analyzing large amounts of data. These operations can take a long time to complete using only one computer. Networks such as the Internet provide many computers with the ability to communicate with each other. Parallel or distributed computing takes advantage of these networked computers by arranging them to work together on a problem, thereby reducing the time needed to obtain the solution. The drawback to using a network of computers to solve a problem is the time wasted in communicating between the various hosts. The application of distributed computing techniques to a space environment or to use over a satellite network would therefore be limited by the amount of time needed to send data across the network, which would typically take much longer than on a terrestrial network. This experiment shows how much faster a large job can be performed by adding more computers to the task, what role communications time plays in the total execution time, and the impact a long-delay network has on a distributed computing system.
Eddy, Wesley M.↗
Automated CFD Parameter Studies on Distributed Parallel Computers
This paper presents viewgraphs of an automated process of running CFD parameter studies on distributed parallel computers.
Rogers, Stuart E.↗
Explicit modeling and computational load distribution for concurrent processing simulation of the space station
Two important aspects of concurrent processing under development at TRW are discussed. These are: (1) the derivation of explicit mathematical models of multibody dynamic systems, and (2) a balanced computational load distribution (BCLD) among loosely coupled computational units (processors) of a concurrent processing system. The developed methodologies are demonstrated by way of an application to the Phase 1 of the Space Station - a task being performed by TRW under NASA/JSC contract NAS9-17778. The mathematical model of the Space Station consists of three interconnected flexible bodies capable of undergoing large, rigid-body motion with respect to each other. Body 1 is the main central body and contains the pressurized modules inboard of the two Alpha gimbals. Bodies 2 and 3 are the starboard and port bodies connected to Body 1 at the Alpha gimbals and include all components on the transverse booms outboard of the Alpha gimbals (including the solar arrays). The control systems in the model maintain Body 1 in a prescribed 3-axis attitude control mode, while producing large-angle rotations of the flexible solar arrays to position them normal to the sun-line.
Gluck, R.↗
Postbuckling and large-deflection nonlinear analyses on distributed-memory computers
A computational strategy is presented for postbuckling and nonlinear static analyses of large complex structures on distributed-memory parallel computers. The strategy is designed for message-passing parallel computer systems. The key elements of the proposed strategy are: (1) a multiple-parameter reduced basis technique; (2) a nested dissection (or multilevel substructuring) ordering scheme; (3) parallel assembly of global matrices; and (4) a parallel sparse equation solver. The effectiveness of the strategy is assessed by performing thermomechanical postbuckling analyses of stiffened composite panels with cutouts, and nonlinear large-deflection analyses of High Speed Civil Transport models on three distributed-memory computers. The numerical studies presented demonstrate the advantages of nested dissection-based solvers over traditional skyline-based solvers on distributed-memory machines.
Watson, Brian C.↗
Computing Tolerance Factors And Noncentral t Distribution
TF, Tolerance Factors and Noncentral t Distribution computer program, computes tolerance factor from normal-distribution sample for arbitrarily specified coverage probability, confidence level, and any positive (integer or noninteger) number of degrees of freedom. Used extensively in engineering and quality analyses. Used in place of reference tables. Written in Microsoft QuickBasic v2.0.
Huang, Zhaofeng↗
Dynamic Load-Balancing for Distributed Heterogeneous Computing of Parallel CFD Problems
The developed methodology is aimed at improving the efficiency of executing block-structured algorithms on parallel, distributed, heterogeneous computers. The basic approach of these algorithms is to divide the flow domain into many sub- domains called blocks, and solve the governing equations over these blocks. Dynamic load balancing problem is defined as the efficient distribution of the blocks among the available processors over a period of several hours of computations. In environments with computers of different architecture, operating systems, CPU speed, memory size, load, and network speed, balancing the loads and managing the communication between processors becomes crucial. Load balancing software tools for mutually dependent parallel processes have been created to efficiently utilize an advanced computation environment and algorithms. These tools are dynamic in nature because of the chances in the computer environment during execution time. More recently, these tools were extended to a second operating system: NT. In this paper, the problems associated with this application will be discussed. Also, the developed algorithms were combined with the load sharing capability of LSF to efficiently utilize workstation clusters for parallel computing. Finally, results will be presented on running a NASA based code ADPAC to demonstrate the developed tools for dynamic load balancing.
Ecer, A.↗
Nonlinear structural analysis on distributed-memory computers
A computational strategy is presented for the nonlinear static and postbuckling analyses of large complex structures on massively parallel computers. The strategy is designed for distributed-memory, message-passing parallel computer systems. The key elements of the proposed strategy are: (1) a multiple-parameter reduced basis technique; (2) a nested dissection (or multilevel substructuring) ordering scheme; (3) parallel assembly of global matrices; and (4) a parallel sparse equation solver. The effectiveness of the strategy is assessed by applying it to thermo-mechanical postbuckling analyses of stiffened composite panels with cutouts, and nonlinear large-deflection analyses of HSCT models on Intel Paragon XP/S computers. The numerical studies presented demonstrate the advantages of nested dissection-based solvers over traditional skyline-based solvers on distributed memory machines.
Watson, Brian C.↗
Computed Temperature Distribution and Cooling of Solid Gas-Turbine Blades
Computations were made to determine the temperature distribution and cooling of solid gas-turbine blades.A range of temperatures was used from 1500 degrees to 2500 degrees F, blade-root temperatures from 100 degrees to 1000 degrees F, blade thermal conductivity from 8 to 220 BTU/(hr)(sq ft)(degrees F/ft), and net gas to metal heat transfer coefficients from 75 to 250 BTU/(hr)(sq ft)(degrees F).
Reuter, J. George↗
Vibration suppression with approximate finite dimensional compensators for distributed systems: Computational methods and experimental results
Based on a distributed parameter model for vibrations, an approximate finite dimensional dynamic compensator is designed to suppress vibrations (multiple modes with a broad band of frequencies) of a circular plate with Kelvin-Voigt damping and clamped boundary conditions. The control is realized via piezoceramic patches bonded to the plate and is calculated from information available from several pointwise observed state variables. Examples from computational studies as well as use in laboratory experiments are presented to demonstrate the effectiveness of this design.
Banks, H. T.↗
Beta distributions: A computer program for probabilities and fractile points
A beta distribution is specified by range parameters a b, and two shape parameters alpha and beta 0. The computer program presented calculates any desired probability and/or fractile point for specified values of a, b, alpha, and beta. This program additionally computes gamma function values for integer and noninteger arguments.
Brownlow, J. D.↗
Dynamic resource allocation scheme for distributed heterogeneous computer systems
This invention relates to a resource allocation in computer systems, and more particularly, to a method and associated apparatus for shortening response time and improving efficiency of a heterogeneous distributed networked computer system by reallocating the jobs queued up for busy nodes to idle, or less-busy nodes. In accordance with the algorithm (SIDA for short), the load-sharing is initiated by the server device in a manner such that extra overhead in not imposed on the system during heavily-loaded conditions. The algorithm employed in the present invention uses a dual-mode, server-initiated approach. Jobs are transferred from heavily burdened nodes (i.e., over a high threshold limit) to low burdened nodes at the initiation of the receiving node when: (1) a job finishes at a node which is burdened below a pre-established threshold level, or (2) a node is idle for a period of time as established by a wakeup timer at the node. The invention uses a combination of the local queue length and the local service rate ratio at each node as the workload indicator.
Liu, Howard T.↗
Computed voltage distributions around solar electric propulsion spacecraft
The NASA Charging Analyzer Program is used to conduct preliminary computations of the voltage distributions around such large spacecraft in geomagnetic substorm environments at geosynchronous altitudes. Both a standard operating voltage (+ or - 150 volts on solar arrays) and direct-drive (+1200 volts on arrays) configurations are considered. Thruster-off simulations are computed for both operating voltage configurations while the effect of simulated thruster-on conditions are evaluated only for direct-drive configuration. These simulated thruster-on conditions are evaluated only for direct-drive configuration. These simulated thruster operations appear to alleviate surface charging.
Stevens, N. J.↗
A performance analysis method for distributed real-time robotic systems: A case study of remote teleoperation
Robot coordination and control systems for remote teleoperation applications are by necessity implemented on distributed computers. Modeling and performance analysis of these distributed robotic systems is difficult, but important for economic system design. Performance analysis methods originally developed for conventional distributed computer systems are often unsatisfactory for evaluating real-time systems. The paper introduces a formal model of distributed robotic control systems; and a performance analysis method, based on scheduling theory, which can handle concurrent hard-real-time response specifications. Use of the method is illustrated by a case of remote teleoperation which assesses the effect of communication delays and the allocation of robot control functions on control system hardware requirements.
Lefebvre, D. R.↗
Big PanDa Workflow Management on Titan for High Energy and Nuclear Physics and for Future Extreme Scale Scientific Application
Over a three year period, from 2016-2019, this project demonstrated the scientific benefits of integrating the Titan supercomputer at Oak Ridge Leadership Computing Facility into traditional high throughput grid based distributed computing systems managed by PanDA, the workflow management system used for the execution of all distributed computing applications by the ATLAS experiment at the Large Hadron Collider. PanDA manages millions of batch jobs daily at hundreds of clusters worldwide on request by thousands of physicist users, and processes more than an exabyte of data annually using grid middleware. High levels of operational use of Titan was sustained by PanDA in order to meet the physics goals of ATLAS. The success of this project led to the use of other supercomputers worldwide by ATLAS, and to the adoption of PanDA by other experiments and other scientists. Multiple innovative operational and computer science research goals were achieved supporting the use of supercomputers for scientific domains with large scale distributed data and distributed processing needs.
97 MATHEMATICS AND COMPUTING↗
Additional Security Considerations for Grid Management
The use of Grid computing environments is growing in popularity. A Grid computing environment is primarily a wide area network that encompasses multiple local area networks, where some of the local area networks are managed by different organizations. A Grid computing environment also includes common interfaces for distributed computing software so that the heterogeneous set of machines that make up the Grid can be used more easily. The other key feature of a Grid is that the distributed computing software includes appropriate security technology. The focus of most Grid software is on the security involved with application execution, file transfers, and other remote computing procedures. However, there are other important security issues related to the management of a Grid and the users who use that Grid. This note discusses these additional security issues and makes several suggestions as how they can be managed.
Eidson, Thomas M.↗