Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 289 records · Page 16

Cooling of Gas Turbines: Computed Temperature Distribution Through Cross Section of Water-Cooled Turbine Blade - 6

A theoretical analysis of the cross-sectional temperature distribution of a water-cooled turbine blade was made using the relaxation method to solve the differential equation derived from the analysis. The analysis was applied to specific turbine blade and the studies icluded investigations of the accuracy of simple methods to determine the temperature distribution along the mean line of the rear part of the blade, of the possible effect of varying the perimetric distribution of the hot gas-to -metal heat transfer coefficient, and of the effect of changing the thermal conductivity of the blade metal for a constant cross sectional area blade with two quarter inch diameter coolant passages.

Livingood, John N. B.↗

Globus Quick Start Guide. Globus Software Version 1.1

The Globus Project is a community effort, led by Argonne National Laboratory and the University of Southern California's Information Sciences Institute. Globus is developing the basic software infrastructure for computations that integrate geographically distributed computational and information resources.

Source record↗

Dynamic load balancing of matrix-vector multiplications on roadrunner compute nodes

Hybrid architectures that combine general purpose processors with accelerators are being adopted in several large-scale systems such as the petaflop Roadrunner supercomputer at Los Alamos. In this system, dual-core Opteron host processors are tightly coupled with PowerXCell 8i processors within each compute node. In this kind of hybrid architecture, an accelerated mode of operation is typically used to offload performance hotspots in the computation to the accelerators. In this paper we explore the suitability of a variant of this acceleration mode in which the performance hotspots are actually shared between the host and the accelerators. To achieve this we have designed a new load balancing algorithm, which is optimized for the Roadrunner compute nodes, to dynamically distribute computation and associated data between the host and the accelerators at runtime. Results are presented using this approach for sparse and dense matrix-vector multiplications that show load-balancing can improve performance by up to 24% over solely using the accelerators.

97 MATHEMATICS AND COMPUTING↗

Design outline for a new multiman ATC simulation facility at NASA-Ames Research Center

A new and unique facility for studying human factors aspects in aeronautics is being planned for use in the Man-Vehicle Systems Research Division at the NASA-Ames Research Center. This facility will replace the existing three cockpit-single ground controller station and be expandable to include approximately seven cockpits and two ground controller stations. Unlike the previous system, each cockpit will be mini-computer centered and linked to a main CPU to effect a distributed computation facility. Each simulator will compute its own flight dynamic and flight path predictor. Mechanical flight instruments in each cockpit will be locally supported and CRT cockpit displays of (e.g.) traffic and or RNAV information will be centrally computed and distributed as a means of extending the existing computational and graphical resources. An outline of the total design is presented which addresses the technical design options and research possibilities of this unique man-machine facility and which may also serve as a model for other real time distributed simulation facilities.

Kreifeldt, J. G.↗

Pricing the Computing Resources: Reading Between the Lines and Beyond

Distributed computing systems have the potential to increase the usefulness of existing facilities for computation without adding anything physical, but that is realized only when necessary administrative features are in place. In a distributed environment, the best match is sought between a computing job to be run and a computer to run the job (global scheduling), which is a function that has not been required by conventional systems. Viewing the computers as 'suppliers' and the users as 'consumers' of computing services, markets for computing services/resources have been examined as one of the most promising mechanisms for global scheduling. We first establish why economics can contribute to scheduling. We further define the criterion for a scheme to qualify as an application of economics. Many studies to date have claimed to have applied economics to scheduling. If their scheduling mechanisms do not utilize economics, contrary to their claims, their favorable results do not contribute to the assertion that markets provide the best framework for global scheduling. We examine the well-known scheduling schemes, which concern pricing and markets, using our criterion of what application of economics is. Our conclusion is that none of the schemes examined makes full use of economics.

Nakai, Junko↗

An XML-Based Protocol for Distributed Event Services

A recent trend in distributed computing is the construction of high-performance distributed systems called computational grids. One difficulty we have encountered is that there is no standard format for the representation of performance information and no standard protocol for transmitting this information. This limits the types of performance analysis that can be undertaken in complex distributed systems. To address this problem, we present an XML-based protocol for transmitting performance events in distributed systems and evaluate the performance of this protocol.

Smith, Warren↗

Status of QCD precision predictions for Drell–Yan rapidity distributions

We compute differential distributions for Drell–Yan processes at the LHC and the Tevatron colliders at next-to-next-to-leading order in perturbative QCD, including fiducial cuts on the decay leptons in the final state. The comparison of predictions obtained with four different codes shows excellent agreement, once linear power corrections from the fiducial cuts are included in those codes that rely on phase-space slicing subtraction schemes. For Z-boson production we perform a detailed study of the symmetric cuts on the transverse momenta of the decay leptons. Predictions at fixed order in perturbative QCD for those symmetric cuts, typically imposed in experiments, suffer from an instability. We show how this can be remedied by an all-order resummation of the fiducial transverse momentum spectrum, and we comment on the choice of cuts for future experimental analyses.

Alekhin, S. [University of Hamburg (Germany)]↗

Architecture for the Next Generation System Management Tools

To get more results or greater accuracy, computational scientists execute their applications on distributed computing platforms such as Clusters, Grids and Clouds. These platforms are different in terms of hardware and software resources as well as locality: some span across multiple sites and multiple administrative domains whereas others are limited to a single site/domain. As a consequence, in order to scale their applica- tions up the scientists have to manage technical details for each target platform. From our point of view, this complexity should be hidden from the scientists who, in most cases, would prefer to focus on their research rather than spending time dealing with platform configuration concerns. In this article, we advocate for a system management framework that aims to automatically setup the whole run-time environment according to the applications needs. The main difference with regards to usual approaches is that they generally only focus on the software layer whereas we address both the hardware and the software expecta- tions through a unique system. For each application, scientists describe their requirements through the definition of a Virtual Platform (VP) and a Virtual System Environment (VSE). Relying on the VP/VSE definitions, the framework is in charge of: (i) the configuration of the physical infrastructure to satisfy the VP requirements, (ii) the setup of the VP, and (iii) the customization of the execution environment (VSE) upon the former VP. We propose a new formalism that the system can rely upon to successfully perform each of these three steps without burdening the user with the specifics of the configuration for the physical resources, and system management tools. This formalism leverages Goldberg s theory for recursive virtual machines by introducing new concepts based on system virtualization (identity, partitioning, aggregation) and emulation (simple, abstraction). This enables the definition of complex VP/VSE configurations without making assumptions about the hardware and the software re- sources. For each requirement, the system executes the corresponding operation with the appropriate management tool. As a proof of concept, we implemented a first prototype that currently interacts with several system management tools (e.g., OSCAR, the Grid 5000 toolkit, and XtreemOS) and that can be easily extended to integrate new resource brokers or cloud systems such as Nimbus, OpenNebula or Eucalyptus for instance.

99 GENERAL AND MISCELLANEOUS↗