National Library of Energy BETA

Sample records for hp network node

  1. U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks

    Broader source: Energy.gov [DOE]

    Potential security vulnerabilities have been identified with HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in cross site scripting (XSS).

  2. U-229: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks

    Broader source: Energy.gov [DOE]

    Potential security vulnerabilities have been identified with HP Network Node Manager i (NNMi) for HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in cross site scripting (XSS).

  3. Reconfigureable network node

    DOE Patents [OSTI]

    Vanderveen, Keith B.; Talbot, Edward B.; Mayer, Laurence E.

    2008-04-08

    Nodes in a network having a plurality of nodes establish communication links with other nodes using available transmission media, as the ability to establish such links becomes available and desirable. The nodes predict when existing communications links will fail, become overloaded or otherwise degrade network effectiveness and act to establish substitute or additional links before the node's ability to communicate with the other nodes on the network is adversely affected. A node stores network topology information and programmed link establishment rules and criteria. The node evaluates characteristics that predict existing links with other nodes becoming unavailable or degraded. The node then determines whether it can form a communication link with a substitute node, in order to maintain connectivity with the network. When changing its communication links, a node broadcasts that information to the network. Other nodes update their stored topology information and consider the updated topology when establishing new communications links for themselves.

  4. Modular sensor network node

    DOE Patents [OSTI]

    Davis, Jesse Harper Zehring; Stark, Jr., Douglas Paul; Kershaw, Christopher Patrick; Kyker, Ronald Dean

    2008-06-10

    A distributed wireless sensor network node is disclosed. The wireless sensor network node includes a plurality of sensor modules coupled to a system bus and configured to sense a parameter. The parameter may be an object, an event or any other parameter. The node collects data representative of the parameter. The node also includes a communication module coupled to the system bus and configured to allow the node to communicate with other nodes. The node also includes a processing module coupled to the system bus and adapted to receive the data from the sensor module and operable to analyze the data. The node also includes a power module connected to the system bus and operable to generate a regulated voltage.

  5. IEEE 342 Node Low Voltage Networked Test System

    SciTech Connect (OSTI)

    Schneider, Kevin P.; Phanivong, Phillippe K.; Lacroix, Jean-Sebastian

    2014-07-31

    The IEEE Distribution Test Feeders provide a benchmark for new algorithms to the distribution analyses community. The low voltage network test feeder represents a moderate size urban system that is unbalanced and highly networked. This is the first distribution test feeder developed by the IEEE that contains unbalanced networked components. The 342 node Low Voltage Networked Test System includes many elements that may be found in a networked system: multiple 13.2kV primary feeders, network protectors, a 120/208V grid network, and multiple 277/480V spot networks. This paper presents a brief review of the history of low voltage networks and how they evolved into the modern systems. This paper will then present a description of the 342 Node IEEE Low Voltage Network Test System and power flow results.

  6. Performance of wireless sensor networks under random node failures

    SciTech Connect (OSTI)

    Bradonjic, Milan; Hagberg, Aric; Feng, Pan

    2011-01-28

    Networks are essential to the function of a modern society and the consequence of damages to a network can be large. Assessing network performance of a damaged network is an important step in network recovery and network design. Connectivity, distance between nodes, and alternative routes are some of the key indicators to network performance. In this paper, random geometric graph (RGG) is used with two types of node failure, uniform failure and localized failure. Since the network performance are multi-facet and assessment can be time constrained, we introduce four measures, which can be computed in polynomial time, to estimate performance of damaged RGG. Simulation experiments are conducted to investigate the deterioration of networks through a period of time. With the empirical results, the performance measures are analyzed and compared to provide understanding of different failure scenarios in a RGG.

  7. U-274: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information

    Broader source: Energy.gov [DOE]

    Vulnerabilities can be exploited by malicious people to cause a DoS (Denial of Service) and potentially compromise a vulnerable system.

  8. Neural node network and model, and method of teaching same

    DOE Patents [OSTI]

    Parlos, A.G.; Atiya, A.F.; Fernandez, B.; Tsai, W.K.; Chong, K.T.

    1995-12-26

    The present invention is a fully connected feed forward network that includes at least one hidden layer. The hidden layer includes nodes in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device occurring in the feedback path (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit from all the other nodes within the same layer. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing. 21 figs.

  9. Neural node network and model, and method of teaching same

    DOE Patents [OSTI]

    Parlos, Alexander G.; Atiya, Amir F.; Fernandez, Benito; Tsai, Wei K.; Chong, Kil T.

    1995-01-01

    The present invention is a fully connected feed forward network that includes at least one hidden layer 16. The hidden layer 16 includes nodes 20 in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device 24 occurring in the feedback path 22 (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit 36 from all the other nodes within the same layer 16. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing.

  10. Node Augmentation Technique in Bayesian Network Evidence Analysis and Marshaling

    SciTech Connect (OSTI)

    Keselman, Dmitry; Tompkins, George H; Leishman, Deborah A

    2010-01-01

    Given a Bayesian network, sensitivity analysis is an important activity. This paper begins by describing a network augmentation technique which can simplifY the analysis. Next, we present two techniques which allow the user to determination the probability distribution of a hypothesis node under conditions of uncertain evidence; i.e. the state of an evidence node or nodes is described by a user specified probability distribution. Finally, we conclude with a discussion of three criteria for ranking evidence nodes based on their influence on a hypothesis node. All of these techniques have been used in conjunction with a commercial software package. A Bayesian network based on a directed acyclic graph (DAG) G is a graphical representation of a system of random variables that satisfies the following Markov property: any node (random variable) is independent of its non-descendants given the state of all its parents (Neapolitan, 2004). For simplicities sake, we consider only discrete variables with a finite number of states, though most of the conclusions may be generalized.

  11. Error recovery to enable error-free message transfer between nodes of a computer network

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Coteus, Paul W.; Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd; Steinmacher-Burow, Burkhard; Vranas, Pavlos M.

    2016-01-26

    An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

  12. The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

    SciTech Connect (OSTI)

    Kim, M; Leskovec, J

    2011-11-14

    Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

  13. U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities

    Broader source: Energy.gov [DOE]

    Vulnerabilities could be remotely exploited resulting in unauthorized information disclosure, modification, Denial of Service (DoS).

  14. Support Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Support Nodes Support Nodes xe6blade.png Hopper has nodes connected to the internal Gemini network that provide functions that support the compute nodes. These include job launch...

  15. Determining a bisection bandwidth for a multi-node data communications network

    DOE Patents [OSTI]

    Faraj, Ahmad A.

    2010-01-26

    Methods, systems, and products are disclosed for determining a bisection bandwidth for a multi-node data communications network that include: partitioning nodes in the network into a first sub-network and a second sub-network in dependence upon a topology of the network; sending, by each node in the first sub-network to a destination node in the second sub-network, a first message having a predetermined message size; receiving, by each node in the first sub-network from a source node in the second sub-network, a second message; measuring, by each node in the first sub-network, the elapsed communications time between the sending of the first message and the receiving of the second message; selecting the longest elapsed communications time; and calculating the bisection bandwidth for the network in dependence upon the number of the nodes in the first sub-network, the predetermined message size of the first test message, and the longest elapsed communications time.

  16. Lambda network having 2.sup.m-1 nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

    DOE Patents [OSTI]

    Napolitano, Jr., Leonard M.

    1995-01-01

    The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance.

  17. Wireless Sensor Networks - Node Localization for Various Industry Problems

    SciTech Connect (OSTI)

    Derr, Kurt; Manic, Milos

    2015-06-01

    Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothing (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.

  18. Wireless Sensor Networks - Node Localization for Various Industry Problems

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Derr, Kurt; Manic, Milos

    2015-06-01

    Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore » (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less

  19. Synchronization in node of complex networks consist of complex chaotic system

    SciTech Connect (OSTI)

    Wei, Qiang, E-mail: qiangweibeihua@163.com [Beihua University computer and technology College, BeiHua University, Jilin, 132021, Jilin (China); Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin (China); Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024 (China); Xie, Cheng-jun [Beihua University computer and technology College, BeiHua University, Jilin, 132021, Jilin (China); Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin (China); Liu, Hong-jun [School of Information Engineering, Weifang Vocational College, Weifang, 261041 (China); Li, Yan-hui [The Library, Weifang Vocational College, Weifang, 261041 (China)

    2014-07-15

    A new synchronization method is investigated for node of complex networks consists of complex chaotic system. When complex networks realize synchronization, different component of complex state variable synchronize up to different scaling complex function by a designed complex feedback controller. This paper change synchronization scaling function from real field to complex field for synchronization in node of complex networks with complex chaotic system. Synchronization in constant delay and time-varying coupling delay complex networks are investigated, respectively. Numerical simulations are provided to show the effectiveness of the proposed method.

  20. Lambda network having 2{sup m{minus}1} nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

    DOE Patents [OSTI]

    Napolitano, L.M. Jr.

    1995-11-28

    The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance. 14 figs.

  1. Minimally buffered data transfers between nodes in a data communications network

    DOE Patents [OSTI]

    Miller, Douglas R.

    2015-06-23

    Methods, apparatus, and products for minimally buffered data transfers between nodes in a data communications network are disclosed that include: receiving, by a messaging module on an origin node, a storage identifier, a origin data type, and a target data type, the storage identifier specifying application storage containing data, the origin data type describing a data subset contained in the origin application storage, the target data type describing an arrangement of the data subset in application storage on a target node; creating, by the messaging module, origin metadata describing the origin data type; selecting, by the messaging module from the origin application storage in dependence upon the origin metadata and the storage identifier, the data subset; and transmitting, by the messaging module to the target node, the selected data subset for storing in the target application storage in dependence upon the target data type without temporarily buffering the data subset.

  2. Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Faraj, Ahmad A; Inglett, Todd A; Ratterman, Joseph D

    2013-04-16

    Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

  3. Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Faraj, Ahmad A.; Inglett, Todd A.; Ratterman, Joseph D.

    2012-10-23

    Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.

  4. Information-based self-organization of sensor nodes of a sensor network

    DOE Patents [OSTI]

    Ko, Teresa H.; Berry, Nina M.

    2011-09-20

    A sensor node detects a plurality of information-based events. The sensor node determines whether at least one other sensor node is an information neighbor of the sensor node based on at least a portion of the plurality of information-based events. The information neighbor has an overlapping field of view with the sensor node. The sensor node sends at least one communication to the at least one other sensor node that is an information neighbor of the sensor node in response to at least one information-based event of the plurality of information-based events.

  5. Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks

    DOE Patents [OSTI]

    Archer, Charles J.; Inglett, Todd A.; Ratterman, Joseph D.; Smith, Brian E.

    2010-03-02

    Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collective network such that the master node is a physical root.

  6. A Robust and Flexible Design for GCEP Unattended Online Enrichment Monitoring: An OLEM Collection Node Network

    SciTech Connect (OSTI)

    Younkin, James R; March-Leuba, Jose A; Garner, James R

    2013-01-01

    shelf (COTS) components and summarized the OLEM collection node data security provisions. This paper will discuss a secure and redundant network of OLEM collection nodes, auxiliary detection units and supporting junction boxes distributed throughout a facility for monitoring enrichment on product, feed and tails unit header pipes; the purpose and capability of the built-in Electronic Optical Sealing System (EOSS) network gateway; and a network approach for obtaining reliable and authenticated pressure measurements.

  7. Tera-node Network Technology (TASK 4) Network Infrastructure Activities (NIA) final report

    SciTech Connect (OSTI)

    Postel, John; Bannister, Joe

    2000-03-15

    The TNT project developed software technologies in scalable personal telecommunications (SPT), Reservation Protocol 2 (RSVP2), Scalable Computing Infrastructure (SCOPE), and Network Infrastructure Activities (NIA). SPT = developed many innovative protocols to support the use of videoconferencing applications on the Internet. RSVP2 = developed a new reference model and further standardization of RSVP. SCOPE = developed dynamic resource discovery techniques and distributed directory services in support of resource allocation for large distributed systems and computations. NIA = provided policy, operational, and support to the transitioning Internet.

  8. HP XC System Cast Briefing

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Linux in High Performance Computing vendor perspective Scott McClellan CTO/HPTCD Salishan Conference - April '03 page 2 HP Confidential Perspective * My Role/Background - CTO of the HPTCD division in the new HP - Background: * pm-HP (1984); commercial computing; OS development (lead architect MPE); telecom(carrier-grade severs & HA architect); joined HPTCD in June/'02 * This presentation represents my personal opinion, not the official position of HP. * HP is - HW vendor (servers - Total

  9. System and method for merging clusters of wireless nodes in a wireless network

    DOE Patents [OSTI]

    Budampati, Ramakrishna S.; Gonia, Patrick S.; Kolavennu, Soumitri N.; Mahasenan, Arun V.

    2012-05-29

    A system includes a first cluster having multiple first wireless nodes. One first node is configured to act as a first cluster master, and other first nodes are configured to receive time synchronization information provided by the first cluster master. The system also includes a second cluster having one or more second wireless nodes. One second node is configured to act as a second cluster master, and any other second nodes configured to receive time synchronization information provided by the second cluster master. The system further includes a manager configured to merge the clusters into a combined cluster. One of the nodes is configured to act as a single cluster master for the combined cluster, and the other nodes are configured to receive time synchronization information provided by the single cluster master.

  10. Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Data Transfer Nodes Data Transfer Nodes PDSF has dedicated nodes for grid services and data transfers named pdsfdtn1.nersc.gov and pdsfdtn2.nersc.gov. Both nodes have 10 Gb/s network connections to the NERSC network. Please avoid using the interactive nodes for bulk data transfer. Not only can it be disruptive to other users but the network connection is only 1 Gb/s so it will take longer. For transfers using /project and/or HPSS use the NERSC data transfer nodes - see the NERSC data transfer

  11. Embedding global barrier and collective in torus network with each node combining input from receivers according to class map for output to senders

    DOE Patents [OSTI]

    Chen, Dong; Coteus, Paul W; Eisley, Noel A; Gara, Alan; Heidelberger, Philip; Senger, Robert M; Salapura, Valentina; Steinmacher-Burow, Burkhard; Sugawara, Yutaka; Takken, Todd E

    2013-08-27

    Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computer program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.

  12. Compute Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Nodes Quad CoreAMDOpteronprocessor Compute Node Configuration 9,572 nodes 1 quad-core AMD 'Budapest' 2.3 GHz processor per node 4 cores per node (38,288 total cores) 8 GB...

  13. Multiple node remote messaging

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Ohmacht, Martin; Salapura, Valentina; Steinmacher-Burow, Burkhard; Vranas, Pavlos

    2010-08-31

    A method for passing remote messages in a parallel computer system formed as a network of interconnected compute nodes includes that a first compute node (A) sends a single remote message to a remote second compute node (B) in order to control the remote second compute node (B) to send at least one remote message. The method includes various steps including controlling a DMA engine at first compute node (A) to prepare the single remote message to include a first message descriptor and at least one remote message descriptor for controlling the remote second compute node (B) to send at least one remote message, including putting the first message descriptor into an injection FIFO at the first compute node (A) and sending the single remote message and the at least one remote message descriptor to the second compute node (B).

  14. Compute Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Compute Nodes Compute Nodes Quad CoreAMDOpteronprocessor Compute Node Configuration 9,572 nodes 1 quad-core AMD 'Budapest' 2.3 GHz processor per node 4 cores per node (38,288 total cores) 8 GB DDR3 800 MHz memory per node Peak Gflop rate 9.2 Gflops/core 36.8 Gflops/node 352 Tflops for the entire machine Each core has their own L1 and L2 caches, with 64 KB and 512KB respectively 2 MB L3 cache shared among the 4 cores Compute Node Software By default the compute nodes run a restricted low-overhead

  15. Login Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Login Nodes Login Nodes Franklin has 10 login nodes directly connected to the compute nodes. Another login node, named "Freedom," is connected "externally." Login nodes are used to edit files, compile codes, and submit job scripts to the batch system to run on the "compute nodes." Internal Login Nodes Quick Facts When you ssh to franklin.nersc.gov, you are connecting to an internal "login node." Franklin has 10 internal login nodes (this is largely

  16. Login Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Login Nodes Login Nodes Login Node Quick Facts When you ssh to hopper.nersc.gov, you are connecting to a "login node." Login nodes are used to edit files, compile codes, and submit job scripts to the batch system to run on the "compute nodes." Hopper has 12 login nodes (this is largely transparent to users). 4 quad-core AMD 2.4 GHz Opteron processers (16 cores total) on 8 of the login nodes 4 8-core AMD 2.0 GHz Opteron processors (32 cores total) on 4 of the login nodes. Each

  17. Compute nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Compute nodes Compute nodes Click here to see more detailed hierachical map of the topology of a compute node. Last edited: 2015-03-30 20:55:24...

  18. Login Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Login Nodes Login Nodes Login Node Quick Facts When you ssh to any NERSC computer system (such as ssh edison.nersc.gov), you are connecting to a "login node." The login nodes sit behind a load balancer. New connections are assigned to a login node on a round robin fashion with the exception that if you've connected to a system recently, the load balancer will attempt to put you on the same login node as your previous connection. Login nodes are used to edit files, compile codes, and

  19. Crystal Structure of the HP1-EMSY Complex Reveals an Unusual Mode of HP1 Binding

    SciTech Connect (OSTI)

    Huang,Y.; Myers, M.; Xu, R.

    2006-01-01

    Heterochromatin protein-1 (HP1) plays an essential role in both the assembly of higher-order chromatin structure and epigenetic inheritance. The C-terminal chromo shadow domain (CSD) of HP1 is responsible for homodimerization and interaction with a number of chromatin-associated nonhistone proteins, including EMSY, which is a BRCA2-interacting protein that has been implicated in the development of breast and ovarian cancer. We have determined the crystal structure of the HP1{beta} CSD in complex with the N-terminal domain of EMSY at 1.8 Angstroms resolution. Surprisingly, the structure reveals that EMSY is bound by two HP1 CSD homodimers, and the binding sequences differ from the consensus HP1 binding motif PXVXL. This structural information expands our understanding of HP1 binding specificity and provides insights into interactions between HP1 homodimers that are likely to be important for heterochromatin formation.

  20. Extra-Large Memory Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    qsub -I -X -q regxlmem -l nodes1:ppn1 -l walltime01:00:00 -l mem16GB Use of NX X-windows forwarding is normally slow due to the network latency. NERSC provide the NX...

  1. U-137: HP Performance Manager Unspecified Bug Lets Remote Users...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    vulnerability has been identified with HP Performance Manager running on HP-UX, Linux, Solaris, and Windows. The vulnerability could be exploited remotely to execute...

  2. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies...

  3. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers...

    Office of Environmental Management (EM)

    HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies ...

  4. U-203: HP Photosmart Bug Lets Remote Users Deny Service

    Broader source: Energy.gov [DOE]

    A vulnerability was reported in HP Photosmart. A remote user can cause denial of service conditions.

  5. Synchronizing compute node time bases in a parallel computer

    DOE Patents [OSTI]

    Chen, Dong; Faraj, Daniel A; Gooding, Thomas M; Heidelberger, Philip

    2015-01-27

    Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.

  6. Synchronizing compute node time bases in a parallel computer

    DOE Patents [OSTI]

    Chen, Dong; Faraj, Daniel A; Gooding, Thomas M; Heidelberger, Philip

    2014-12-30

    Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.

  7. Active Diesel Emission Control Technology for Sub-50 HP Engines...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Sub-50 HP Engines with Low Exhaust Temperature Profiles Active Diesel Emission Control Technology for Sub-50 HP Engines with Low Exhaust Temperature Profiles A new type of emission ...

  8. U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    0:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access October 13, 2011 - 8:15am...

  9. From: Mulveny, Jennifer [mailto:jennifer.mulveny@hp.com]

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Mulveny, Jennifer [mailto:jennifer.mulveny@hp.com] Sent: Tuesday, April 17, 2012 4:04 PM To: Mulveny, Jennifer; Exparte Communications Cc: Watt, Steve; Kido, Michael Subject: RE: HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies This following notes summarize the discussion that HP held via teleconference with the Department of Energy on April 10, 2012. Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery

  10. U-013: HP Data Protector Multiple Unspecified Vulnerabilities

    Broader source: Energy.gov [DOE]

    Multiple vulnerabilities were reported in HP Data Protector. A remote user can execute arbitrary code on the target system.

  11. Node and GPU Configuration

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Configuration Node and GPU Configuration Compute Nodes and GPU Cards Dirac is a 50 GPU node cluster connected with QDR IB. Each GPU node also contains 2 Intel 5530 2.4 GHz, 8MB cache, 5.86GT/sec QPI Quad core Nehalem processors (8 cores per node) and 24GB DDR3-1066 Reg ECC memory. 44 nodes: 1 NVIDIA Tesla C2050 (code named Fermi) GPU with 3GB of memory and 448 parallel CUDA processor cores. 4 nodes: 1 C1060 NVIDIA Tesla GPU with 4GB of memory and 240 parallel CUDA processor cores. 1 node: 4

  12. Optimizing Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Optimizing Data Transfer Nodes using Packet Pacing Nathan Hanford University of California ... An important performance problem that we foresee with Data Transfer Nodes (DTNs) in the ...

  13. Extra-Large Memory Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Extra-Large Memory Nodes Extra-Large Memory Nodes Extra-Large Memory Nodes Overview Carver has two "extra-large" memory nodes; each node has four 8-core Intel X7550 ("Nehalem EX")...

  14. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers...

    Broader source: Energy.gov (indexed) [DOE]

    to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. ... HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies ...

  15. T-588: HP Virtual SAN Appliance Stack Overflow

    Office of Energy Efficiency and Renewable Energy (EERE)

    A vulnerability has been reported in HP StorageWorks P4000 Virtual SAN Appliance Software, which can be exploited by malicious people to compromise a vulnerable system.

  16. Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Transfer » Data Transfer Nodes Data Transfer Nodes A redirector page has been set up without anywhere to redirect to. Last edited: 2016-04-29 11:35:12

  17. Interactive (login) Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Interactive (login) Nodes Interactive (login) Nodes There are 3 interactive nodes at PDSF, pdsf[6-8].nersc.gov, that should be accessed via ssh to pdsf.nersc.gov. These are the gateways to accessing the rest of PDSF. Users can submit batch jobs as well as view and manipulate their files and directories from the interactive nodes. The configuration of the interactive nodes is shown in the table below. Processor Clock Speed (GHz) Architecture Cores Total Memory (GB) Scratch Space (GB) Intel Xeon

  18. Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

    DOE Patents [OSTI]

    Archer, Charles J.; Hardwick, Camesha R.; McCarthy, Patrick J.; Wallenfelt, Brian P.

    2009-06-23

    Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

  19. Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

    DOE Patents [OSTI]

    Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

    2010-11-16

    A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

  20. V-144: HP Printers Let Remote Users Access Files on the Printer...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4: HP Printers Let Remote Users Access Files on the Printer V-144: HP Printers Let Remote Users Access Files on the Printer April 29, 2013 - 12:27am Addthis PROBLEM: HP Printers...

  1. Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Data Transfer Nodes HPSS Data Archive IO Resources for Scientific Applications at NERSC Optimizing IO performance on the Lustre file system IO Formats Science Databases Sharing ...

  2. V-146: HP Service Manager Bugs Permit Cross-Site Scripting and...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure Attacks V-146: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure...

  3. U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    2: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks U-142: HP Onboard Administrator Bugs Let Remote Users Gain...

  4. V-218: HP Service Manager Unspecified Flaw Lets Remote Users...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access U-029: TCPIP Services for OpenVMS POPIMAP Service Bug Lets Remote Users Gain Unauthorized Access...

  5. Perlick: ENERGY STAR Referral (HP72ROO-S)

    Broader source: Energy.gov [DOE]

    DOE referred Perlick refrigerator HP72ROO-S to EPA, brand manager of the ENERGY STAR program, for appropriate action after DOE testing revealed that the model does not meet ENERGY STAR requirements.

  6. Perlick: ENERGY STAR Referral (HP48RO-S)

    Broader source: Energy.gov [DOE]

    DOE referred Perlick refrigerator HP48RO-S to EPA, brand manager of the ENERGY STAR program, for appropriate action after DOE testing revealed that the model does not meet ENERGY STAR requirements.

  7. HP Supercomputer at NREL Garners Top Honor - News Feature | NREL

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    HP Supercomputer at NREL Garners Top Honor October 13, 2014 This photo shows three men in suits standing in front of a data center. GSA Administrator Dan Tangherlini (left), NREL Associate Lab Director Bryan Hannegan, and NREL Director Dan Arvizu discuss the high performance computer Peregrine during a tour of the ESIF. NREL collaborated with HP and Intel to develop the innovative warm-water, liquid-cooled supercomputer, which recently won an R&D 100 award. Peregrine is the first

  8. Tonopah Test Range EGS graphics tracking display system: HP370

    SciTech Connect (OSTI)

    Meyer, R.H.; Bauhs, K.C.

    1994-08-01

    This report describes the HP370 component of the Enhanced Graphics System (EGS) used at Tonopah Test Range (TTR). Selected Radar data is fed into the computer systems and the resulting tracking symbols are displayed on high-resolution video monitors in real time. These tracking symbols overlay background maps and are used for monitoring/controlling various flight vehicles. This report discusses both the operational aspects and the internal configuration of the HP370 Workstation portion of the EGS system.

  9. SiNode Systems

    Broader source: Energy.gov [DOE]

    SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher battery capacity and faster charging rates, all while being produced via a low cost solution chemistry-based manufacturing process.

  10. Distributed downhole drilling network

    DOE Patents [OSTI]

    Hall, David R.; Hall, Jr., H. Tracy; Fox, Joe; Pixton, David S.

    2006-11-21

    A high-speed downhole network providing real-time data from downhole components of a drilling strings includes a bottom-hole node interfacing to a bottom-hole assembly located proximate the bottom end of a drill string. A top-hole node is connected proximate the top end of the drill string. One or several intermediate nodes are located along the drill string between the bottom-hole node and the top-hole node. The intermediate nodes are configured to receive and transmit data packets transmitted between the bottom-hole node and the top-hole node. A communications link, integrated into the drill string, is used to operably connect the bottom-hole node, the intermediate nodes, and the top-hole node. In selected embodiments, a personal or other computer may be connected to the top-hole node, to analyze data received from the intermediate and bottom-hole nodes.

  11. Interactive (login) Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    There are 3 interactive nodes at PDSF, pdsf6-8.nersc.gov, that should be accessed via ssh to pdsf.nersc.gov. These are the gateways to accessing the rest of PDSF. Users can ...

  12. Methods and apparatus using commutative error detection values for fault isolation in multiple node computers

    DOE Patents [OSTI]

    Almasi, Gheorghe [Ardsley, NY; Blumrich, Matthias Augustin [Ridgefield, CT; Chen, Dong [Croton-On-Hudson, NY; Coteus, Paul [Yorktown, NY; Gara, Alan [Mount Kisco, NY; Giampapa, Mark E. [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Hoenicke, Dirk I. [Ossining, NY; Singh, Sarabjeet [Mississauga, CA; Steinmacher-Burow, Burkhard D. [Wernau, DE; Takken, Todd [Brewster, NY; Vranas, Pavlos [Bedford Hills, NY

    2008-06-03

    Methods and apparatus perform fault isolation in multiple node computing systems using commutative error detection values for--example, checksums--to identify and to isolate faulty nodes. When information associated with a reproducible portion of a computer program is injected into a network by a node, a commutative error detection value is calculated. At intervals, node fault detection apparatus associated with the multiple node computer system retrieve commutative error detection values associated with the node and stores them in memory. When the computer program is executed again by the multiple node computer system, new commutative error detection values are created and stored in memory. The node fault detection apparatus identifies faulty nodes by comparing commutative error detection values associated with reproducible portions of the application program generated by a particular node from different runs of the application program. Differences in values indicate a possible faulty node.

  13. Vulnerability of critical infrastructures : identifying critical nodes.

    SciTech Connect (OSTI)

    Cox, Roger Gary; Robinson, David Gerald

    2004-06-01

    The objective of this research was the development of tools and techniques for the identification of critical nodes within critical infrastructures. These are nodes that, if disrupted through natural events or terrorist action, would cause the most widespread, immediate damage. This research focuses on one particular element of the national infrastructure: the bulk power system. Through the identification of critical elements and the quantification of the consequences of their failure, site-specific vulnerability analyses can be focused at those locations where additional security measures could be effectively implemented. In particular, with appropriate sizing and placement within the grid, distributed generation in the form of regional power parks may reduce or even prevent the impact of widespread network power outages. Even without additional security measures, increased awareness of sensitive power grid locations can provide a basis for more effective national, state and local emergency planning. A number of methods for identifying critical nodes were investigated: small-world (or network theory), polyhedral dynamics, and an artificial intelligence-based search method - particle swarm optimization. PSO was found to be the only viable approach and was applied to a variety of industry accepted test networks to validate the ability of the approach to identify sets of critical nodes. The approach was coded in a software package called Buzzard and integrated with a traditional power flow code. A number of industry accepted test networks were employed to validate the approach. The techniques (and software) are not unique to power grid network, but could be applied to a variety of complex, interacting infrastructures.

  14. Extra-Large Memory Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Extra-Large Memory Nodes Extra-Large Memory Nodes Extra-Large Memory Nodes Overview Carver has two "extra-large" memory nodes; each node has four 8-core Intel X7550 ("Nehalem EX") 2.0 GHz processors (32 cores total) and 1TB memory. These nodes are available through the queue "reg_xlmem". They can be used for interactive and batch jobs that require large amount of memory (16GB per core or more). reg_xlmem queue Please refer to the "Queues and Policies" page

  15. V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems April...

  16. V-166: HP-UX Directory Server Discloses Passwords to Remote Authentica...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users V-166: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users May...

  17. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies

    Broader source: Energy.gov [DOE]

    Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. Thank you for taking the time to speak with us. HP...

  18. U-208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code

    Broader source: Energy.gov [DOE]

    Two vulnerabilities were reported in HP Operations Agent. A remote user can execute arbitrary code on the target system

  19. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Power Supplies | Department of Energy HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. Thank you for taking the time to speak with us. HP believes that existing voluntary Market Access Requirements, such as EPEAT and ENERGY

  20. U-017: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information

    Broader source: Energy.gov [DOE]

    A vulnerability was reported in HP MFP Digital Sending Software. A local user can obtain potentially sensitive information.

  1. U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users

    Broader source: Energy.gov [DOE]

    Two vulnerabilities were reported in HP WBEM. A remote or local user can gain access to diagnostic data.

  2. V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access

    Broader source: Energy.gov [DOE]

    This security update resolves a vulnerability in the HP Service Manager which allows people to have access to unauthorized information

  3. Executing scatter operation to parallel computer nodes by repeatedly broadcasting content of send buffer partition corresponding to each node upon bitwise OR operation

    DOE Patents [OSTI]

    Archer, Charles J.; Ratterman, Joseph D.

    2009-11-06

    Executing a scatter operation on a parallel computer includes: configuring a send buffer on a logical root, the send buffer having positions, each position corresponding to a ranked node in an operational group of compute nodes and for storing contents scattered to that ranked node; and repeatedly for each position in the send buffer: broadcasting, by the logical root to each of the other compute nodes on a global combining network, the contents of the current position of the send buffer using a bitwise OR operation, determining, by each compute node, whether the current position in the send buffer corresponds with the rank of that compute node, if the current position corresponds with the rank, receiving the contents and storing the contents in a reception buffer of that compute node, and if the current position does not correspond with the rank, discarding the contents.

  4. U-275: HP IBRIX X9000 Storage Discloses Information to Remote Users

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified with HP IBRIX X9000 Storage. The vulnerability could be remotely exploited to allow disclosure of information.

  5. Enforcement Policy Statement: Off Mode Standards for CAC/HP | Department of

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Energy Policy Statement: Off Mode Standards for CAC/HP Enforcement Policy Statement: Off Mode Standards for CAC/HP July 8, 2014 DOE will not seek civil penalties for violation of the off mode electrical power consumption standard for central air conditioners or central air conditioning heat pumps (CAC/HP) until 180 days following publication of a final rule establishing a test method for measuring off mode electrical power consumption for CAC/HP. Enforcement Policy: Off Mode Standards for

  6. T-643: HP OpenView Storage Data Protector Unspecified Code Execution Vulnerability

    Broader source: Energy.gov [DOE]

    A vulnerability has been reported in HP OpenView Storage Data Protector, which can be exploited by malicious people to compromise a vulnerable system.

  7. T-538: HP OpenView Storage Data Protector Bug Lets Remote Users Execute Arbitrary Code

    Broader source: Energy.gov [DOE]

    A vulnerability was reported in HP OpenView Storage Data Protector. A remote user can execute arbitrary code on the target system.

  8. T-590: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified in HP Diagnostics. The vulnerability could be exploited remotely resulting in cross site scripting (XSS).

  9. T-608: HP Virtual Server Environment Lets Remote Authenticated Users Gain Elevated Privileges

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified in HP Virtual Server Environment for Windows. The vulnerability could be exploited remotely to elevate privileges.

  10. V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified with certain HP LaserJet Pro printers. The vulnerability could be exploited remotely to gain unauthorized access to data.

  11. A Unix Print Filter for Controlling an HP Laserjet Printer

    SciTech Connect (OSTI)

    Hoffman, F.M.

    1992-01-01

    This report describes a Unix print filter designed to control an Hewlett Packard Laserjet or other printer that uses Hewlett Packard's Printer Control Language (HP-PCL). The filter gives users the ability to control print pitch, orientation, and indentation by using standard flags to the Unix lpr command or multiple entries in the /etc/printcap file and allows both ascii and binary (i.e., graphics and down-loadable fonts) files to be printed. Additionally, the filter provides some accounting capability. The supported print pitch and orientation options are described, as are the different configuration options. The code for the filter is included in Appendix A and sample entries for the /etc/printcap file are included in Appendix B and C.

  12. Absolute properties of the triple star HP Aurigae

    SciTech Connect (OSTI)

    Lacy, Claud H. Sandberg; Burks, Charles L.; Torres, Guillermo; Wolf, Marek E-mail: clburks@email.uark.edu E-mail: wolf@cesnet.cz

    2014-01-01

    New photometric, spectroscopic, and eclipse timing observations of the eclipsing binary star HP Aur allow for very accurate orbital determinations, even in the presence of a third body and transient starspot activity. The eclipsing binary masses are determined to an accuracy of ±0.4% and the radii to ±0.6%. The masses are 0.9543 ± 0.0041 and 0.8094 ± 0.0036 solar masses, and the radii are 1.0278 ± 0.0042 and 0.7758 ± 0.0034 solar radii, respectively. The orbital period in the outer orbit is accurately determined for the first time: 4.332 ± 0.011 yr. A comparison with current theories of stellar evolution shows that the components' absolute properties can be well-matched by the current models at an age of about 7 billion years.

  13. T-570: HP Security Bulletin- HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified with HP-UX OpenSSL. This vulnerability could be exploited remotely to execute arbitrary code or create a Denial of Service (DoS) or an authentication bypass.

  14. New 1 Terabyte Memory Node

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    New 1 Terabyte Memory Node New 1 Terabyte Memory Node June 17, 2011 by Francesca Verdier A new "extra large" memory node that has four 8-core Nehalem EX processors (32 cores total) and 1TB memory has been deployed in the Carver/Magellan complex. See Memory Considerations on Carver. Subscribe via RSS Subscribe Browse by Date August 2016 June 2016 May 2016 April 2016 January 2016 December 2015 November 2015 October 2015 September 2015 August 2015 July 2015 April 2015 March 2015 January

  15. U-238: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks

    Broader source: Energy.gov [DOE]

    Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers to inject arbitrary web script or HTML via unspecified vectors.

  16. Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    ESnet About ESnet Our Mission The Network ESnet History Governance & Policies Career Opportunities ESnet Staff & Org Chart Contact Us Contact Us Technical Assistance: 1 800-33-ESnet (Inside US) 1 800-333-7638 (Inside US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: trouble@es.net Provide Web Site Feedback: info@es.net About ESnet A Platform for Science Discovery The Energy Sciences Network (ESnet) is a high-performance, unclassified network built to

  17. Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes

    DOE Patents [OSTI]

    Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey

    2010-10-05

    In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.

  18. Microfluidic ultrasonic particle separators with engineered node...

    Office of Scientific and Technical Information (OSTI)

    particle separators with engineered node locations and geometries Citation Details In-Document Search Title: Microfluidic ultrasonic particle separators with engineered node ...

  19. Global tree network for computing structures enabling global processing operations

    DOE Patents [OSTI]

    Blumrich; Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    2010-01-19

    A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

  20. Complexed Adsorbed HP1 HP1 L2 L7 L7 L7 L2 H3 H3 National Energy

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Complexed Adsorbed HP1 HP1 L2 L7 L7 L7 L2 H3 H3 National Energy Research Scientific Computing Center 2011 Annual Report Ernest Orlando Lawrence Berkeley National Laboratory 1 Cyclotron Road, Berkeley, CA 94720-8148 This work was supported by the Director, Office of Science, Office of Advanced Scientific Computing Research of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. National Energy Research Scientific Computing Center 2011 Annual Report The Year in Perspective Research

  1. SensorNet Node Suite

    Energy Science and Technology Software Center (OSTI)

    2004-09-01

    The software in the SensorNet Node adopts and builds on IEEE 1451 interface principles to read data from and control sensors, stores the data in internal database structures, and transmits it in adapted Web Feature Services protocol packets to the SensorNet database. Failover software ensures that at least one available mode of communication remains alive.

  2. Vehicle Technologies Office Merit Review 2016: 2016 KIVA-hpFE Development:

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    A Robust and Accurate Engine Modeling Software | Department of Energy 2016 KIVA-hpFE Development: A Robust and Accurate Engine Modeling Software Vehicle Technologies Office Merit Review 2016: 2016 KIVA-hpFE Development: A Robust and Accurate Engine Modeling Software Presentation given by Los Alamos National Laboratory (LANL) at the 2016 DOE Vehicle Technologies Office and Hydrogen and Fuel Cells Program Annual Merit Review and Peer Evaluation Meeting about Combustion Engines

  3. Controlling data transfers from an origin compute node to a target compute node

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2011-06-21

    Methods, apparatus, and products are disclosed for controlling data transfers from an origin compute node to a target compute node that include: receiving, by an application messaging module on the target compute node, an indication of a data transfer from an origin compute node to the target compute node; and administering, by the application messaging module on the target compute node, the data transfer using one or more messaging primitives of a system messaging module in dependence upon the indication.

  4. Sandia Compact Sensor Node (SCSN) v. 1.0

    Energy Science and Technology Software Center (OSTI)

    2009-01-07

    The SCSN communication protocol is implemented in software and incorporates elements of Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), and Carrier Sense Multiple Access (CSMA) to reduce radio message collisions, latency, and power consumption. Alarm messages are expeditiously routed to a central node as a 'star' network with minimum overhead. Other messages can be routed along network links between any two nodes so that peer-to-peer communication is possible. Broadcast messages can bemore » composed that flood the entire network or just specific portions with minimal radio traffic and latency. Two-way communication with sensor nodes, which sleep most of the time to conserve battery life, can occur at seven second intervals. SCSN software also incorporates special algorithms to minimize superfluous radio traffic that can result from excessive intrusion alarm messages. A built-in seismic detector is implemented with a geophone and software that distinguishes between pedestrian and vehicular targets. Other external sensors can be attached to a SCSN using supervised interface lines that are controlled by software. All software is written in the ANSI C language for ease of development, maintenance, and portability.« less

  5. Organization of growing random networks

    SciTech Connect (OSTI)

    Krapivsky, P. L.; Redner, S.

    2001-06-01

    The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A{sub k}. When A{sub k} grows more slowly than linearly with k, the number of nodes with k links, N{sub k}(t), decays faster than a power law in k, while for A{sub k} growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When A{sub k} is asymptotically linear, N{sub k}(t){similar_to}tk{sup {minus}{nu}}, with {nu} dependent on details of the attachment probability, but in the range 2{lt}{nu}{lt}{infinity}. The combined age and degree distribution of nodes shows that old nodes typically have a large degree. There is also a significant correlation in the degrees of neighboring nodes, so that nodes of similar degree are more likely to be connected. The size distributions of the in and out components of the network with respect to a given node{emdash}namely, its {open_quotes}descendants{close_quotes} and {open_quotes}ancestors{close_quotes}{emdash}are also determined. The in component exhibits a robust s{sup {minus}2} power-law tail, where s is the component size. The out component has a typical size of order lnt, and it provides basic insights into the genealogy of the network.

  6. Three-step H-P adaptve strategy for the incompressible Navier-Stokes equations

    SciTech Connect (OSTI)

    Oden, J.T.; Wu, W.; Ainsworth, M.

    1995-12-31

    Recently, a reliable a posteriori error estimate was developed, mainly based on the element residual method, for a class of steady state incompressible Navier-Stokes equations. In this paper, using this error estimate, a three-step h-p adaptive strategy is developed to solve incompressible flow problems. The goal of developing an h-p adaptive strategy is to obtain accurate approximate solutions while minimizing computational costs. The basic idea of the three-step h-p adaptive strategy is to solve for the system on the three consecutive meshes, i.e. an initial mesh, an intermediate h-p adaptive mesh, and a final h-p adaptive mesh. Each new adaptive mesh is obtained by estimating the error on the previous mesh and executing a single h- or p- refinement procedure on the previous mesh according to the results of the adaptive strategy. Numerical results indicate that the proposed three-step adaptive strategy produces accurate solutions while keeping the total computational costs under control.

  7. Dedicated heterogeneous node scheduling including backfill scheduling

    DOE Patents [OSTI]

    Wood, Robert R.; Eckert, Philip D.; Hommes, Gregg

    2006-07-25

    A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

  8. Message communications of particular message types between compute nodes using DMA shadow buffers

    DOE Patents [OSTI]

    Blocksome, Michael A.; Parker, Jeffrey J.

    2010-11-16

    Message communications of particular message types between compute nodes using DMA shadow buffers includes: receiving a buffer identifier specifying an application buffer having a message of a particular type for transmission to a target compute node through a network; selecting one of a plurality of shadow buffers for a DMA engine on the compute node for storing the message, each shadow buffer corresponding to a slot of an injection FIFO buffer maintained by the DMA engine; storing the message in the selected shadow buffer; creating a data descriptor for the message stored in the selected shadow buffer; injecting the data descriptor into the slot of the injection FIFO buffer corresponding to the selected shadow buffer; selecting the data descriptor from the injection FIFO buffer; and transmitting the message specified by the selected data descriptor through the data communications network to the target compute node.

  9. Network resilience; A measure of network fault tolerance

    SciTech Connect (OSTI)

    Najjar, W. . Dept. of Computer Science); Gaudoit, J.L. . Dept. of Electrical Engineering)

    1990-02-01

    The failure of a node in a multicomputer system will not only reduce the computational power but also alter the network's topology. Network fault tolerance is a measure of the number of failures the network can sustain before a disconnection occurs. It is expressed traditionally as the network's node degree. In this paper, the authors propose a probabilistic measure of network fault tolerance expressed as the probability f a disconnection. Qualitative evaluation of this measure is presented. As expected, the single-node disconnection probability is the dominant factor irrespective of the topology under consideration. They derive an analytical approximation of the disconnection probability and verify it with Monte Carlo simulation. Based on this model, the measures of network resilience and relative network resilience are proposed as probabilistic measures of network fault tolerance. These are then used to evaluate the effects of the disconnection probability on the reliability of the system.

  10. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model

    SciTech Connect (OSTI)

    Agarwala, R. [National Institutes of Health, Bethesda, MD (United States); Batzoglou, S. [MIT, Cambridge, MA (United States); Dancik, V. [Univ. of Southern California, Los Angeles, CA (United States)] [and others

    1997-06-01

    We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. We use the HP model for protein folding proposed by Dill, which models protein as a chain of amino acid residues that are either hydrophobic or polar, and hydrophobic interactions are the dominant initial driving force for the protein folding. Hart and Istrail gave approximation algorithms for folding proteins on the cubic lattice under HP model. In this paper, we examine the choice of a lattice by considering its algorithmic and geometric implications and argue that triangular lattice is a more reasonable choice. We present a set of folding rules for a triangular lattice and analyze the approximation ratio which they achieve. In addition, we introduce a generalization of the HP model to account for residues having different levels of hydrophobicity. After describing the biological foundation for this generalization, we show that in the new model we are able to achieve similar constant factor approximation guarantees on the triangular lattice as were achieved in the standard HP model. While the structures derived from our folding rules are probably still far from biological reality, we hope that having a set of folding rules with different properties will yield more interesting folds when combined.

  11. Collective network for computer structures

    DOE Patents [OSTI]

    Blumrich, Matthias A; Coteus, Paul W; Chen, Dong; Gara, Alan; Giampapa, Mark E; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd E; Steinmacher-Burow, Burkhard D; Vranas, Pavlos M

    2014-01-07

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to the needs of a processing algorithm.

  12. Collective network for computer structures

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Coteus, Paul W.; Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd E.; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.

    2011-08-16

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

  13. Global interrupt and barrier networks

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E; Heidelberger, Philip; Kopcsay, Gerard V.; Steinmacher-Burow, Burkhard D.; Takken, Todd E.

    2008-10-28

    A system and method for generating global asynchronous signals in a computing structure. Particularly, a global interrupt and barrier network is implemented that implements logic for generating global interrupt and barrier signals for controlling global asynchronous operations performed by processing elements at selected processing nodes of a computing structure in accordance with a processing algorithm; and includes the physical interconnecting of the processing nodes for communicating the global interrupt and barrier signals to the elements via low-latency paths. The global asynchronous signals respectively initiate interrupt and barrier operations at the processing nodes at times selected for optimizing performance of the processing algorithms. In one embodiment, the global interrupt and barrier network is implemented in a scalable, massively parallel supercomputing device structure comprising a plurality of processing nodes interconnected by multiple independent networks, with each node including one or more processing elements for performing computation or communication activity as required when performing parallel algorithm operations. One multiple independent network includes a global tree network for enabling high-speed global tree communications among global tree network nodes or sub-trees thereof. The global interrupt and barrier network may operate in parallel with the global tree network for providing global asynchronous sideband signals.

  14. Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

    DOE Patents [OSTI]

    Bhanot, Gyan V.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.

    2012-01-10

    The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

  15. Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

    DOE Patents [OSTI]

    Bhanot, Gyan V.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.

    2008-01-01

    The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

  16. The Node Monitoring Component of a Scalable Systems Software Environment

    SciTech Connect (OSTI)

    Samuel James Miller

    2006-08-09

    This research describes Fountain, a suite of programs used to monitor the resources of a cluster. A cluster is a collection of individual computers that are connected via a high speed communication network. They are traditionally used by users who desire more resources, such as processing power and memory, than any single computer can provide. A common drawback to effectively utilizing such a large-scale system is the management infrastructure, which often does not often scale well as the system grows. Large-scale parallel systems provide new research challenges in the area of systems software, the programs or tools that manage the system from boot-up to running a parallel job. The approach presented in this thesis utilizes a collection of separate components that communicate with each other to achieve a common goal. While systems software comprises a broad array of components, this thesis focuses on the design choices for a node monitoring component. We will describe Fountain, an implementation of the Scalable Systems Software (SSS) node monitor specification. It is targeted at aggregate node monitoring for clusters, focusing on both scalability and fault tolerance as its design goals. It leverages widely used technologies such as XML and HTTP to present an interface to other components in the SSS environment.

  17. National Highway Planning Network

    Energy Science and Technology Software Center (OSTI)

    1992-02-02

    NHPN, the National Highway Planning Network, is a database of major highways in the continental United States that is used for national-level analyses of highway transportation issues that require use of a network, such as studies of highway performance, network design, social and environmental impacts of transportation, vehicle routing and scheduling, and mapping. The network is based on a set of roadways digitized by the U. S. Geological Survey (USGS) from the 1980 National Atlasmore » and has been enhanced with additional roads, attribute detail, and topological error corrections to produce a true analytic network. All data have been derived from or checked against information obtained from state and Federal governmental agencies. Two files comprise this network: one describing links and the other nodes. This release, NHPN1.0, contains 44,960 links and 28,512 nodes representing approximately 380,000 miles of roadway.« less

  18. Effect of surface attractive strength on structural transitions of a confined HP lattice protein

    SciTech Connect (OSTI)

    Pattanasiri, Busara; Li, Ying Wai; Wuest, Thomas; Landau, David P

    2015-01-01

    We investigate the influence of surface attractive strength on structural transitions of a hydrophobic-polar (HP) lattice protein confined in a slit formed by two parallel, attractive walls. We apply Wang-Landau sampling together with efficient Monte Carlo updates to estimate the density of states of the system. The conformational transitions, namely, the debridging process and hydrophobic core formation, can be identified by analyzing the specific heat together with several structural observables, such as the numbers of surface contacts, the number of hydrophobic pairs, and radii of gyration in different directions. As temperature decreases, we find that the occurrence of the debridging process is conditional depending on the surface attractive strength. This, in turn, affects the nature of the hydrophobic core formation that takes place at a lower temperature. We illustrate these observations with the aid of a HP protein chain with 48 monomers.

  19. Parameters affecting the resilience of scale-free networks to random failures.

    SciTech Connect (OSTI)

    Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran; Saia, Jared

    2005-09-01

    It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.

  20. DOEIEV.0005/35 ANL-OHS/HP-83403 FORMERLY UTILIZED MEDIAEC SITES

    Office of Legacy Management (LM)

    p, .' jl&Lj p ' -7 c. .3- 4; .z 1. . . ' 1 DOEIEV.0005/35 ANL-OHS/HP-83403 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF CHEMICALS GROUP, OLIN CORPORATION (Formerly Blockson Chemical Company) JOLIET, ILLINOIS March 27,November 28, 1978 OCCUPATIONAL HEALTH AND SAFETY DIVISION Health Physics Section ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Operated by THE UNIVERSITY OF CHICAGO for the U. S. DEPARTMENT OF ENERGY under Contract W-31-10%Eng-38 ..__^ --

  1. I stlbjcot; REQUEST H(P1 SPEWAL~GQPA - BIPUCHED WVg.

    Office of Legacy Management (LM)

    JI& 1, 1952 ..: .i I stlbjcot; REQUEST H(P1 SPEWAL~GQPA - BIPUCHED WVg. In-TIlg~FCRU (H' (9) &liRADIATED 'F SLUGS i _ BvergiKortsbotiUbeuadetouo@otatbera~h~kati tbeearliestposalb~dato 60 tbattba.P235ccmberpturnd/ PFW:bjr Distribution: 1.. " ,- 7 !. i Q-s. 1-3 - .4dd.ressw : .I - J. If. kmen, G.E. L .5 - kil &Files/ :

  2. Locating hardware faults in a data communications network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

    2010-01-12

    Hardware faults location in a data communications network of a parallel computer. Such a parallel computer includes a plurality of compute nodes and a data communications network that couples the compute nodes for data communications and organizes the compute node as a tree. Locating hardware faults includes identifying a next compute node as a parent node and a root of a parent test tree, identifying for each child compute node of the parent node a child test tree having the child compute node as root, running a same test suite on the parent test tree and each child test tree, and identifying the parent compute node as having a defective link connected from the parent compute node to a child compute node if the test suite fails on the parent test tree and succeeds on all the child test trees.

  3. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, D.B.

    1994-07-19

    A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination. 9 figs.

  4. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, Dario B.

    1994-01-01

    A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination.

  5. Microstructural characterization of dissimilar welds between alloy 800 and HP heat-resistant steel

    SciTech Connect (OSTI)

    Dehmolaei, R.; Shamanian, M. Kermanpur, A.

    2008-10-15

    In this study, dissimilar welds between HP heat-resistant steel and Incoloy 800 were made with four different filler materials including: 309 stainless steel and nickel-based Inconel 82, 182 and 617. The microstructure of the base metals, weld metals and their interfaces were characterized by utilizing optical and scanning electron microscopy. Grain boundaries migration in the weld metals was studied. It was found that the migration of grain boundaries in the Inconel 82 weld metal was very extensive. Precipitates of TiC and M{sub 23}C{sub 6} (M = Cr and Mo) in the Inconel 617 weld metal are identified. The necessary conditions for the formation of cracks close to the fusion line of the 309-HP joints are described. Furthermore unmixed zone near the fusion line between HP steel base metal and Inconel 82 weld metal is discussed. An epitaxial growth is characterized at the fusion line of the 309-Alloy 800 and Inconel 617-Alloy 800 joints.

  6. Wang-Landau sampling of the interplay between surface adsorption and folding of HP lattice proteins

    SciTech Connect (OSTI)

    Li, Ying Wai [ORNL] [ORNL; Wuest, Thomas [Swiss Federal Research Institute, Switzerland] [Swiss Federal Research Institute, Switzerland; Landau, David P [University of Georgia, Athens, GA] [University of Georgia, Athens, GA

    2014-01-01

    Generic features associated with the adsorption of proteins on solid surfaces are reviewed within the framework of the hydrophobic-polar (HP) lattice protein model. The thermodynamic behavior and structural properties of various HP protein sequences interacting with attractive surfaces have been studied using extensive Wang-Landau sampling with different types of surfaces, each of which attracts either: all monomers, only hydrophobic (H) monomers, or only polar (P) monomers, respectively. Consequently, different types of folding behavior occur for varied surface strengths. Analysis of the combined patterns of various structural observables, e.g., the derivatives of the numbers of interaction contacts, together with the specific heat, leads to the identification of fundamental categories of folding and transition hierarchies. We also inferred a connection between the transition categories and the relative surface strengths, i.e., the ratios of the surface attractive strengths to the intra-chain attraction among H monomers. We thus believe that the folding hierarchies and identification scheme are generic for different HP sequences interacting with attractive surfaces, regardless of the chain length, sequence, or surface attraction.

  7. Parallel processing data network of master and slave transputers controlled by a serial control network

    DOE Patents [OSTI]

    Crosetto, Dario B.

    1996-01-01

    The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor (100) to a plurality of slave processors (200) to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor's status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer (104), a digital signal processor (114), a parallel transfer controller (106), and two three-port memory devices. A communication switch (108) within each node (100) connects it to a fast parallel hardware channel (70) through which all high density data arrives or leaves the node.

  8. Parallel processing data network of master and slave transputers controlled by a serial control network

    DOE Patents [OSTI]

    Crosetto, D.B.

    1996-12-31

    The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor to a plurality of slave processors to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor`s status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer, a digital signal processor, a parallel transfer controller, and two three-port memory devices. A communication switch within each node connects it to a fast parallel hardware channel through which all high density data arrives or leaves the node. 6 figs.

  9. Zone routing in a torus network

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

    A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

  10. Signaling completion of a message transfer from an origin compute node to a target compute node

    DOE Patents [OSTI]

    Blocksome, Michael A.; Parker, Jeffrey J.

    2011-05-24

    Signaling completion of a message transfer from an origin node to a target node includes: sending, by an origin DMA engine, an RTS message, the RTS message specifying an application message for transfer to the target node from the origin node; receiving, by the origin DMA engine, a remote get message containing a data descriptor for the message and a completion notification descriptor, the completion notification descriptor specifying a local direct put transfer operation for transferring data locally on the origin node; inserting, by the origin DMA engine in an injection FIFO buffer, the data descriptor followed by the completion notification descriptor; transferring, by the origin DMA engine to the target node, the message in dependence upon the data descriptor; and notifying, by the origin DMA engine, the application that transfer of the message is complete in dependence upon the completion notification descriptor.

  11. Signaling completion of a message transfer from an origin compute node to a target compute node

    DOE Patents [OSTI]

    Blocksome, Michael A.

    2011-02-15

    Signaling completion of a message transfer from an origin node to a target node includes: sending, by an origin DMA engine, an RTS message, the RTS message specifying an application message for transfer to the target node from the origin node; receiving, by the origin DMA engine, a remote get message containing a data descriptor for the message and a completion notification descriptor, the completion notification descriptor specifying a local memory FIFO data transfer operation for transferring data locally on the origin node; inserting, by the origin DMA engine in an injection FIFO buffer, the data descriptor followed by the completion notification descriptor; transferring, by the origin DMA engine to the target node, the message in dependence upon the data descriptor; and notifying, by the origin DMA engine, the application that transfer of the message is complete in dependence upon the completion notification descriptor.

  12. LC Recommendations for Data Transfer Nodes (Technical Report...

    Office of Scientific and Technical Information (OSTI)

    Technical Report: LC Recommendations for Data Transfer Nodes Citation Details In-Document Search Title: LC Recommendations for Data Transfer Nodes Abstract not provided. Authors: ...

  13. FLOP Counts for "Small" Single-Node Miniapplication Tests

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    FLOP Counts for "Small" Single-Node Miniapplication Tests FLOP Counts for "Small" Single-Node Miniapplication Tests These data, obtained using the NERSC Hopper system, are provided...

  14. LC Recommendations for Data Transfer Nodes (Technical Report...

    Office of Scientific and Technical Information (OSTI)

    Technical Report: LC Recommendations for Data Transfer Nodes Citation Details In-Document Search Title: LC Recommendations for Data Transfer Nodes You are accessing a document ...

  15. Dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job

    DOE Patents [OSTI]

    Budnik, Thomas A.; Knudson, Brant L.; Megerian, Mark G.; Miller, Samuel J.; Stockdell, William M.

    2012-03-20

    Methods, systems, and products for dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job that include: identifying that a job failed to execute on the block of compute nodes because connectivity failed between a compute node assigned as at least one of the connected nodes for the block of compute nodes and its supporting I/O node; and re-launching the job, including selecting an alternative connected node that is actively coupled for data communications with an active I/O node; and assigning the alternative connected node as the connected node for the block of compute nodes running the re-launched job.

  16. Line-plane broadcasting in a data communications network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Berg, Jeremy E.; Blocksome, Michael A.; Smith, Brian E.

    2010-06-08

    Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

  17. Line-plane broadcasting in a data communications network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Berg, Jeremy E.; Blocksome, Michael A.; Smith, Brian E.

    2010-11-23

    Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

  18. DOEIEV-0005/37 ANL=OHS/HP-83406 FORMERLY UTILIZED MEDIAEC SITES

    Office of Legacy Management (LM)

    //, .<.' I ' 1 TL\ t+, -- DOEIEV-0005/37 ANL=OHS/HP-83406 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE FORMER WATERTOWN ARSENAL PROPERTY SITE 34 AND SITE 41 WATERTOWN, MASSACHUSETTS o\o\-0 G /Q e-+ a+ -? q+ mii ' ( . % QL G+ OCCUPATIONAL HEALTH AND SAFETY INViSiON Health Physics Section ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Operated by THE UNIVERSITY O F CHICAGO for the U. S. DEPARTMENT O F ENERGY under Contract W=314 09.Eng-38 Argonne National

  19. Class network routing

    DOE Patents [OSTI]

    Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    2009-09-08

    Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

  20. Clock Agreement Among Parallel Supercomputer Nodes

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Jones, Terry R.; Koenig, Gregory A.

    2014-04-30

    This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

  1. Clock Agreement Among Parallel Supercomputer Nodes

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Jones, Terry R.; Koenig, Gregory A.

    This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

  2. Visual Matrix Clustering of Social Networks

    SciTech Connect (OSTI)

    Wong, Pak C.; Mackey, Patrick S.; Foote, Harlan P.; May, Richard A.

    2013-07-01

    The prevailing choices to graphically represent a social network in todays literature are a node-link graph layout and an adjacency matrix. Both visualization techniques have unique strengths and weaknesses when applied to different domain applications. In this article, we focus our discussion on adjacency matrix and how to turn the matrix-based visualization technique from merely showing pairwise associations among network actors (or graph nodes) to depicting clusters of a social network. We also use node-link layouts to supplement the discussion.

  3. Identifying failure in a tree network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Pinnow, Kurt W.; Wallenfelt, Brian P.

    2010-08-24

    Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

  4. Advanced mobile networking, sensing, and controls.

    SciTech Connect (OSTI)

    Feddema, John Todd; Kilman, Dominique Marie; Byrne, Raymond Harry; Young, Joseph G.; Lewis, Christopher L.; Van Leeuwen, Brian P.; Robinett, Rush D. III; Harrington, John J.

    2005-03-01

    This report describes an integrated approach for designing communication, sensing, and control systems for mobile distributed systems. Graph theoretic methods are used to analyze the input/output reachability and structural controllability and observability of a decentralized system. Embedded in each network node, this analysis will automatically reconfigure an ad hoc communication network for the sensing and control task at hand. The graph analysis can also be used to create the optimal communication flow control based upon the spatial distribution of the network nodes. Edge coloring algorithms tell us that the minimum number of time slots in a planar network is equal to either the maximum number of adjacent nodes (or degree) of the undirected graph plus some small number. Therefore, the more spread out that the nodes are, the fewer number of time slots are needed for communication, and the smaller the latency between nodes. In a coupled system, this results in a more responsive sensor network and control system. Network protocols are developed to propagate this information, and distributed algorithms are developed to automatically adjust the number of time slots available for communication. These protocols and algorithms must be extremely efficient and only updated as network nodes move. In addition, queuing theory is used to analyze the delay characteristics of Carrier Sense Multiple Access (CSMA) networks. This report documents the analysis, simulation, and implementation of these algorithms performed under this Laboratory Directed Research and Development (LDRD) effort.

  5. Performing a scatterv operation on a hierarchical tree network optimized for collective operations

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

    2013-10-22

    Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scatterv module installed on the node, the portion of the data for the node; determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.

  6. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model

    SciTech Connect (OSTI)

    Agarwala, R. [National Institutes of Health, Bethesda, MD (United States); Batzoglou, S. [MIT Lab. for Computer Science, Cambridge, MA (United States); Dancik, V. [Univ. of Southern California, Los Angeles, CA (United States)] [and others

    1997-12-01

    A long standing problem in molecular biology is to determine the three-dimensional structure of a protein, given its amino acid sequence. A variety of simplifying models have been proposed abstracting only the {open_quotes}essential physical properties{close_quotes} of real proteins. In these models, the three dimensional space is often represented by a lattice. Residues which are adjacent in the primary sequence (i.e. covalently linked) must be placed at adjacent points in the lattice. A conformation of a protein is simply a self-avoiding walk along the lattice. The protein folding problem STRING-FOLD is that of finding a conformation of the protein sequence on the lattice such that the overall energy is minimized, for some reasonable definition of energy. This formulation leaves open the choices of a lattice and an energy function. Once these choices are made, one may then address the algorithmic complexity of optimizing the energy function for the lattice. For a variety of such simple models, this minimization problem is in fact NP-hard. In this paper, we consider the Hydrophobic-Polar (HP) Model introduced by Dill. The HP model abstracts the problem by grouping the 20 amino acids into two classes: hydrophobic (or non-polar) residues and hydrophilic (or polar) residues. For concreteness, we will take our input to be a string from (H,P){sup +}, where P represents polar residues, and H represents hydrophobic residues. Dill et.al. survey the literature analyzing this model. 8 refs., 2 figs., 1 tab.

  7. Downhole drilling network using burst modulation techniques

    DOE Patents [OSTI]

    Hall; David R. , Fox; Joe

    2007-04-03

    A downhole drilling system is disclosed in one aspect of the present invention as including a drill string and a transmission line integrated into the drill string. Multiple network nodes are installed at selected intervals along the drill string and are adapted to communicate with one another through the transmission line. In order to efficiently allocate the available bandwidth, the network nodes are configured to use any of numerous burst modulation techniques to transmit data.

  8. Scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the nodes during execution

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

    2012-10-16

    Methods, apparatus, and products are disclosed for scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the plurality of compute nodes during execution that include: identifying one or more applications for execution on the plurality of compute nodes; creating a plurality of physically discontiguous node partitions in dependence upon temperature characteristics for the compute nodes and a physical topology for the compute nodes, each discontiguous node partition specifying a collection of physically adjacent compute nodes; and assigning, for each application, that application to one or more of the discontiguous node partitions for execution on the compute nodes specified by the assigned discontiguous node partitions.

  9. Flexible network wireless transceiver and flexible network telemetry transceiver

    DOE Patents [OSTI]

    Brown, Kenneth D.

    2008-08-05

    A transceiver for facilitating two-way wireless communication between a baseband application and other nodes in a wireless network, wherein the transceiver provides baseband communication networking and necessary configuration and control functions along with transmitter, receiver, and antenna functions to enable the wireless communication. More specifically, the transceiver provides a long-range wireless duplex communication node or channel between the baseband application, which is associated with a mobile or fixed space, air, water, or ground vehicle or other platform, and other nodes in the wireless network or grid. The transceiver broadly comprises a communication processor; a flexible telemetry transceiver including a receiver and a transmitter; a power conversion and regulation mechanism; a diplexer; and a phased array antenna system, wherein these various components and certain subcomponents thereof may be separately enclosed and distributable relative to the other components and subcomponents.

  10. System and method for time synchronization in a wireless network

    DOE Patents [OSTI]

    Gonia, Patrick S.; Kolavennu, Soumitri N.; Mahasenan, Arun V.; Budampati, Ramakrishna S.

    2010-03-30

    A system includes multiple wireless nodes forming a cluster in a wireless network, where each wireless node is configured to communicate and exchange data wirelessly based on a clock. One of the wireless nodes is configured to operate as a cluster master. Each of the other wireless nodes is configured to (i) receive time synchronization information from a parent node, (ii) adjust its clock based on the received time synchronization information, and (iii) broadcast time synchronization information based on the time synchronization information received by that wireless node. The time synchronization information received by each of the other wireless nodes is based on time synchronization information provided by the cluster master so that the other wireless nodes substantially synchronize their clocks with the clock of the cluster master.

  11. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-01-01

    A method is presented for reducing the number of elements required in a thermal network representation of a building. The method is based on matching the actual building response at two frequencies, the diurnal response and 3-day response. The procedure provides a straightforward methodology for combining all the various materials inside a discrete building zone into a few nodes while retaining a high degree of accuracy in the dynamic response. An example is given showing a comparison between a large network and the reduced network.

  12. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-06-01

    A method is presented for reducing the number of elements required in a thermal network representation of a building. The method is based on matching the actual building response at two frequencies, the diurnal response and 3-day response. The procedure provides a straightforward methodology for combining all the various materials inside a discrete building zone into a few nodes while retaining a high degree of accuracy in the dynamic response. An example is given showing a comparison between a large network and the reduced network.

  13. Network Upgrade for the SLC: PEP II Network

    SciTech Connect (OSTI)

    Crane, M.; Call, M.; Clark, S.; Coffman, F.; Himel, T.; Lahey, T.; Miller, E.; Sass, R.; /SLAC

    2011-09-09

    The PEP-II control system required a new network to support the system functions. This network, called CTLnet, is an FDDI/Ethernet based network using only TCP/IP protocols. An upgrade of the SLC Control System micro communications to use TCP/IP and SLCNET would allow all PEP-II control system nodes to use TCP/IP. CTLnet is private and separate from the SLAC public network. Access to nodes and control system functions is provided by multi-homed application servers with connections to both the private CTLnet and the SLAC public network. Monitoring and diagnostics are provided using a dedicated system. Future plans and current status information is included.

  14. Continuum Modeling and Control of Large Nonuniform Wireless Networks via Nonlinear Partial Differential Equations

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Zhang, Yang; Chong, Edwin K. P.; Hannig, Jan; Estep, Donald

    2013-01-01

    We inmore » troduce a continuum modeling method to approximate a class of large wireless networks by nonlinear partial differential equations (PDEs). This method is based on the convergence of a sequence of underlying Markov chains of the network indexed by N , the number of nodes in the network. As N goes to infinity, the sequence converges to a continuum limit, which is the solution of a certain nonlinear PDE. We first describe PDE models for networks with uniformly located nodes and then generalize to networks with nonuniformly located, and possibly mobile, nodes. Based on the PDE models, we develop a method to control the transmissions in nonuniform networks so that the continuum limit is invariant under perturbations in node locations. This enables the networks to maintain stable global characteristics in the presence of varying node locations.« less

  15. Dispatching packets on a global combining network of a parallel computer

    DOE Patents [OSTI]

    Almasi, Gheorghe; Archer, Charles J.

    2011-07-19

    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.

  16. Network Maps

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Network Maps Engineering Services The Network Network Maps Network Traffic Volume Historical Network Maps Network Facts & Stats Connected Sites Peering Connections ESnet...

  17. Implementing controlled-unitary operations over the butterfly network

    SciTech Connect (OSTI)

    Soeda, Akihito; Kinjo, Yoshiyuki; Turner, Peter S.; Murao, Mio

    2014-12-04

    We introduce a multiparty quantum computation task over a network in a situation where the capacities of both the quantum and classical communication channels of the network are limited and a bottleneck occurs. Using a resource setting introduced by Hayashi [1], we present an efficient protocol for performing controlled-unitary operations between two input nodes and two output nodes over the butterfly network, one of the most fundamental networks exhibiting the bottleneck problem. This result opens the possibility of developing a theory of quantum network coding for multiparty quantum computation, whereas the conventional network coding only treats multiparty quantum communication.

  18. Method and computer product to increase accuracy of time-based software verification for sensor networks

    DOE Patents [OSTI]

    Foo Kune, Denis; Mahadevan, Karthikeyan

    2011-01-25

    A recursive verification protocol to reduce the time variance due to delays in the network by putting the subject node at most one hop from the verifier node provides for an efficient manner to test wireless sensor nodes. Since the software signatures are time based, recursive testing will give a much cleaner signal for positive verification of the software running on any one node in the sensor network. In this protocol, the main verifier checks its neighbor, who in turn checks its neighbor, and continuing this process until all nodes have been verified. This ensures minimum time delays for the software verification. Should a node fail the test, the software verification downstream is halted until an alternative path (one not including the failed node) is found. Utilizing techniques well known in the art, having a node tested twice, or not at all, can be avoided.

  19. Energy efficient sensor network implementations

    SciTech Connect (OSTI)

    Frigo, Janette R; Raby, Eric Y; Brennan, Sean M; Kulathumani, Vinod; Rosten, Ed; Wolinski, Christophe; Wagner, Charles; Charot, Francois

    2009-01-01

    In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. We analyze the following modes of operation; event detection, sleep(wake-up), data acquisition, data processing modes using low power, high performance embedded technology such as specialized embedded DSP processors and a low power FPGAs at the sensing node. We use compute intensive sensor node applications: an acoustic vehicle classifier (frequency domain analysis) and a video license plate identification application (learning algorithm) as a case study. We report performance and total energy usage for our system implementations and discuss the system architecture design trade offs.

  20. Calculation of Ambient (H*(10)) and Personal (Hp(10)) Dose Equivalent from a 252Cf Neutron Source

    SciTech Connect (OSTI)

    Traub, Richard J.

    2010-03-26

    The purpose of this calculation is to calculate the neutron dose factors for the Sr-Cf-3000 neutron source that is located in the 318 low scatter room (LSR). The dose factors were based on the dose conversion factors published in ICRP-21 Appendix 6, and the Ambient dose equivalent (H*(10)) and Personal dose equivalent (Hp(10)) dose factors published in ICRP Publication 74.

  1. Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network

    SciTech Connect (OSTI)

    Chen, Dong; Eisley, Noel A.; Steinmacher-Burow, Burkhard; Heidelberger, Philip

    2013-01-29

    A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.

  2. Comparison of properties and microstructures of Trefimetaux and Hycon 3HP{trademark} after neutron irradiation

    SciTech Connect (OSTI)

    Edwards, D.J.; Singh, B.N.; Toft, P.; Eldrup, M.

    1998-09-01

    The precipitation strengthened CuNiBe alloys are among three candidate copper alloys being evaluated for application in the first wall, divertor, and limiter components of ITER. Generally, CuNiBe alloys have higher strength but poorer conductivity compared to CuCrZr and CuAl{sub 2}O{sub 3} alloys. Brush-Wellman Inc. has manufactured an improved version of their Hycon CuNiBe alloy that has higher conductivity while maintaining a reasonable level strength. It is of interest, therefore, to investigate the effect of radiation on the physical and mechanical properties of this alloy. In the present work the authors have investigated the physical and mechanical properties of the Hycon 3HP{trademark} alloy both before and after neutron irradiation and have compared its microstructure and properties with the European CuNiBe candidate alloy manufactured by Trefirmetaux. Tensile specimens of both alloys were irradiated in the DR-3 reactor at Risoe to displacement dose levels up to 0.3 dpa at 100, 250 and 350 C. Both alloys were tensile tested in the unirradiated and irradiated conditions at 100, 250 and 350 C. Both pre- and post-irradiation microstructures of the alloys were investigated in detail using transmission electron microscopy. Fracture surfaces were examined under a scanning electron microscope. Electrical resistivity measurements were made on tensile specimens before and after irradiation; all measurements were made at 23 C. At this point it seems unlikely that CuNiBe alloys can be recommended for applications in neutron environments where the irradiation temperature exceeds 200 C. Applications at temperatures below 200 C might be plausible, but only after careful experiments have determined the dose dependence of the mechanical properties and the effect of sudden temperature excursions on the material to establish the limits on the use of the alloy.

  3. ALCF Systems 1: On-Node Goals of This Presentation:

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    And compare with that found in commodity HPC hardware. Highlight aspects of the architecture relevant to code optimization. A BGQ node looks like this: Not this: Data Motion,...

  4. Next Generation Natural Gas Vehicle Program Phase I: Clean Air Partners 0.5 g/hp-h NOx Engine Concept; Final Report

    SciTech Connect (OSTI)

    Wong, H. C.

    2003-07-01

    Subcontractor report details work done by Clean Air Partners to develop 0.5 g/hp-h NOx natural gas engine exhaust gas recirculation (EGR) technology for the Next Generation Natural Gas Vehicle Program.

  5. Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

    SciTech Connect (OSTI)

    Lin, Ying; Wu, Qishi; Zhu, Mengxia; Rao, Nageswara S

    2009-04-01

    Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: (1) interactive applications where a single dataset is sequentially processed along a pipeline; and (2) streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: (1) Minimum Endtoend Delay with No Node Reuse (MEDNNR), (2) Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), (3) Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), (4) Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), (5) Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and (6) Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, 'contiguous node reuse' means that multiple contiguous modules along the pipeline may run on the same node and 'arbitrary node reuse' imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either

  6. Network support for system initiated checkpoints

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip

    2013-01-29

    A system, method and computer program product for supporting system initiated checkpoints in parallel computing systems. The system and method generates selective control signals to perform checkpointing of system related data in presence of messaging activity associated with a user application running at the node. The checkpointing is initiated by the system such that checkpoint data of a plurality of network nodes may be obtained even in the presence of user applications running on highly parallel computers that include ongoing user messaging activity.

  7. Impact of electric vehicles on the IEEE 34 node distribution infrastructure

    SciTech Connect (OSTI)

    Jiang, Zeming; Shalalfel, Laith; Beshir, Mohammed J.

    2014-10-01

    With the growing penetration of the electric vehicles to our daily life owing to their economic and environmental benefits, there will be both opportunities and challenges to the utilities when adopting plug-in electric vehicles (PEV) to the distribution network. In this study, a thorough analysis based on real-world project is conducted to evaluate the impacts of electric vehicles infrastructure on the grid relating to system load flow, load factor, and voltage stability. IEEE 34 node test feeder was selected and tested along with different case scenarios utilizing the electrical distribution design (EDD) software to find out the potential impacts to the grid.

  8. Impact of electric vehicles on the IEEE 34 node distribution infrastructure

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Jiang, Zeming; Shalalfel, Laith; Beshir, Mohammed J.

    2014-10-01

    With the growing penetration of the electric vehicles to our daily life owing to their economic and environmental benefits, there will be both opportunities and challenges to the utilities when adopting plug-in electric vehicles (PEV) to the distribution network. In this study, a thorough analysis based on real-world project is conducted to evaluate the impacts of electric vehicles infrastructure on the grid relating to system load flow, load factor, and voltage stability. IEEE 34 node test feeder was selected and tested along with different case scenarios utilizing the electrical distribution design (EDD) software to find out the potential impacts tomore » the grid.« less

  9. Multiscale wireless sensor node for impedance-based SHM and low-frequency vibration data acquisition

    SciTech Connect (OSTI)

    Taylor, Stuart G; Farinholt, Kevin M; Park, Gyuhae; Farrar, Charles R; Todd, Michael D

    2009-01-01

    This paper presents recent developments in an extremely compact, wireless impedance sensor node (WID3, Wireless Impedance Device) at Los Alamos National Laboratory for use in impedance-based structural health monitoring (SHM), Sensor diagnostics and low-frequency vibrational data acquisition. The current generation WID3 is equipped with an Analog Devices AD5933 impedance chip that can resolve measurements up to 100 kHz, a frequency range ideal for many SHM applications. An integrated set of multiplexers allows the end user to monitor seven piezoelectric sensors from a single sensor node. The WID3 combines on-board processing using an Atmega1281 microcontroller, data storage using flash memory, wireless communications capabilities, and a series of internal and external triggering options into a single package to realize a truly comprehensive, self-contained wireless active-sensor node for SHM applications. Furthermore, we recently extended the capability of this device by implementing low-frequency analog to digital and digital and analog converters so that the same device can measure structural vibration data. The WID3 requires less than 70 mW of power to operate, and it can operate in various wireless network paradigms. The performance of this miniaturized and portable device is compared to our previous results and its broader capabilities are demonstrated.

  10. Aggregating job exit statuses of a plurality of compute nodes executing a parallel application

    DOE Patents [OSTI]

    Aho, Michael E.; Attinella, John E.; Gooding, Thomas M.; Mundy, Michael B.

    2015-07-21

    Aggregating job exit statuses of a plurality of compute nodes executing a parallel application, including: identifying a subset of compute nodes in the parallel computer to execute the parallel application; selecting one compute node in the subset of compute nodes in the parallel computer as a job leader compute node; initiating execution of the parallel application on the subset of compute nodes; receiving an exit status from each compute node in the subset of compute nodes, where the exit status for each compute node includes information describing execution of some portion of the parallel application by the compute node; aggregating each exit status from each compute node in the subset of compute nodes; and sending an aggregated exit status for the subset of compute nodes in the parallel computer.

  11. Theory of generalized branch and combine clock networks

    SciTech Connect (OSTI)

    El-Amawy, A.; Kulasinghe, P.

    1994-12-31

    In a recent development a new clock distribution scheme, called Branch-and-Combine or BaC, has been introduced. The scheme is the first to guarantee constant skew bound regardless of network size. In this paper we generalize and extend the work on BaC networks. We established some interesting results on clocking paths, node input sequences, node inputs` relative timing, network stability, and skew bound. Furthermore, this study establishes an upper bound on maximum clocking rates for BaC networks which is about double that predicted by earlier studies.

  12. Multi-Node Thermal System Model for Lithium-Ion Battery Packs: Preprint

    SciTech Connect (OSTI)

    Shi, Ying; Smith, Kandler; Wood, Eric; Pesaran, Ahmad

    2015-09-14

    Temperature is one of the main factors that controls the degradation in lithium ion batteries. Accurate knowledge and control of cell temperatures in a pack helps the battery management system (BMS) to maximize cell utilization and ensure pack safety and service life. In a pack with arrays of cells, a cells temperature is not only affected by its own thermal characteristics but also by its neighbors, the cooling system and pack configuration, which increase the noise level and the complexity of cell temperatures prediction. This work proposes to model lithium ion packs thermal behavior using a multi-node thermal network model, which predicts the cell temperatures by zones. The model was parametrized and validated using commercial lithium-ion battery packs. neighbors, the cooling system and pack configuration, which increase the noise level and the complexity of cell temperatures prediction. This work proposes to model lithium ion packs thermal behavior using a multi-node thermal network model, which predicts the cell temperatures by zones. The model was parametrized and validated using commercial lithium-ion battery packs.

  13. Regional Seismic Travel Time Node Get and Set

    Energy Science and Technology Software Center (OSTI)

    2012-10-24

    RSTT_NOGS allows users to easily get and set seismic velocity vs. depth profiles at specified model tessellation nodes. RSTT_NOGS uses the Sandia Seismic Location Baseline Model code that was released under BSD license in 2009.

  14. Measuring the Monitoring User Interactive Experiences on Franklin Interactive Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Interactive Node Responsiveness Richard Gerber User Services Group National Energy Research Scientific Computing Center Lawrence Berkeley National Laboratory Berkeley, CA June 9, 2008 Introduction Anecdotal reports of slow interactive response on Franklin's login nodes have been documented via comments on the 2007 NERSC User Survey. Users report that sluggish command-line response at times makes it difficult to work. The cause, or causes, of the poor response time is unknown. In an attempt to

  15. Microfluidic ultrasonic particle separators with engineered node locations

    Office of Scientific and Technical Information (OSTI)

    and geometries (Patent) | SciTech Connect ultrasonic particle separators with engineered node locations and geometries Citation Details In-Document Search Title: Microfluidic ultrasonic particle separators with engineered node locations and geometries An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic

  16. Dirac node arcs in PtSn4

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Wu, Yun; Wang, Lin -Lin; Mun, Eundeok; Johnson, D. D.; Mou, Daixiang; Huang, Lunan; Lee, Yongbin; Bud’ko, S. L.; Canfield, P. C.; Kaminski, Adam

    2016-04-04

    In topological quantum materials1,2,3 the conduction and valence bands are connected at points or along lines in the momentum space. A number of studies have demonstrated that several materials are indeed Dirac/Weyl semimetals4,5,6,7,8. However, there is still no experimental confirmation of materials with line nodes, in which the Dirac nodes form closed loops in the momentum space2,3. Here we report the discovery of a novel topological structure—Dirac node arcs—in the ultrahigh magnetoresistive material PtSn4 using laser-based angle-resolved photoemission spectroscopy data and density functional theory calculations. Unlike the closed loops of line nodes, the Dirac node arc structure arises owing tomore » the surface states and resembles the Dirac dispersion in graphene that is extended along a short line in the momentum space. Here, we propose that this reported Dirac node arc structure is a novel topological state that provides an exciting platform for studying the exotic properties of Dirac fermions.« less

  17. Complex network synchronization of chaotic systems with delay coupling

    SciTech Connect (OSTI)

    Theesar, S. Jeeva Sathya Ratnavelu, K.

    2014-03-05

    The study of complex networks enables us to understand the collective behavior of the interconnected elements and provides vast real time applications from biology to laser dynamics. In this paper, synchronization of complex network of chaotic systems has been studied. Every identical node in the complex network is assumed to be in Lur’e system form. In particular, delayed coupling has been assumed along with identical sector bounded nonlinear systems which are interconnected over network topology.

  18. Synchronization in networks of spatially extended systems

    SciTech Connect (OSTI)

    Filatova, Anastasiya E.; Hramov, Alexander E.; Koronovskii, Alexey A.; Boccaletti, Stefano

    2008-06-15

    Synchronization processes in networks of spatially extended dynamical systems are analytically and numerically studied. We focus on the relevant case of networks whose elements (or nodes) are spatially extended dynamical systems, with the nodes being connected with each other by scalar signals. The stability of the synchronous spatio-temporal state for a generic network is analytically assessed by means of an extension of the master stability function approach. We find an excellent agreement between the theoretical predictions and the data obtained by means of numerical calculations. The efficiency and reliability of this method is illustrated numerically with networks of beam-plasma chaotic systems (Pierce diodes). We discuss also how the revealed regularities are expected to take place in other relevant physical and biological circumstances.

  19. Network Activity

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Statistics Network Activity Network Activity PDSF Network Uplinks to NERSC (dual 10 Gbps) NERSC Uplink to ESnet Last edited: 2011-03-31 22:20:59...

  20. Earth System Grid (ESG) Data Node Software Stack

    Energy Science and Technology Software Center (OSTI)

    2009-12-01

    The ESG-CET system consist of two major components: 1) Gateways that support portal services, which serve as interfaces to end-users who can search, discover, and request data and data products, and 2) Data Nodes where the data actually resides. The Data is "published" to the Data Node, which makes the data visible to a Gateway and enables its delivery to end-users. It is expected that Gateways will only be installed by a small number ofmore » centers devoted to serving data (e.g., LLNL/PCMDI, NCAR, GFDL, DADC, DKRZ, ANU, JAMSTEC), whereas it is hoped that most climate modeling centers will install the Data Node software through which they can serve their model output.« less

  1. Axillary lymph node dose with tangential breast irradiation

    SciTech Connect (OSTI)

    Reed, Daniel R. . E-mail: drreed@u.washington.edu; Lindsley, Skyler Karen; Mann, Gary N.; Austin-Seymour, Mary; Korssjoen, Tammy; Anderson, Benjamin O.; Moe, Roger

    2005-02-01

    Purpose: The advent of sentinel lymph node mapping and biopsy in the staging of breast cancer has resulted in a significant decrease in the extent of axillary nodal surgery. As the extent of axillary surgery decreases, the radiation dose and distribution within the axilla becomes increasingly important for current therapy planning and future analysis of results. This analysis examined the radiation dose distribution delivered to the anatomically defined axillary level I and II lymph node volume and surgically placed axillary clips with conventional tangential breast fields and CT-based three-dimensional (3D) planning. Methods and materials: Fifty consecutive patients with early-stage breast cancer undergoing breast conservation therapy were evaluated. All patients underwent 3D CT-based planning with conventional breast tangential fields designed to encompass the entire breast parenchyma. Using CT-based 3D planning, the dose distribution of the standard tangential breast irradiation fields was examined in relationship to the axillary level I and II lymph node volumes. Axillary level I and II lymph node anatomic volumes were defined by CT and surgical clips placed during complete level I-II lymph node dissection. Axillary level I-II lymph node volume doses were examined on the basis of the prescribed breast radiation dose and 3D dose distribution. Results: All defined breast volumes received {>=}95% of the prescribed dose. By contrast, the 95% isodose line encompassed only an average of 55% (range, 23-87%) of the axillary level I-II lymph node anatomic volume. No patient had complete coverage of the axillary level I-II lymph node region by the 95% isodose line. The mean anatomic axillary level I-II volume was 146.3 cm{sup 3} (range, 83.1-313.0 cm{sup 3}). The mean anatomic axillary level I-II volume encompassed by the 95% isodose line was 84.9 cm{sup 3} (range, 25.1-219.0 cm{sup 3}). The mean 95% isodose coverage of the surgical clip volume was 80%, and the median

  2. Microfluidic ultrasonic particle separators with engineered node locations and geometries

    SciTech Connect (OSTI)

    Rose, Klint A; Fisher, Karl A; Wajda, Douglas A; Mariella, Jr., Raymond P; Bailey, Christopher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D

    2015-03-31

    An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum, pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

  3. Microfluidic ultrasonic particle separators with engineered node locations and geometries

    DOE Patents [OSTI]

    Rose, Klint A.; Fisher, Karl A.; Wajda, Douglas A.; Mariella, Jr., Raymond P.; Bailey, Christopher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D.

    2016-04-26

    An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

  4. Microfluidic ultrasonic particle separators with engineered node locations and geometries

    DOE Patents [OSTI]

    Rose, Klint A; Fisher, Karl A; Wajda, Douglas A; Mariella, Jr., Raymond P; Bailey, Christoppher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D

    2014-05-20

    An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

  5. Performing an allreduce operation on a plurality of compute nodes of a parallel computer

    DOE Patents [OSTI]

    Faraj, Ahmad

    2013-02-12

    Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: performing, for each node, a local reduction operation using allreduce contribution data for the cores of that node, yielding, for each node, a local reduction result for one or more representative cores for that node; establishing one or more logical rings among the nodes, each logical ring including only one of the representative cores from each node; performing, for each logical ring, a global allreduce operation using the local reduction result for the representative cores included in that logical ring, yielding a global allreduce result for each representative core included in that logical ring; and performing, for each node, a local broadcast operation using the global allreduce results for each representative core on that node.

  6. Performing an allreduce operation on a plurality of compute nodes of a parallel computer

    DOE Patents [OSTI]

    Faraj, Ahmad

    2013-07-09

    Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: establishing, for each node, a plurality of logical rings, each ring including a different set of at least one core on that node, each ring including the cores on at least two of the nodes; iteratively for each node: assigning each core of that node to one of the rings established for that node to which the core has not previously been assigned, and performing, for each ring for that node, a global allreduce operation using contribution data for the cores assigned to that ring or any global allreduce results from previous global allreduce operations, yielding current global allreduce results for each core; and performing, for each node, a local allreduce operation using the global allreduce results.

  7. Towards A Network-of-Networks Framework for Cyber Security

    SciTech Connect (OSTI)

    Halappanavar, Mahantesh; Choudhury, Sutanay; Hogan, Emilie A.; Hui, Peter SY; Johnson, John R.; Ray, Indrajit; Holder, Lawrence B.

    2013-06-07

    Networks-of-networks (NoN) is a graph-theoretic model of interdependent networks that have distinct dynamics at each network (layer). By adding special edges to represent relationships between nodes in different layers, NoN provides a unified mechanism to study interdependent systems intertwined in a complex relationship. While NoN based models have been proposed for cyber-physical systems, in this paper we build towards a three-layer NoN model for an enterprise cyber system. Each layer captures a different facet of a cyber system. We then discuss the potential benefits of graph-theoretic analysis enabled from such a model. Our goal is to provide a novel and powerful tool for modeling and analyzing problems in cyber security.

  8. Soft-core processor study for node-based architectures.

    SciTech Connect (OSTI)

    Van Houten, Jonathan Roger; Jarosz, Jason P.; Welch, Benjamin James; Gallegos, Daniel E.; Learn, Mark Walter

    2008-09-01

    Node-based architecture (NBA) designs for future satellite projects hold the promise of decreasing system development time and costs, size, weight, and power and positioning the laboratory to address other emerging mission opportunities quickly. Reconfigurable Field Programmable Gate Array (FPGA) based modules will comprise the core of several of the NBA nodes. Microprocessing capabilities will be necessary with varying degrees of mission-specific performance requirements on these nodes. To enable the flexibility of these reconfigurable nodes, it is advantageous to incorporate the microprocessor into the FPGA itself, either as a hardcore processor built into the FPGA or as a soft-core processor built out of FPGA elements. This document describes the evaluation of three reconfigurable FPGA based processors for use in future NBA systems--two soft cores (MicroBlaze and non-fault-tolerant LEON) and one hard core (PowerPC 405). Two standard performance benchmark applications were developed for each processor. The first, Dhrystone, is a fixed-point operation metric. The second, Whetstone, is a floating-point operation metric. Several trials were run at varying code locations, loop counts, processor speeds, and cache configurations. FPGA resource utilization was recorded for each configuration. Cache configurations impacted the results greatly; for optimal processor efficiency it is necessary to enable caches on the processors. Processor caches carry a penalty; cache error mitigation is necessary when operating in a radiation environment.

  9. Anomaly Detection in Dynamic Networks

    SciTech Connect (OSTI)

    Turcotte, Melissa

    2014-10-14

    Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the

  10. SRC burn test in 700-hp oil-designed boiler. Volume 1. Integrated report. Final technical report

    SciTech Connect (OSTI)

    Not Available

    1983-09-01

    This burn test program was conducted during the period of August 1982 to February 1983 to demonstrate that Solvent Refined Coal (SRC) products can displace petroleum as a boiler fuel in oil- and gas-designed boilers. The test program was performed at the U.S. Department of Energy's Pittsburgh Energy Technology Center (PETC). Three forms of SRC (pulverized SRC, a solution of SRC dissolved in process-derived distillates, and a slurry of SRC and water) and No. 6 Fuel Oil were evaluated in the 700-hp (30 x 10/sup 6/ Btu/hour) watertube, oil-designed boiler facility at PETC. The test program was managed by the International Coal Refining Company (ICRC) and sponsored by the Department of Energy. Other organizations were involved as necessary to provide the expertise required to execute the test program. This final report represents an integrated overview of the test program conducted at PETC. More detailed information with preliminary data can be obtained from separate reports prepared by PETC, Southern Research Institute, Wheelabrator-Frye, Babcock and Wilcox, and Combustion Engineering. These are presented as Annex Volumes A-F. 25 references, 41 figures, 15 tables.

  11. Implementing asyncronous collective operations in a multi-node processing system

    SciTech Connect (OSTI)

    Chen, Dong; Eisley, Noel A.; Heidelberger, Philip; Kumar, Sameer; Salapura, Valentina; Steinmacher-Burow, Burkhard

    2014-07-08

    A method, system, and computer program product are disclosed for implementing an asynchronous collective operation in a multi-node data processing system. In one embodiment, the method comprises sending data to a plurality of nodes in the data processing system, broadcasting a remote get to the plurality of nodes, and using this remote get to implement asynchronous collective operations on the data by the plurality of nodes. In one embodiment, each of the nodes performs only one task in the asynchronous operations, and each nodes sets up a base address table with an entry for a base address of a memory buffer associated with said each node. In another embodiment, each of the nodes performs a plurality of tasks in said collective operations, and each task of each node sets up a base address table with an entry for a base address of a memory buffer associated with the task.

  12. Self-pacing direct memory access data transfer operations for compute nodes in a parallel computer

    SciTech Connect (OSTI)

    Blocksome, Michael A

    2015-02-17

    Methods, apparatus, and products are disclosed for self-pacing DMA data transfer operations for nodes in a parallel computer that include: transferring, by an origin DMA on an origin node, a RTS message to a target node, the RTS message specifying an message on the origin node for transfer to the target node; receiving, in an origin injection FIFO for the origin DMA from a target DMA on the target node in response to transferring the RTS message, a target RGET descriptor followed by a DMA transfer operation descriptor, the DMA descriptor for transmitting a message portion to the target node, the target RGET descriptor specifying an origin RGET descriptor on the origin node that specifies an additional DMA descriptor for transmitting an additional message portion to the target node; processing, by the origin DMA, the target RGET descriptor; and processing, by the origin DMA, the DMA transfer operation descriptor.

  13. Reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2012-04-17

    Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.

  14. Reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda A.; Ratterman, Joseph D.; Smith, Brian E.

    2012-01-10

    Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.

  15. Network for minimizing current imbalances in a faradaic battery

    DOE Patents [OSTI]

    Wozniak, Walter; Haskins, Harold J.

    1994-01-01

    A circuit for connecting a faradaic battery with circuitry for monitoring the condition of the battery includes a plurality of voltage divider networks providing battery voltage monitoring nodes and includes compensating resistors connected with the networks to maintain uniform discharge currents through the cells of the battery. The circuit also provides a reduced common mode voltage requirement for the monitoring circuitry by referencing the divider networks to one-half the battery voltage.

  16. Microstructure evolution during service exposure of two cast, heat-resisting stainless steels - HP-Nb modified and 20-32Nb

    SciTech Connect (OSTI)

    Shi, S. Lippold, J.C.

    2008-08-15

    The repair weldability of two types of heat-resistant austenitic stainless steel castings, HP-Nb modified alloys and 20-32Nb alloys, has been evaluated after extended service exposure of these materials at temperatures on the order of 815 deg. C (1500 deg. F). The initial part of this investigation has focused on characterization of the microstructure of these alloys after service exposure times of up to 12 years. Microstructure evolution from the as-cast condition to the service-exposed condition is described. In the as-cast condition, both eutectic NbC and Cr-rich M{sub 7}C{sub 3} carbides were observed in the HP-Nb alloys. In contrast, only eutectic NbC carbides were present in the as-cast 20-32Nb alloys due to a significantly higher atomic ratio of Nb/C as compared to the HP-Nb alloys. In the service-exposed condition, an Ni-Nb silicide and Cr-rich M{sub 23}C{sub 6} were identified in both alloys. The HP-Nb alloys exhibited a much higher total volume fraction of microconstituents than the 20-32Nb alloys and the M{sub 23}C{sub 6} phase was more prevalent than Ni-Nb silicide. In contrast, the Ni-Nb silicide was dominant in the service-exposed 20-32Nb alloys. This difference resulted in a significant increase in the repair welding liquation cracking susceptibility of the 20-32Nb service-exposed alloy.

  17. Method and apparatus for obtaining stack traceback data for multiple computing nodes of a massively parallel computer system

    DOE Patents [OSTI]

    Gooding, Thomas Michael; McCarthy, Patrick Joseph

    2010-03-02

    A data collector for a massively parallel computer system obtains call-return stack traceback data for multiple nodes by retrieving partial call-return stack traceback data from each node, grouping the nodes in subsets according to the partial traceback data, and obtaining further call-return stack traceback data from a representative node or nodes of each subset. Preferably, the partial data is a respective instruction address from each node, nodes having identical instruction address being grouped together in the same subset. Preferably, a single node of each subset is chosen and full stack traceback data is retrieved from the call-return stack within the chosen node.

  18. Hybrid function projective synchronization in complex dynamical networks

    SciTech Connect (OSTI)

    Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng [Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024 (China)] [Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024 (China)

    2014-02-15

    This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

  19. GM WW HP

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Killer Micros ii: The sofTware sTriKes BacK Burton Smith Technical Fellow Developer Productivity Luncheon, November 15, 2007 BurTon sMiTh Technical fellow eXTreMe coMPuTinG GrouP...

  20. Identifying logical planes formed of compute nodes of a subcommunicator in a parallel computer

    DOE Patents [OSTI]

    Davis, Kristan D.; Faraj, Daniel A.

    2016-03-01

    In a parallel computer, a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: for each compute node of the subcommunicator and for a number of dimensions beginning with a first dimension: establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, where the second dimension is orthogonal to the first dimension; and establishing, by the plane building node, in a negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension.

  1. The Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Network Engineering Services The Network Network Maps Network Facts & Stats Connected Sites Peering Connections ESnet Site Availabiliy OSCARS Fasterdata IPv6 Network Network Performance Tools The ESnet Engineering Team Contact Us Technical Assistance: 1 800-33-ESnet (Inside US) 1 800-333-7638 (Inside US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: trouble@es.net Provide Web Site Feedback: info@es.net The Network A Nationwide Platform for Science Discovery The

  2. Reducing power consumption while performing collective operations on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2011-10-18

    Methods, apparatus, and products are disclosed for reducing power consumption while performing collective operations on a plurality of compute nodes that include: receiving, by each compute node, instructions to perform a type of collective operation; selecting, by each compute node from a plurality of collective operations for the collective operation type, a particular collective operation in dependence upon power consumption characteristics for each of the plurality of collective operations; and executing, by each compute node, the selected collective operation.

  3. Reducing power consumption during execution of an application on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2012-06-05

    Methods, apparatus, and products are disclosed for reducing power consumption during execution of an application on a plurality of compute nodes that include: executing, by each compute node, an application, the application including power consumption directives corresponding to one or more portions of the application; identifying, by each compute node, the power consumption directives included within the application during execution of the portions of the application corresponding to those identified power consumption directives; and reducing power, by each compute node, to one or more components of that compute node according to the identified power consumption directives during execution of the portions of the application corresponding to those identified power consumption directives.

  4. Profiling an application for power consumption during execution on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2012-08-21

    Methods, apparatus, and products are disclosed for profiling an application for power consumption during execution on a compute node that include: receiving an application for execution on a compute node; identifying a hardware power consumption profile for the compute node, the hardware power consumption profile specifying power consumption for compute node hardware during performance of various processing operations; determining a power consumption profile for the application in dependence upon the application and the hardware power consumption profile for the compute node; and reporting the power consumption profile for the application.

  5. Profiling an application for power consumption during execution on a compute node

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

    2013-09-17

    Methods, apparatus, and products are disclosed for profiling an application for power consumption during execution on a compute node that include: receiving an application for execution on a compute node; identifying a hardware power consumption profile for the compute node, the hardware power consumption profile specifying power consumption for compute node hardware during performance of various processing operations; determining a power consumption profile for the application in dependence upon the application and the hardware power consumption profile for the compute node; and reporting the power consumption profile for the application.

  6. Voltage Control Devices on the IEEE 8500 Node Test Feeder

    SciTech Connect (OSTI)

    Schneider, Kevin P.; Fuller, Jason C.

    2010-01-06

    The IEEE Test Cases provide researchers with distribution system models that can be used to validate new analytic methods. The newest of these models is the 8500-node test feeder which contains multiple devices for voltage control. In addition to a substation regulator there are multiple inline regulators as well as capacitor banks. This paper will discuss the detail in which voltage control devises should be modeled when examining large distribution systems. This discussion will include issues associated with power flow analysis for a single time step as well as for time series analysis.

  7. Pacing a data transfer operation between compute nodes on a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A.

    2011-09-13

    Methods, systems, and products are disclosed for pacing a data transfer between compute nodes on a parallel computer that include: transferring, by an origin compute node, a chunk of an application message to a target compute node; sending, by the origin compute node, a pacing request to a target direct memory access (`DMA`) engine on the target compute node using a remote get DMA operation; determining, by the origin compute node, whether a pacing response to the pacing request has been received from the target DMA engine; and transferring, by the origin compute node, a next chunk of the application message if the pacing response to the pacing request has been received from the target DMA engine.

  8. Performing an allreduce operation on a plurality of compute nodes of a parallel computer

    DOE Patents [OSTI]

    Faraj, Ahmad

    2012-04-17

    Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer. Each compute node includes at least two processing cores. Each processing core has contribution data for the allreduce operation. Performing an allreduce operation on a plurality of compute nodes of a parallel computer includes: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node; performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring; and performing, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node.

  9. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A

    2014-04-01

    Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

  10. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A

    2013-07-02

    Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

  11. Chaining direct memory access data transfer operations for compute nodes in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.

    2010-09-28

    Methods, systems, and products are disclosed for chaining DMA data transfer operations for compute nodes in a parallel computer that include: receiving, by an origin DMA engine on an origin node in an origin injection FIFO buffer for the origin DMA engine, a RGET data descriptor specifying a DMA transfer operation data descriptor on the origin node and a second RGET data descriptor on the origin node, the second RGET data descriptor specifying a target RGET data descriptor on the target node, the target RGET data descriptor specifying an additional DMA transfer operation data descriptor on the origin node; creating, by the origin DMA engine, an RGET packet in dependence upon the RGET data descriptor, the RGET packet containing the DMA transfer operation data descriptor and the second RGET data descriptor; and transferring, by the origin DMA engine to a target DMA engine on the target node, the RGET packet.

  12. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A

    2014-04-22

    Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

  13. Providing Runtime Clock Synchronization With Minimal Node-to-Node Time Deviation on XT4s and XT5s

    SciTech Connect (OSTI)

    Jones, Terry R; Koenig, Gregory A

    2011-01-01

    We present a new high precision clock synchronization algorithm designed for large XT4 and XT5 leadership-class machines. The algorithm, which is designed to support OS noise reduction through co-scheduling, is suitable for usage cases requiring low overhead and minimal time deviation between nodes. Unlike most high-precision algorithms which reach their precision in a post-mortem analysis after the application has completed, the new ORNL developed algorithm rapidly provides precise results during runtime. Previous to our work, the leading high-precision clock synchronization algorithms that made results available during runtime relied on probabilistic schemes that are not guaranteed to result in an answer.

  14. Cross-linked structure of network evolution

    SciTech Connect (OSTI)

    Bassett, Danielle S.; Wymbs, Nicholas F.; Grafton, Scott T.; Porter, Mason A.; Mucha, Peter J.

    2014-03-15

    We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.

  15. Resilience of complex networks to random breakdown

    SciTech Connect (OSTI)

    Paul, Gerald; Sreenivasan, Sameet; Stanley, H. Eugene

    2005-11-01

    Using Monte Carlo simulations we calculate f{sub c}, the fraction of nodes that are randomly removed before global connectivity is lost, for networks with scale-free and bimodal degree distributions. Our results differ from the results predicted by an equation for f{sub c} proposed by Cohen et al. We discuss the reasons for this disagreement and clarify the domain for which the proposed equation is valid.

  16. Position estimation of transceivers in communication networks

    DOE Patents [OSTI]

    Kent, Claudia A.; Dowla, Farid

    2008-06-03

    This invention provides a system and method using wireless communication interfaces coupled with statistical processing of time-of-flight data to locate by position estimation unknown wireless receivers. Such an invention can be applied in sensor network applications, such as environmental monitoring of water in the soil or chemicals in the air where the position of the network nodes is deemed critical. Moreover, the present invention can be arranged to operate in areas where a Global Positioning System (GPS) is not available, such as inside buildings, caves, and tunnels.

  17. Multilevel method for modeling large-scale networks.

    SciTech Connect (OSTI)

    Safro, I. M.

    2012-02-24

    Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from

  18. Method for adding nodes to a quantum key distribution system

    DOE Patents [OSTI]

    Grice, Warren P

    2015-02-24

    An improved quantum key distribution (QKD) system and method are provided. The system and method introduce new clients at intermediate points along a quantum channel, where any two clients can establish a secret key without the need for a secret meeting between the clients. The new clients perform operations on photons as they pass through nodes in the quantum channel, and participate in a non-secret protocol that is amended to include the new clients. The system and method significantly increase the number of clients that can be supported by a conventional QKD system, with only a modest increase in cost. The system and method are compatible with a variety of QKD schemes, including polarization, time-bin, continuous variable and entanglement QKD.

  19. Synthesis, structure refinement at 296 K and physico-chemical characterizations of KMnHP{sub 3}O{sub 10}

    SciTech Connect (OSTI)

    Mechergui, J.; Belam, W.

    2008-12-01

    Potassium manganese(III) monohydrogentriphosphate KMnHP{sub 3}O{sub 10} was synthesized by flux method and characterized by single-crystal X-ray diffraction, crystallizes in the monoclinic system with centric space group C2/c. The parameters of the unit cell are a = 12.104(1), b = 8.287(1). c = 9.150(1) A, {beta} = 110.97(1) deg. and Z = 4. The structure was solved at 296 K using 893 independent reflections and refined until R(F) = 0.022; wR(F{sup 2}) = 0.045. The atomic arrangement of the title compound consists of MnO{sub 6} octahedra linked by hydrogentriphosphate anions to form a three-dimensional framework containing tunnels parallel to the c-axis where the K{sup +} cations are inserted. The structure of KMnHP{sub 3}O{sub 10} contains a single Mn site which is surrounded by typical Jahn-Teller [2 + 2 + 2] distorted octahedron. The title material has been also characterized by different physico-chemical techniques: powder X-ray diffraction, IR, NMR and CI spectroscopies and DTA-TGA-DSC thermal analysis.

  20. Criteria for stochastic pinning control of networks of chaotic maps

    SciTech Connect (OSTI)

    Mwaffo, Violet; Porfiri, Maurizio; DeLellis, Pietro

    2014-03-15

    This paper investigates the controllability of discrete-time networks of coupled chaotic maps through stochastic pinning. In this control scheme, the network dynamics are steered towards a desired trajectory through a feedback control input that is applied stochastically to the network nodes. The network controllability is studied by analyzing the local mean square stability of the error dynamics with respect to the desired trajectory. Through the analysis of the spectral properties of salient matrices, a toolbox of conditions for controllability are obtained, in terms of the dynamics of the individual maps, algebraic properties of the network, and the probability distribution of the pinning control. We demonstrate the use of these conditions in the design of a stochastic pinning control strategy for networks of Chirikov standard maps. To elucidate the applicability of the approach, we consider different network topologies and compare five different stochastic pinning strategies through extensive numerical simulations.

  1. Dynamics on modular networks with heterogeneous correlations

    SciTech Connect (OSTI)

    Melnik, Sergey; Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG; CABDyN Complexity Centre, University of Oxford, Oxford OX1 1HP ; Porter, Mason A.; CABDyN Complexity Centre, University of Oxford, Oxford OX1 1HP ; Mucha, Peter J.; Institute for Advanced Materials, Nanoscience and Technology, University of North Carolina, Chapel Hill, North Carolina 27599-3216 ; Gleeson, James P.

    2014-06-15

    We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module, and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules. We present an analytical approach that allows one to analyze several types of binary dynamics operating on such networks, and we illustrate our approach using bond percolation, site percolation, and the Watts threshold model. The new network ensemble generalizes existing models (e.g., the well-known configuration model and Lancichinetti-Fortunato-Radicchi networks) by allowing a heterogeneous distribution of degree-degree correlations across modules, which is important for the consideration of nonidentical interacting networks.

  2. Budget-based power consumption for application execution on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

    2013-02-05

    Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications.

  3. Budget-based power consumption for application execution on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J; Inglett, Todd A; Ratterman, Joseph D

    2012-10-23

    Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications.

  4. Modeling Temporal Behavior in Large Networks: A Dynamic Mixed-Membership Model

    SciTech Connect (OSTI)

    Rossi, R; Gallagher, B; Neville, J; Henderson, K

    2011-11-11

    Given a large time-evolving network, how can we model and characterize the temporal behaviors of individual nodes (and network states)? How can we model the behavioral transition patterns of nodes? We propose a temporal behavior model that captures the 'roles' of nodes in the graph and how they evolve over time. The proposed dynamic behavioral mixed-membership model (DBMM) is scalable, fully automatic (no user-defined parameters), non-parametric/data-driven (no specific functional form or parameterization), interpretable (identifies explainable patterns), and flexible (applicable to dynamic and streaming networks). Moreover, the interpretable behavioral roles are generalizable, computationally efficient, and natively supports attributes. We applied our model for (a) identifying patterns and trends of nodes and network states based on the temporal behavior, (b) predicting future structural changes, and (c) detecting unusual temporal behavior transitions. We use eight large real-world datasets from different time-evolving settings (dynamic and streaming). In particular, we model the evolving mixed-memberships and the corresponding behavioral transitions of Twitter, Facebook, IP-Traces, Email (University), Internet AS, Enron, Reality, and IMDB. The experiments demonstrate the scalability, flexibility, and effectiveness of our model for identifying interesting patterns, detecting unusual structural transitions, and predicting the future structural changes of the network and individual nodes.

  5. Gas Main Sensor and Communications Network System

    SciTech Connect (OSTI)

    Hagen Schempf

    2006-05-31

    Automatika, Inc. was contracted by the Department of Energy (DOE) and with co-funding from the Northeast Gas Association (NGA), to develop an in-pipe natural gas prototype measurement and wireless communications system for assessing and monitoring distribution networks. This projected was completed in April 2006, and culminated in the installation of more than 2 dozen GasNet nodes in both low- and high-pressure cast-iron and steel mains owned by multiple utilities in the northeastern US. Utilities are currently logging data (off-line) and monitoring data in real time from single and multiple networked sensors over cellular networks and collecting data using wireless bluetooth PDA systems. The system was designed to be modular, using in-pipe sensor-wands capable of measuring, flow, pressure, temperature, water-content and vibration. Internal antennae allowed for the use of the pipe-internals as a waveguide for setting up a sensor network to collect data from multiple nodes simultaneously. Sensor nodes were designed to be installed with low- and no-blow techniques and tools. Using a multi-drop bus technique with a custom protocol, all electronics were designed to be buriable and allow for on-board data-collection (SD-card), wireless relaying and cellular network forwarding. Installation options afforded by the design included direct-burial and external polemounted variants. Power was provided by one or more batteries, direct AC-power (Class I Div.2) and solar-array. The utilities are currently in a data-collection phase and intend to use the collected (and processed) data to make capital improvement decisions, compare it to Stoner model predictions and evaluate the use of such a system for future expansion, technology-improvement and commercialization starting later in 2006.

  6. Massively parallel processor networks with optical express channels

    DOE Patents [OSTI]

    Deri, R.J.; Brooks, E.D. III; Haigh, R.E.; DeGroot, A.J.

    1999-08-24

    An optical method for separating and routing local and express channel data comprises interconnecting the nodes in a network with fiber optic cables. A single fiber optic cable carries both express channel traffic and local channel traffic, e.g., in a massively parallel processor (MPP) network. Express channel traffic is placed on, or filtered from, the fiber optic cable at a light frequency or a color different from that of the local channel traffic. The express channel traffic is thus placed on a light carrier that skips over the local intermediate nodes one-by-one by reflecting off of selective mirrors placed at each local node. The local-channel-traffic light carriers pass through the selective mirrors and are not reflected. A single fiber optic cable can thus be threaded throughout a three-dimensional matrix of nodes with the x,y,z directions of propagation encoded by the color of the respective light carriers for both local and express channel traffic. Thus frequency division multiple access is used to hierarchically separate the local and express channels to eliminate the bucket brigade latencies that would otherwise result if the express traffic had to hop between every local node to reach its ultimate destination. 3 figs.

  7. Massively parallel processor networks with optical express channels

    DOE Patents [OSTI]

    Deri, Robert J.; Brooks, III, Eugene D.; Haigh, Ronald E.; DeGroot, Anthony J.

    1999-01-01

    An optical method for separating and routing local and express channel data comprises interconnecting the nodes in a network with fiber optic cables. A single fiber optic cable carries both express channel traffic and local channel traffic, e.g., in a massively parallel processor (MPP) network. Express channel traffic is placed on, or filtered from, the fiber optic cable at a light frequency or a color different from that of the local channel traffic. The express channel traffic is thus placed on a light carrier that skips over the local intermediate nodes one-by-one by reflecting off of selective mirrors placed at each local node. The local-channel-traffic light carriers pass through the selective mirrors and are not reflected. A single fiber optic cable can thus be threaded throughout a three-dimensional matrix of nodes with the x,y,z directions of propagation encoded by the color of the respective light carriers for both local and express channel traffic. Thus frequency division multiple access is used to hierarchically separate the local and express channels to eliminate the bucket brigade latencies that would otherwise result if the express traffic had to hop between every local node to reach its ultimate destination.

  8. Number and Location of Positive Nodes, Postoperative Radiotherapy, and Survival After Esophagectomy With Three-Field Lymph Node Dissection for Thoracic Esophageal Squamous Cell Carcinoma

    SciTech Connect (OSTI)

    Chen Junqiang; Pan Jianji; Zheng Xiongwei; Zhu Kunshou; Li Jiancheng; Chen Mingqiang; Wang Jiezhong; Liao Zhongxing

    2012-01-01

    Purpose: To analyze influences of the number and location of positive lymph nodes and postoperative radiotherapy on survival for patients with thoracic esophageal squamous cell carcinoma (TE-SCC) treated with radical esophagectomy with three-field lymphadenectomy. Methods and Materials: A total of 945 patients underwent radical esophagectomy plus three-field lymph node dissection for node-positive TE-SCC at Fujian Provincial Tumor Hospital between January 1993 and March 2007. Five hundred ninety patients received surgery only (S group), and 355 patients received surgery, followed 3 to 4 weeks later by postoperative radiotherapy (S+R group) to a median total dose of 50 Gy in 25 fractions. We assessed potential associations among patient-, tumor-, and treatment-related factors and overall survival. Results: Five-year overall survival rates were 32.8% for the entire group, 29.6% for the S group, and 38.0% for the S+R group (p = 0.001 for S vs. S+R). Treatment with postoperative radiotherapy was particularly beneficial for patients with {>=}3 positive nodes and for those with metastasis in the upper (supraclavicular and upper mediastinal) region or both the upper and lower (mediastinal and abdominal) regions (p < 0.05). Postoperative radiotherapy was also associated with lower recurrence rates in the supraclavicular and upper and middle mediastinal regions (p < 0.05). Sex, primary tumor length, number of positive nodes, pathological T category, and postoperative radiotherapy were all independent predictors of survival. Conclusions: Postoperative radiotherapy was associated with better survival for patients with node-positive TE-SCC, particularly those with three or more positive nodes and positive nodes in the supraclavicular and superior mediastinal regions.

  9. Quadratic Fermi node in a 3D strongly correlated semimetal

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Kondo, Takeshi; Nakayama, M.; Chen, R.; Ishikawa, J. J.; Moon, E. -G.; Yamamoto, T.; Ota, Y.; Malaeb, W.; Kanai, H.; Nakashima, Y.; et al

    2015-12-07

    We report that strong spin–orbit coupling fosters exotic electronic states such as topological insulators and superconductors, but the combination of strong spin–orbit and strong electron–electron interactions is just beginning to be understood. Central to this emerging area are the 5d transition metal iridium oxides. Here, in the pyrochlore iridate Pr2Ir2O7, we identify a non-trivial state with a single-point Fermi node protected by cubic and time-reversal symmetries, using a combination of angle-resolved photoemission spectroscopy and first-principles calculations. Owing to its quadratic dispersion, the unique coincidence of four degenerate states at the Fermi energy, and strong Coulomb interactions, non-Fermi liquid behaviour ismore » predicted, for which we observe some evidence. Lastly, our discovery implies that Pr2Ir2O7 is a parent state that can be manipulated to produce other strongly correlated topological phases, such as topological Mott insulator, Weyl semimetal, and quantum spin and anomalous Hall states.« less

  10. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2010-11-02

    Methods, parallel computers, and computer program products are disclosed for low latency, high bandwidth data communications between compute nodes in a parallel computer. Embodiments include receiving, by an origin direct memory access (`DMA`) engine of an origin compute node, data for transfer to a target compute node; sending, by the origin DMA engine of the origin compute node to a target DMA engine on the target compute node, a request to send (`RTS`) message; transferring, by the origin DMA engine, a predetermined portion of the data to the target compute node using memory FIFO operation; determining, by the origin DMA engine whether an acknowledgement of the RTS message has been received from the target DMA engine; if the an acknowledgement of the RTS message has not been received, transferring, by the origin DMA engine, another predetermined portion of the data to the target compute node using a memory FIFO operation; and if the acknowledgement of the RTS message has been received by the origin DMA engine, transferring, by the origin DMA engine, any remaining portion of the data to the target compute node using a direct put operation.

  11. The portals 4.0.1 network programming interface.

    SciTech Connect (OSTI)

    Barrett, Brian W.; Brightwell, Ronald Brian; Pedretti, Kevin Thomas Tauke; Wheeler, Kyle Bruce; Hemmert, Karl Scott; Riesen, Rolf E.; Underwood, Keith Douglas; Maccabe, Arthur Bernard; Hudson, Trammell B.

    2013-04-01

    This report presents a specification for the Portals 4.0 network programming interface. Portals 4.0 is intended to allow scalable, high-performance network communication between nodes of a parallel computing system. Portals 4.0 is well suited to massively parallel processing and embedded systems. Portals 4.0 represents an adaption of the data movement layer developed for massively parallel processing platforms, such as the 4500-node Intel TeraFLOPS machine. Sandia's Cplant cluster project motivated the development of Version 3.0, which was later extended to Version 3.3 as part of the Cray Red Storm machine and XT line. Version 4.0 is targeted to the next generation of machines employing advanced network interface architectures that support enhanced offload capabilities. 3

  12. The Portals 4.0 network programming interface.

    SciTech Connect (OSTI)

    Barrett, Brian W.; Brightwell, Ronald Brian; Pedretti, Kevin Thomas Tauke; Wheeler, Kyle Bruce; Hemmert, Karl Scott; Riesen, Rolf E.; Underwood, Keith Douglas; Maccabe, Arthur Bernard; Hudson, Trammell B.

    2012-11-01

    This report presents a specification for the Portals 4.0 network programming interface. Portals 4.0 is intended to allow scalable, high-performance network communication between nodes of a parallel computing system. Portals 4.0 is well suited to massively parallel processing and embedded systems. Portals 4.0 represents an adaption of the data movement layer developed for massively parallel processing platforms, such as the 4500-node Intel TeraFLOPS machine. Sandia's Cplant cluster project motivated the development of Version 3.0, which was later extended to Version 3.3 as part of the Cray Red Storm machine and XT line. Version 4.0 is targeted to the next generation of machines employing advanced network interface architectures that support enhanced offload capabilities.

  13. Thread selection according to predefined power characteristics during context switching on compute nodes

    DOE Patents [OSTI]

    None

    2013-06-04

    Methods, apparatus, and products are disclosed for thread selection during context switching on a plurality of compute nodes that includes: executing, by a compute node, an application using a plurality of threads of execution, including executing one or more of the threads of execution; selecting, by the compute node from a plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads; determining, by the compute node, whether criteria for a thread context switch are satisfied; and performing, by the compute node, the thread context switch if the criteria for a thread context switch are satisfied, including executing the next thread of execution.

  14. A mobile-agent based wireless sensing network for structural monitoring applications

    SciTech Connect (OSTI)

    Taylor, Stuart G; Farinholt, Kevin M; Figueiredo, Eloi; Park, Gyuhae; Farrar, Charles R; Flynn, Eric B; Mascarenas, David L; Todd, Michael D

    2008-01-01

    A new wireless sensing network paradigm is presented for structural monitoring applications. In this approach, both power and data interrogation commands are conveyed via a mobile agent that is sent to sensor nodes to perform intended interrogations, which can alleviate several limitations of the traditional sensing networks. Furthermore, the mobile agent provides computational power to make near real-time assessments on the structural conditions. This paper will discuss such prototype systems, which are used to interrogate impedance-based sensors for structural health monitoring applications. Our wireless sensor node is specifically designed to accept various energy sources, including wireless energy transmission, and to be wirelessly triggered on an as-needed basis by the mobile agent or other sensor nodes. The capabilities of this proposed sensing network paradigm are demonstrated in the laboratory and the field.

  15. Nothing But Networking for Residential Network Members

    Broader source: Energy.gov [DOE]

    Better Buildings Residential Network Peer Exchange Call: Nothing But Networking for Residential Network Members, Call Slides and Discussion Summary, March 12, 2015.

  16. Exploring network structure, dynamics, and function using networkx

    SciTech Connect (OSTI)

    Hagberg, Aric; Swart, Pieter; S Chult, Daniel

    2008-01-01

    NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.

  17. runtime error message: "apsched: request exceeds max nodes, alloc"

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    apsched: request exceeds max nodes, alloc" runtime error message: "apsched: request exceeds max nodes, alloc" September 12, 2014 Symptom: User jobs with single or multiple apruns in a batch script may get this runtime error. "apsched: request exceeds max nodes, alloc". This problem is intermittent, started in April, then mid July, and again since late August. Status: This problem is identified as a problem when Torque/Moab batch scheduler becomes out of sync with the

  18. Sentient networks

    SciTech Connect (OSTI)

    Chapline, G.

    1998-03-01

    The engineering problems of constructing autonomous networks of sensors and data processors that can provide alerts for dangerous situations provide a new context for debating the question whether man-made systems can emulate the cognitive capabilities of the mammalian brain. In this paper we consider the question whether a distributed network of sensors and data processors can form ``perceptions`` based on sensory data. Because sensory data can have exponentially many explanations, the use of a central data processor to analyze the outputs from a large ensemble of sensors will in general introduce unacceptable latencies for responding to dangerous situations. A better idea is to use a distributed ``Helmholtz machine`` architecture in which the sensors are connected to a network of simple processors, and the collective state of the network as a whole provides an explanation for the sensory data. In general communication within such a network will require time division multiplexing, which opens the door to the possibility that with certain refinements to the Helmholtz machine architecture it may be possible to build sensor networks that exhibit a form of artificial consciousness.

  19. Channel Modeling and Time Delay Estimation for Clock Synchronization Among Seaweb Nodes

    SciTech Connect (OSTI)

    Gagnon, P; Rice, J; Clark, G A

    2012-07-08

    From simulations, tracking of the impulse response is feasible. Potential to benefit other functions such as ranging between two nodes. Potential to combine the features of different protocols to create a new and more realistic clock-synchronization protocol.

  20. Reducing power consumption during execution of an application on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2013-09-10

    Methods, apparatus, and products are disclosed for reducing power consumption during execution of an application on a plurality of compute nodes that include: powering up, during compute node initialization, only a portion of computer memory of the compute node, including configuring an operating system for the compute node in the powered up portion of computer memory; receiving, by the operating system, an instruction to load an application for execution; allocating, by the operating system, additional portions of computer memory to the application for use during execution; powering up the additional portions of computer memory allocated for use by the application during execution; and loading, by the operating system, the application into the powered up additional portions of computer memory.

  1. Microsoft PowerPoint - 08XTPO-M_Node_Opt.pptx

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    node Optimization Single-node Optimization Customer Documentation and Training PGI Compiler Options -help option displays command line options Request information about either a single option or groups of options options % pgf90 -help=groups Display the available optimization switches % pgf90 -switch -help ------------------------------------ * % pgf90 -fast -help % pgf90 fast help * Reading rcfile /opt/pgi/6.2.2/linux8664/6.2/bin/.pgf90rc -fast * Common optimizations; includes -O2 -Munroll=c:1

  2. A Network Contention Model for the Extreme-scale Simulator

    SciTech Connect (OSTI)

    Engelmann, Christian [ORNL; Naughton, III, Thomas J [ORNL

    2015-01-01

    The Extreme-scale Simulator (xSim) is a performance investigation toolkit for high-performance computing (HPC) hardware/software co-design. It permits running a HPC application with millions of concurrent execution threads, while observing its performance in a simulated extreme-scale system. This paper details a newly developed network modeling feature for xSim, eliminating the shortcomings of the existing network modeling capabilities. The approach takes a different path for implementing network contention and bandwidth capacity modeling using a less synchronous and accurate enough model design. With the new network modeling feature, xSim is able to simulate on-chip and on-node networks with reasonable accuracy and overheads.

  3. Communication and Energy Efficiency in Visual Sensor Networks for People Localization

    SciTech Connect (OSTI)

    Karakaya, Mahmut; Qi, Hairong

    2012-01-01

    This paper addresses the communication and energy efficiency in collaborative visual sensor networks (VSNs) for people localization, a challenging computer vision problem of its own. We focus on the design of a light-weight and energy efficient solution where people are localized based on distributed camera nodes integrating the so-called certainty map generated at each node, that records the target non-existence information within the camera s field of view. We first present a dynamic itinerary for certainty map integration where not only each sensor node transmits a very limited amount of data but that a limited number of camera nodes is involved. Then, we perform a comprehensive analytical study to evaluate communication and energy efficiency between different integration schemes, i.e., centralized and distributed integration. Based on results obtained from analytical study and real experiments, the distributed method shows effectiveness in detection accuracy as well as energy and bandwidth efficiency.

  4. Wireless Sensor Node Power Profiling Based on IEEE 802.11 and IEEE 802.15.4 Communication Protocols. Modeling and Simulation

    SciTech Connect (OSTI)

    Agarwal, Vivek; Richardson, Joseph; Zhang, Yanliang

    2015-10-01

    Most wireless sensor network (comprising of thousands of WSNs) applications require operation over extended periods of time beginning with their deployment. Network lifetime is extremely critical for most applications and is one of the limiting factors for energy-constrained networks. Based on applications, there are wide ranges of different energy sources suitable for powering WSNs. A battery is traditionally used to power WSNs. The deployed WSN is required to last for long time. Due to finite amount of energy present in batteries, it is not feasible to replace batteries. Recently there has been a new surge in the area of energy harvesting were ambient energy in the environment can be utilized to prolong the lifetime of WSNs. Some of the sources of ambient energies are solar power, thermal gradient, human motion and body heat, vibrations, and ambient RF energy. The design and development of TEGs to power WSNs that would remain active for a long period of time requires comprehensive understanding of WSN operational. This motivates the research in modeling the lifetime, i.e., power consumption, of a WSN by taking into consideration various node and network level activities. A WSN must perform three essential tasks: sense events, perform quick local information processing of sensed events, and wirelessly exchange locally processed data with the base station or with other WSNs in the network. Each task has a power cost per unit tine and an additional cost when switching between tasks. There are number of other considerations that must also be taken into account when computing the power consumption associated with each task. The considerations includes: number of events occurring in a fixed active time period and the duration of each event, event-information processing time, total communication time, number of retransmission, etc. Additionally, at the network level the communication of information data packets between WSNs involves collisions, latency, and

  5. Cut set-based risk and reliability analysis for arbitrarily interconnected networks

    DOE Patents [OSTI]

    Wyss, Gregory D.

    2000-01-01

    Method for computing all-terminal reliability for arbitrarily interconnected networks such as the United States public switched telephone network. The method includes an efficient search algorithm to generate minimal cut sets for nonhierarchical networks directly from the network connectivity diagram. Efficiency of the search algorithm stems in part from its basis on only link failures. The method also includes a novel quantification scheme that likewise reduces computational effort associated with assessing network reliability based on traditional risk importance measures. Vast reductions in computational effort are realized since combinatorial expansion and subsequent Boolean reduction steps are eliminated through analysis of network segmentations using a technique of assuming node failures to occur on only one side of a break in the network, and repeating the technique for all minimal cut sets generated with the search algorithm. The method functions equally well for planar and non-planar networks.

  6. Optimizing Cluster Heads for Energy Efficiency in Large-Scale Heterogeneous Wireless Sensor Networks

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Gu, Yi; Wu, Qishi; Rao, Nageswara S. V.

    2010-01-01

    Many complex sensor network applications require deploying a large number of inexpensive and small sensors in a vast geographical region to achieve quality through quantity. Hierarchical clustering is generally considered as an efficient and scalable way to facilitate the management and operation of such large-scale networks and minimize the total energy consumption for prolonged lifetime. Judicious selection of cluster heads for data integration and communication is critical to the success of applications based on hierarchical sensor networks organized as layered clusters. We investigate the problem of selecting sensor nodes in a predeployed sensor network to be the cluster headsmore » to minimize the total energy needed for data gathering. We rigorously derive an analytical formula to optimize the number of cluster heads in sensor networks under uniform node distribution, and propose a Distance-based Crowdedness Clustering algorithm to determine the cluster heads in sensor networks under general node distribution. The results from an extensive set of experiments on a large number of simulated sensor networks illustrate the performance superiority of the proposed solution over the clustering schemes based on k -means algorithm.« less

  7. An Industry/DOE Program to Develop and Benchmark Advanced Diamond Product Drill Bits and HP/HT Drilling Fluids to Significantly Improve Rates of Penetration

    SciTech Connect (OSTI)

    TerraTek

    2007-06-30

    A deep drilling research program titled 'An Industry/DOE Program to Develop and Benchmark Advanced Diamond Product Drill Bits and HP/HT Drilling Fluids to Significantly Improve Rates of Penetration' was conducted at TerraTek's Drilling and Completions Laboratory. Drilling tests were run to simulate deep drilling by using high bore pressures and high confining and overburden stresses. The purpose of this testing was to gain insight into practices that would improve rates of penetration and mechanical specific energy while drilling under high pressure conditions. Thirty-seven test series were run utilizing a variety of drilling parameters which allowed analysis of the performance of drill bits and drilling fluids. Five different drill bit types or styles were tested: four-bladed polycrystalline diamond compact (PDC), 7-bladed PDC in regular and long profile, roller-cone, and impregnated. There were three different rock types used to simulate deep formations: Mancos shale, Carthage marble, and Crab Orchard sandstone. The testing also analyzed various drilling fluids and the extent to which they improved drilling. The PDC drill bits provided the best performance overall. The impregnated and tungsten carbide insert roller-cone drill bits performed poorly under the conditions chosen. The cesium formate drilling fluid outperformed all other drilling muds when drilling in the Carthage marble and Mancos shale with PDC drill bits. The oil base drilling fluid with manganese tetroxide weighting material provided the best performance when drilling the Crab Orchard sandstone.

  8. Network Policies

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Acceptable Use Policy About ESnet Our Mission The Network ESnet History Governance & Policies ESnet Policy Board ESCC Acceptable Use Policy Data Privacy Policy Facility Data Policy Career Opportunities ESnet Staff & Org Chart Contact Us Contact Us Technical Assistance: 1 800-33-ESnet (Inside US) 1 800-333-7638 (Inside US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: trouble@es.net Provide Web Site Feedback: info@es.net ESnet Acceptable Use Policy The

  9. Historical Network Maps

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Network Maps Network Traffic Volume Historical Network Maps Network Facts & Stats Connected Sites Peering Connections ESnet Site Availabiliy OSCARS Fasterdata IPv6 Network Network Performance Tools The ESnet Engineering Team Network R&D Software-Defined Networking (SDN) Experimental Network Testbeds Performance (perfSONAR) Software & Tools Development Data for Researchers Partnerships Publications Workshops Science Engagement Move your data Programs & Workshops Science

  10. Nothing But Networking for Residential Network Members | Department...

    Energy Savers [EERE]

    Nothing But Networking for Residential Network Members Nothing But Networking for Residential Network Members Better Buildings Residential Network Peer Exchange Call: Nothing But ...