Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nodes”

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 1,387 records · Page 77

Incorporation of Human Risk Directed Acyclic Graphs (DAG) With Mishap Investigations to Un-Silo Knowledge

NASA’s Human System Risk Board (HSRB) has been a central driver in efforts to understand, mitigate, and communicate the 29 human systems risks monitored by the board. As a result of the collaboration between research, operations, and technical authorities, large bodies of knowledge have been collected and digested to represent the current understanding of the risks. As a part of these bodies of knowledge, directed acyclic graphs (DAGs) have been developed to communicate the current understanding of the causal relationship of the hazards, contributing factors, countermeasures, other risks, and outcomes that contribute to the overall risk. This risk knowledge is applied in a theoretical sense for potential incidents during exploration even while informed by surveillance data. However, there have been mishaps and close calls during past space exploration that intersect with one or more of the Human System Risks DAGs and knowledge bases. The purpose of this exercise was to un-silo this risk knowledge and connect it to the close call of EVA 23 through the development of a DAG representing the intersection of the HSRB Risks and the events of the close call. The development of the DAG occurred through an iterative process, with each iteration expanding and/or refining the nodes and connections described by the source materials. In addition to the risk documentation developed by the HSRB, lessons learned and other mishap investigation documents were utilized to understand the events that led to water entering the helmet of a crewmember on the EVA. New nodes specific to the events of EVA 23 were interconnected with existing HSRB DAG nodes and edges. Nodes within the DAG were defined within a “DAG-tionary” with any updates to a definition that may have previously existed from the HSRB DAGs, and edges were recorded in a matrix. Both the DAG-tionary and matrix describe where nodes and edges are present across the Risk and Mishap DAG. This DAG will then be reviewed by experts outside of HSRB and HRP to confirm that interpretations of the non-health related events (such as the engineering nodes) are represented accurately. DISCUSSION This process highlighted a method by which the knowledge generated among the contributing members of the HSRB Risks can be effectively adapted and utilized through the tools employed by the Risk Custodian teams. By leveraging these tools, new context and insights to the information at hand can be brought forward to address current spaceflight challenges. Moreover, un-siloing this knowledge through future DAGs and other efforts can drive interprofessional collaboration and foster communication. This will enable teams to work together more effectively, leveraging their diverse expertise to tackle the complex challenges of space exploration and human research. Ultimately, this collaboration will bring NASA closer to achieve agency goals and contribute to the overall shared mission and vision.

Samuel Jacobs↗

Network-friendly one-sided communication through multinode cooperation on petascale cray xt5 systems

ne-sided communication is important to enable asynchronous communication and data movement for Global Address Space (GAS) programming models. Such communication is typically realized through direct messages between initiator and target processes. For petascale systems with 10,000s of nodes and 100,000s of cores, these direct messages require dedicated communication buffers and/or channels, which can lead to significant scalability challenges for GAS programming models. In this paper, we describe a network-friendly communication model, multinode cooperation, to enable indirect one-sided communication. Compute nodes work together to handle one-sided requests through (1) request forwarding in which one node can intercept a request and forward it to a target node, and (2) request aggregation in which one node can aggregate many requests to a target node. We have implemented multinode cooperation for a popular GAS runtime library, Aggregate Remote Memory Copy Interface (ARMCI). Our experimental results on a large-scale Cray XT5 system demonstrate that, multinode cooperation is able to greatly increase the memory scalability by reducing the number of communication buffers. In addition, multinode cooperation improves the resiliency of GAS runtime system to network contention. Furthermore, multinode cooperation can benefit the performance of scientific applications. In one case, it reduces the total execution time of an NWChem application by 52%.

99 GENERAL AND MISCELLANEOUS↗

Network-friendly one-sided communication through multinode cooperation on petascale cray xt5 systems

ne-sided communication is important to enable asynchronous communication and data movement for Global Address Space (GAS) programming models. Such communication is typically realized through direct messages between initiator and target processes. For petascale systems with 10,000s of nodes and 100,000s of cores, these direct messages require dedicated communication buffers and/or channels, which can lead to significant scalability challenges for GAS programming models. In this paper, we describe a network-friendly communication model, multinode cooperation, to enable indirect one-sided communication. Compute nodes work together to handle one-sided requests through (1) request forwarding in which one node can intercept a request and forward it to a target node, and (2) request aggregation in which one node can aggregate many requests to a target node. We have implemented multinode cooperation for a popular GAS runtime library, Aggregate Remote Memory Copy Interface (ARMCI). Our experimental results on a large-scale Cray XT5 system demonstrate that, multinode cooperation is able to greatly increase the memory scalability by reducing the number of communication buffers. In addition, multinode cooperation improves the resiliency of GAS runtime system to network contention. Furthermore, multinode cooperation can benefit the performance of scientific applications. In one case, it reduces the total execution time of an NWChem application by 52%.

Tipparaju, Vinod↗

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

Archer, Charles Jens↗

Multi-directional fault detection system

An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

Archer, Charles Jens↗

Direct memory access transfer completion notification

Methods, systems, and products are disclosed for DMA transfer completion notification that include: inserting, by an origin DMA on an origin node in an origin injection FIFO, a data descriptor for an application message; inserting, by the origin DMA, a reflection descriptor in the origin injection FIFO, the reflection descriptor specifying a remote get operation for injecting a completion notification descriptor in a reflection injection FIFO on a reflection node; transferring, by the origin DMA to a target node, the message in dependence upon the data descriptor; in response to completing the message transfer, transferring, by the origin DMA to the reflection node, the completion notification descriptor in dependence upon the reflection descriptor; receiving, by the origin DMA from the reflection node, a completion packet; and notifying, by the origin DMA in response to receiving the completion packet, the origin node's processing core that the message transfer is complete.

97 MATHEMATICS AND COMPUTING↗

Dispatching packets on a global combining network of a parallel computer

Methods, apparatus, and products are disclosed for dispatching packets on a global combining network of a parallel computer comprising a plurality of nodes connected for data communications using the network capable of performing collective operations and point to point operations that include: receiving, by an origin system messaging module on an origin node from an origin application messaging module on the origin node, a storage identifier and an operation identifier, the storage identifier specifying storage containing an application message for transmission to a target node, and the operation identifier specifying a message passing operation; packetizing, by the origin system messaging module, the application message into network packets for transmission to the target node, each network packet specifying the operation identifier and an operation type for the message passing operation specified by the operation identifier; and transmitting, by the origin system messaging module, the network packets to the target node.

97 MATHEMATICS AND COMPUTING↗

Broadcasting a message in a parallel computer

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.

97 MATHEMATICS AND COMPUTING↗

Heat Transport as a Probe of Superconducting Gap Structure

The structure of the superconducting gap provides important clues on the symmetry of the order parameter and the pairing mechanism. The presence of nodes in the gap function imposed by symmetry implies an unconventional order parameter, other than s-wave. Here we show how measurements of the thermal conductivity at very low temperature can be used to determine whether such nodes are present in a particular superconductor, and shed light on their nature and location. We focus on the residual linear term at T {yields} 0. A finite value in zero magnetic field is strong evidence for symmetry-imposed nodes, and the dependence on impurity scattering can distinguish between a line of nodes or point nodes. Application of a magnetic field probes the low-energy quasiparticle excitations, whether associated with nodes or with a small value of the gap on some part of the Fermi surface, as in a multi-band superconductor. We frame our discussion around archetypal materials: Nb for s-wave, Tl{sub 2}Ba{sub 2}CuO{sub 6+{delta}} for d-wave, Sr{sub 2}RuO{sub 4} for p-wave, and NbSe{sub 2} for multi-band superconductivity. In that framework, we discuss three heavy-fermion superconductors: CeIrIn{sub 5}, CeCoIn{sub 5} and UPt{sub 3}.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Petaflops router

Disclosed is a method and system for performing operations on at least one input data vector in order to produce at least one output vector to permit easy, scalable and fast programming of a petascale equivalent supercomputer. A PetaFlops Router may comprise one or more PetaFlops Nodes, which may be connected to each other and/or external data provider/consumers via a programmable crossbar switch external to the PetaFlops Node. Each PetaFlops Node has a FPGA and a programmable intra-FPGA crossbar switch that permits input and output variables to be configurably connected to various physical operators contained in the FPGA as desired by a user. This allows a user to specify the instruction set of the system on a per-application basis. Further, the intra-FPGA crossbar switch permits the output of one operation to be delivered as an input to a second operation. By configuring the external crossbar switch, the output of a first operation on a first PetaFlops Node may be used as the input for a second operation on a second PetaFlops Node. An embodiment may provide an ability for the system to recognize and generate pipelined functions. Streaming operators may be connected together at run-time and appropriately staged to allow data to flow through a series of functions. This allows the system to provide high throughput and parallelism when possible. The PetaFlops Router may implement the user desired instructions by appropriately configuring the intra-FPGA crossbar switch on each PetaFlops Node and the external crossbar switch.

97 MATHEMATICS AND COMPUTING↗

Multi-directional fault detection system

An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

97 MATHEMATICS AND COMPUTING↗

Collectively loading an application in a parallel computer

Collectively loading an application in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: identifying, by a parallel computer control system, a subset of compute nodes in the parallel computer to execute a job; selecting, by the parallel computer control system, one of the subset of compute nodes in the parallel computer as a job leader compute node; retrieving, by the job leader compute node from computer memory, an application for executing the job; and broadcasting, by the job leader to the subset of compute nodes in the parallel computer, the application for executing the job.

97 MATHEMATICS AND COMPUTING↗

Parallel checksumming of data chunks of a shared data object using a log-structured file system

Checksum values are generated and used to verify the data integrity. A client executing in a parallel computing system stores a data chunk to a shared data object on a storage node in the parallel computing system. The client determines a checksum value for the data chunk; and provides the checksum value with the data chunk to the storage node that stores the shared object. The data chunk can be stored on the storage node with the corresponding checksum value as part of the shared object. The storage node may be part of a Parallel Log-Structured File System (PLFS), and the client may comprise, for example, a Log-Structured File System client on a compute node or burst buffer. The checksum value can be evaluated when the data chunk is read from the storage node to verify the integrity of the data that is read.

97 MATHEMATICS AND COMPUTING↗

Photovoltaic Hosting Capacity of Feeders with Reactive Power Control and Tap Changers

This paper proposes an algorithm to determine photovoltaic (PV) hosting capacity of power distribution networks as a function of number of PV injection nodes, reactive power support from the PVs, and the sub-station load tap changers (LTCs). In the proposed method, several minute by minute simulations are run based on randomly chosen PV injection nodes, daily PV output profiles, and daily load profiles from a pool of high-resolution realistic data set. The simulation setup is built using OpenDSS and MATLAB. The performance of the proposed method is investigated in the IEEE 123-node distribution feeder for multiple scenarios. The case studies are performed particularly for one, two, five and ten PV injection nodes, and looking at the maximum voltage deviations. Case studies show that the PV hosting capacity of the 123-node feeder greatly differs with the number of PV injection nodes. We have also observed that the PV hosting capacity increases with reactive power support and higher tap position of sub-station LTC.

14 SOLAR ENERGY↗

Balancing computation and communication power in power constrained clusters

Systems, apparatuses, and methods for balancing computation and communication power in power constrained environments. A data processing cluster with a plurality of compute nodes may perform parallel processing of a workload in a power constrained environment. Nodes that finish tasks early may be power-gated based on one or more conditions. In some scenarios, a node may predict a wait duration and go into a reduced power consumption state if the wait duration is predicted to be greater than a threshold. The power saved by power-gating one or more nodes may be reassigned for use by other nodes. A cluster agent may be configured to reassign the unused power to the active nodes to expedite workload processing.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Is it Worth Relaxing Fault Tolerance to Speed Up Decommission in Distributed Storage Systems?

Efficient resource utilization is a major concern for large-scale computer platforms. One method used to lower energy consumption and operational cost is to reduce the amount of idle resources. This can be achieved by using malleability, namely, the possibility for resource managers to dynamically increase or decrease the amount of resources of jobs while they are running. Decommissioning (i.e., removing from the cluster) the idle nodes as soon as possible allows the resource manager to quickly reallocate those nodes to other jobs. Challenges appear when such nodes host part of a distributed storage system. Such storage systems may need to transfer large amounts of data before releasing the nodes, in order to ensure data availability and a certain level of fault tolerance. In this paper, we model and evaluate the performance of the decommission operation when relaxing the level of fault tolerance (i.e., the number of replicas) during this operation. Intuitively, this is expected to reduce the amount of data transfers needed before nodes are released, and thus allow nodes to be returned to the resource manager faster. We quantify theoretically how much time and resources are saved by such a fast decommission strategy compared with a standard decommission that does not temporarily reduce the fault-tolerance level. We establish lower bounds for the duration of the different phases of a fast decommission. We use the lower bounds to estimate when fast decommission would be useful to reduce the usage of core-hours and when not. We implement a prototype for fast decommission and experimentally validate the lower bounds on the duration of the operation and confirm in practice our theoretical findings.

Decommission↗

Register files for I/O packet compression

Systems, apparatuses, and methods for reducing inter-node bandwidth are contemplated. A computer system includes requesting nodes sending transactions to target nodes. A requesting node sends a packet that includes a register identifier (ID) in place of a data value in the packet. The register ID indicates a register in the target node storing the data value. The register ID uses fewer bits in the packet than the data value. The data value may be a memory address referencing a memory location in the target node. The received packet may also include an opcode indicating an operation to perform on the targeted data value.

Roberts, David A.↗

Achieving balanced execution through runtime detection of performance variation

Systems, apparatuses, and methods for achieving balanced execution in a multi-node cluster through runtime detection of performance variation are described. During a training phase, performance counters and an amount of time spent waiting for synchronization is monitored for a plurality of tasks for each node of the multi-node cluster. These values are utilized to generate a model which correlates the values of the performance counters to the amount of time spent waiting for synchronization. Once the model is built, the values of the performance counters are monitored for a period of time at the start of each task, and these values are input into the model. The model generates a prediction of whether a given node is on the critical path. If the given node is predicted to be on the critical path, the power allocation of the given node is increased.

97 MATHEMATICS AND COMPUTING↗