Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nodes”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,189 records · Page 66

Contention-free Routing for Shift-based Communication in MPI Applications on Large-scale Infiniband Clusters

Shift-based communication can be defined as follows. For a set of N nodes assigned to a job, assign each node an ID from 0 to N - 1. Shift-based communication involves N - 1 steps. Let D denote the current step, and let D iterate from 1 to N - 1. Then in step D all nodes choose nodes to send to and receive from such that a node with ID = I sends to the node with ID = (I + D)%N and receives from the node with ID = (I - D + N)%N, where % denotes modulo division. Figure 1 illustrates the communication patterns for various steps in shift-based communication. Shift-based communication patterns enable all nodes in a job to send and receive data simultaneously in all steps. Many MPI operations employ shift-based communication patterns for this reason. This includes large message collective algorithms, such as those typically used to implement large message Allgather and Alltoall collectives. It also includes small message collective algorithms, such as pair-wise exchange, barrier dissemination, and Bruck's index algorithm. Although the small message algorithms typically pack messages such that each node does not send to or receive from every other node directly, the communication patterns they do execute correspond to particular steps in shift-based communication. Common point-to-point message patterns also can benefit from efficient shift-based routing, such as nearest-neighbor exchanges in domain decomposition codes. Supporting efficient shift-based communication within a job thus provides good performance for a number of common MPI operations.

99 GENERAL AND MISCELLANEOUS↗

Network of dedicated processors for finding lowest-cost map path

A method and associated apparatus are disclosed for finding the lowest cost path of several variable paths. The paths are comprised of a plurality of linked cost-incurring areas existing between an origin point and a destination point. The method comprises the steps of connecting a purality of nodes together in the manner of the cost-incurring areas; programming each node to have a cost associated therewith corresponding to one of the cost-incurring areas; injecting a signal into one of the nodes representing the origin point; propagating the signal through the plurality of nodes from inputs to outputs; reducing the signal in magnitude at each node as a function of the respective cost of the node; and, starting at one of the nodes representing the destination point and following a path having the least reduction in magnitude of the signal from node to node back to one of the nodes representing the origin point whereby the lowest cost path from the origin point to the destination point is found.

Eberhardt, Silvio P.↗

Global tree network for computing structures enabling global processing operations

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.

Blumrich↗

Executing a gather operation on a parallel computer

Methods, apparatus, and computer program products are disclosed for executing a gather operation on a parallel computer according to embodiments of the present invention. Embodiments include configuring, by the logical root, a result buffer or the logical root, the result buffer having positions, each position corresponding to a ranked node in the operational group and for storing contribution data gathered from that ranked node. Embodiments also include repeatedly for each position in the result buffer: determining, by each compute node of an operational group, whether the current position in the result buffer corresponds with the rank of the compute node, if the current position in the result buffer corresponds with the rank of the compute node, contributing, by that compute node, the compute node's contribution data, if the current position in the result buffer does not correspond with the rank of the compute node, contributing, by that compute node, a value of zero for the contribution data, and storing, by the logical root in the current position in the result buffer, results of a bitwise OR operation of all the contribution data by all compute nodes of the operational group for the current position, the results received through the global combining network.

97 MATHEMATICS AND COMPUTING↗

Constructing a logical, regular axis topology from an irregular topology

Constructing a logical regular topology from an irregular topology including, for each axial dimension and recursively, for each compute node in a subcommunicator until returning to a first node: adding to a logical line of the axial dimension a neighbor specified in a nearest neighbor list; calling the added compute node; determining, by the called node, whether any neighbor in the node's nearest neighbor list is available to add to the logical line; if a neighbor in the called compute node's nearest neighbor list is available to add to the logical line, adding, by the called compute node to the logical line, any neighbor in the called compute node's nearest neighbor list for the axial dimension not already added to the logical line; and, if no neighbor in the called compute node's nearest neighbor list is available to add to the logical line, returning to the calling compute node.

97 MATHEMATICS AND COMPUTING↗

Constructing a logical, regular axis topology from an irregular topology

Constructing a logical regular topology from an irregular topology including, for each axial dimension and recursively, for each compute node in a subcommunicator until returning to a first node: adding to a logical line of the axial dimension a neighbor specified in a nearest neighbor list; calling the added compute node; determining, by the called node, whether any neighbor in the node's nearest neighbor list is available to add to the logical line; if a neighbor in the called compute node's nearest neighbor list is available to add to the logical line, adding, by the called compute node to the logical line, any neighbor in the called compute node's nearest neighbor list for the axial dimension not already added to the logical line; and, if no neighbor in the called compute node's nearest neighbor list is available to add to the logical line, returning to the calling compute node.

97 MATHEMATICS AND COMPUTING↗

Administering truncated receive functions in a parallel messaging interface

Administering truncated receive functions in a parallel messaging interface (`PMI`) of a parallel computer comprising a plurality of compute nodes coupled for data communications through the PMI and through a data communications network, including: sending, through the PMI on a source compute node, a quantity of data from the source compute node to a destination compute node; specifying, by an application on the destination compute node, a portion of the quantity of data to be received by the application on the destination compute node and a portion of the quantity of data to be discarded; receiving, by the PMI on the destination compute node, all of the quantity of data; providing, by the PMI on the destination compute node to the application on the destination compute node, only the portion of the quantity of data to be received by the application; and discarding, by the PMI on the destination compute node, the portion of the quantity of data to be discarded.

97 MATHEMATICS AND COMPUTING↗

Dynamic frequency control in power networks

Node controllers in power distribution networks in accordance with embodiments of the invention enable dynamic frequency control. One embodiment includes a node controller comprising a network interface a processor; and a memory containing a frequency control application; and a plurality of node operating parameters describing the operating parameters of a node, where the node is selected from a group consisting of at least one generator node in a power distribution network wherein the processor is configured by the frequency control application to calculate a plurality of updated node operating parameters using a distributed process to determine the updated node operating parameter using the node operating parameters, where the distributed process controls network frequency in the power distribution network; and adjust the node operating parameters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Decision system and method for separating faults from attacks

According to some embodiments, a plurality of monitoring nodes may each generate a series of current monitoring node values over time that represent a current operation of the industrial asset. A node classification computer may determine, for each monitoring node, a classification result indicating whether each monitoring node is in a normal or abnormal state. A disambiguation engine may receive the classification results from the node classification computer and associate a Hidden Markov Model (“HMM”) with each monitoring node. For each node in an abnormal state, the disambiguation engine may execute the HMM associated with that monitoring node to determine a disambiguation result indicating if the abnormal state is a result of an attack or a fault and output a current status of each monitoring node based on the associated classification result and the disambiguation result.

Giani, Annarita↗

Risk of Subclinical Micrometastatic Disease in the Supraclavicular Nodal Bed According to the Anatomic Distribution in Patients With Advanced Breast Cancer

Purpose: To determine the anatomic distribution of gross supraclavicular nodes within the supraclavicular fossa using 2-deoxy-2-[F-18] fluoro-d-glucose (FDG) positron emission tomography/computed tomography (PET/CT) scans, and to evaluate likely coverage of specific regions of the supraclavicular fossa using standard radiation fields. Methods and Materials: We identified 33 patients with advanced or metastatic breast cancer who had a PET/CT scan demonstrating hypermetabolic supraclavicular lymph nodes in 2005. The locations of the involved lymph nodes were mapped onto a single CT set of images of the supraclavicular fossa. These lymph nodes were also mapped onto the treatment-planning CT dataset of 4 patients treated in our institution (2 patients with biopsy-proven supraclavicular nodes and 2 patients with clinically negative supraclavicular nodes). Results: We were able to determine the distribution of 52 supraclavicular lymph nodes in 32 patients. Of 32 patients, 28 (87%) had a history of metastatic disease, and 2 patients had isolated nodal recurrences. Five patients had supraclavicular nodes posterior to the vertebral body transverse process, and several lymph nodes were in close proximity to the medial field border, raising the possibility of geographic miss in these areas. Conclusions: In patients with locally advanced disease, increased coverage of the supraclavicular fossa medially and posteriorly may be warranted.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Novel Risk Stratification to Predict Local-Regional Failures in Urothelial Carcinoma of the Bladder After Radical Cystectomy

Purpose: Local-regional failures (LF) following radical cystectomy (RC) plus pelvic lymph node dissection (PLND) with or without chemotherapy for invasive urothelial bladder carcinoma are more common than previously reported. Adjuvant radiation therapy (RT) could reduce LF but currently has no defined role because of previously reported morbidity. Modern techniques with improved normal tissue sparing have rekindled interest in RT. We assessed the risk of LF and determined those factors that predict recurrence to facilitate patient selection for future adjuvant RT trials. Methods and Materials: From 1990-2008, 442 patients with urothelial bladder carcinoma at University of Pennsylvania were prospectively followed after RC plus PLND with or without chemotherapy with routine pelvic computed tomography (CT) or magnetic resonance imaging (MRI). One hundred thirty (29%) patients received chemotherapy. LF was any pelvic failure detected before or within 3 months of distant failure. Competing risk analyses identified factors predicting increased LF risk. Results: On univariate analysis, pathologic stage {>=}pT3, <10 nodes removed, positive margins, positive nodes, hydronephrosis, lymphovascular invasion, and mixed histology significantly predicted LF; node density was marginally predictive, but use of chemotherapy, number of positive nodes, type of surgical diversion, age, gender, race, smoking history, and body mass index were not. On multivariate analysis, only stage {>=}pT3 and <10 nodes removed were significant independent LF predictors with hazard ratios of 3.17 and 2.37, respectively (P<.01). Analysis identified 3 patient subgroups with significantly different LF risks: low-risk ({<=}pT2), intermediate-risk ({>=}pT3 and {>=}10 nodes removed), and high-risk ({>=}pT3 and <10 nodes) with 5-year LF rates of 8%, 23%, and 42%, respectively (P<.01). Conclusions: This series using routine CT and MRI surveillance to detect LF confirms that such failures are relatively common in cases of locally advanced disease and provides a rubric based on pathological stage and number of nodes removed that stratifies patients into 3 groups with significantly different LF risks to simplify patient selection for future adjuvant radiation therapy trials.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Patterns of Local-Regional Management Following Neoadjuvant Chemotherapy in Breast Cancer: Results From ACOSOG Z1071 (Alliance)

Purpose: American College of Surgeons Oncology Group Z1071 was a prospective trial evaluating the false negative rate of sentinel lymph node (SLN) surgery after neoadjuvant chemotherapy (NAC) in breast cancer patients with initial node-positive disease. Radiation therapy (RT) decisions were made at the discretion of treating physicians, providing an opportunity to evaluate variability in practice patterns following NAC. Methods and Materials: Of 756 patients enrolled from July 2009 to June 2011, 685 met all eligibility requirements. Surgical approach, RT, and radiation field design were analyzed based on presenting clinical and pathologic factors. Results: Of 401 node-positive patients, mastectomy was performed in 148 (36.9%), mastectomy with immediate reconstruction in 107 (26.7%), and breast-conserving surgery (BCS) in 146 patients (36.4%). Of the 284 pathologically node-negative patients, mastectomy was performed in 84 (29.6%), mastectomy with immediate reconstruction in 69 (24.3%), and BCS in 131 patients (46.1%). Bilateral mastectomy rates were higher in women undergoing reconstruction than in those without (66.5% vs 32.2%, respectively, P<.0001). Use of internal mammary RT was low (7.8%-11.2%) and did not differ between surgical approaches. Supraclavicular RT rate ranged from 46.6% to 52.2% and did not differ between surgical approaches but was omitted in 193 or 408 node-positive patients (47.3%). Rate of axillary RT was more frequent in patients who remained node-positive (P=.002). However, 22% of patients who converted to node-negative still received axillary RT. Post-mastectomy RT was more frequently omitted after reconstruction than mastectomy (23.9% vs 12.1%, respectively, P=.002) and was omitted in 19 of 107 patients (17.8%) with residual node-positive disease in the reconstruction group. Conclusions: Most clinically node-positive patients treated with NAC undergoing mastectomy receive RT. RT is less common in patients undergoing reconstruction. There is wide variability in RT fields. These practice patterns conflict with expert recommendations and ongoing trial guidelines. There is a significant need for greater uniformity and guidelines regarding RT following NAC.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Prognostic Factors and Patterns of Locoregional Failure After Surgical Resection in Patients With Cholangiocarcinoma Without Adjuvant Radiation Therapy: Optimal Field Design for Adjuvant Radiation Therapy

Purpose: To identify prognostic factors and patterns of local failure in patients with cholangiocarcinoma (CCA), after surgical resection in the absence of adjuvant radiation, for optimal definition of target volumes encompassing the majority of local recurrences. Methods and Materials: A chart review was performed in patients who underwent resection for primary CCA (intrahepatic, hilar, and distal) between 1999 and 2014. Local failure was defined as recurrence in a theoretical reasonable postoperative radiation volume. This includes the cut surface of liver, biliary anastomosis, hilum, portal nodes, celiac nodes, peri-pancreatic nodes, gastro-hepatic nodes, and retroperitoneal nodes. Patients who received adjuvant radiation were excluded. Results: A total of 189 patients underwent surgical resection for CCA, of whom 145 patients had sufficient follow-up. Median follow-up was 41.6 months (95% confidence interval 35.4-48.7 months). Of the 145 cases, 102 were intrahepatic and 43 were hilar/distal CCA. Adjuvant chemotherapy was given in 38 cases (26%), of which 20 (54%) were gemcitabine-based. Eighty-six patients (59%) had a documented recurrence, of whom 44 (51%) had a locoregional component. Among patients who had a recurrence, 23 (27%) had a recurrence at the biliary anastomosis and/or cut liver surface. Twenty-eight patients (32.6%) had a recurrence in the regional lymph nodes, most prevalent in the portal (16.3%) and retroperitoneal (17.4%) lymph nodes. Univariable analysis identified tumor size, any vascular invasion, presence of satellites, stage/nodal status, and receipt of chemotherapy as significant prognostic factors of overall recurrence among intrahepatic patients. Presence of satellites, and stage 3/Nx status remained statistically significant in multivariable modeling. Conclusions: The areas at highest risk for locoregional recurrence after surgical resection for primary CCA are the biliary anastomosis/cut liver surface, portal lymph nodes, and retroperitoneal lymph nodes. Although these results need to be validated, adjuvant radiation should possibly cover these areas to maximize locoregional control.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Noninvasive Assessment of Tumor Microenvironment Using Dynamic Contrast-Enhanced Magnetic Resonance Imaging and {sup 18}F-Fluoromisonidazole Positron Emission Tomography Imaging in Neck Nodal Metastases

Purpose: To assess noninvasively the tumor microenvironment of neck nodal metastases in patients with head-and-neck cancer by investigating the relationship between tumor perfusion measured using dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) and hypoxia measured by {sup 18}F-fluoromisonidazole ({sup 18}F-FMISO) positron emission tomography (PET). Methods and Materials: Thirteen newly diagnosed head-and-neck cancer patients with metastatic neck nodes underwent DCE-MRI and {sup 18}F-FMISO PET imaging before chemotherapy and radiotherapy. The matched regions of interests from both modalities were analyzed. To examine the correlations between DCE-MRI parameters and standard uptake value (SUV) measurements from {sup 18}F-FMISO PET, the nonparametric Spearman correlation coefficient was calculated. Furthermore, DCE-MRI parameters were compared between nodes with {sup 18}F-FMISO uptake and nodes with no {sup 18}F-FMISO uptake using Mann-Whitney U tests. Results: For the 13 patients, a total of 18 nodes were analyzed. The nodal size strongly correlated with the {sup 18}F-FMISO SUV ({rho} = 0.74, p < 0.001). There was a strong negative correlation between the median k{sub ep} (redistribution rate constant) value ({rho} = -0.58, p = 0.042) and the {sup 18}F-FMISO SUV. Hypoxic nodes (moderate to severe {sup 18}F-FMISO uptake) had significantly lower median K{sup trans} (volume transfer constant) (p = 0.049) and median k{sub ep} (p = 0.027) values than did nonhypoxic nodes (no {sup 18}F-FMISO uptake). Conclusion: This initial evaluation of the preliminary results support the hypothesis that in metastatic neck lymph nodes, hypoxic nodes are poorly perfused (i.e., have significantly lower K{sup trans} and k{sub ep} values) compared with nonhypoxic nodes.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Deterministic multi-qubit entanglement in a quantum network

High-fidelity deterministic quantum state transfer and multi-qubit entanglement are demonstrated in a quantum network comprising two superconducting quantum nodes one metre apart, with each node including three interconnected qubits. The generation of high-fidelity distributed multi-qubit entanglement is a challenging task for large-scale quantum communication and computational networks. The deterministic entanglement of two remote qubits has recently been demonstrated with both photons and phonons. However, the deterministic generation and transmission of multi-qubit entanglement has not been demonstrated, primarily owing to limited state-transfer fidelities. Here we report a quantum network comprising two superconducting quantum nodes connected by a one-metre-long superconducting coaxial cable, where each node includes three interconnected qubits. By directly connecting the cable to one qubit in each node, we transfer quantum states between the nodes with a process fidelity of 0.911 +/- 0.008. We also prepare a three-qubit Greenberger-Horne-Zeilinger (GHZ) state in one node and deterministically transfer this state to the other node, with a transferred-state fidelity of 0.656 +/- 0.014. We further use this system to deterministically generate a globally distributed two-node, six-qubit GHZ state with a state fidelity of 0.722 +/- 0.021. In this work, the GHZ state fidelities are clearly above the threshold of 1/2 for genuine multipartite entanglement, showing that this architecture can be used to coherently link together multiple superconducting quantum processors, providing a modular approach for building large-scale quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Identification of Critical Infrastructure via PageRank

Assessing critical infrastructure vulnerabilities is paramount to arranging efficient plans for their protection. Critical infrastructures are cyber-physical systems that can be represented as a network consisting of nodes and edges and highly interdependent in nature. Given the interdependent nature of critical infrastuctures, failure in one node may cause failure in many others resulting in a cascade of failures. In this paper, we propose a node criticality metric that uses Google’s PageRank algorithm to identify nodes that are likely to fail (are vulnerable), nodes whose failure may cascade to many other sites in the network (are important), and nodes that are both vulnerable and important (are critical). We then present a series of experiments to understand how protecting certain critical nodes can help mitigate massive cascading failures. Simulating failures in a real-world network with and without critical node protections demonstrates the importance of identifying critical nodes in an infrastructure network.

Kay, Bill↗

Connecting Network Properties of Rapidly Disseminating Epizoonotics

Background: To effectively control the geographical dissemination of infectious diseases, their properties need to be determined. To test that rapid microbial dispersal requires not only susceptible hosts but also a pre-existing, connecting network, we explored constructs meant to reveal the network properties associated with disease spread, which included the road structure. Methods: Using geo-temporal data collected from epizoonotics in which all hosts were susceptible (mammals infected by Foot-and-mouth disease virus, Uruguay, 2001; birds infected by Avian Influenza virus H5N1, Nigeria, 2006), two models were compared: 1) ‘connectivity’, a model that integrated bio-physical concepts (the agent’s transmission cycle, road topology) into indicators designed to measure networks (‘nodes’ or infected sites with short- and long-range links), and 2) ‘contacts’, which focused on infected individuals but did not assess connectivity. Results: The connectivity model showed five network properties: 1) spatial aggregation of cases (disease clusters), 2) links among similar ‘nodes’ (assortativity), 3) simultaneous activation of similar nodes (synchronicity), 4) disease flows moving from highly to poorly connected nodes (directionality), and 5) a few nodes accounting for most cases (a ‘‘20:800 pattern). In both epizoonotics, 1) not all primary cases were connected but at least one primary case was connected, 2) highly connected, small areas (nodes) accounted for most cases, 3) several classes of nodes were distinguished, and 4) the contact model, which assumed all primary cases were identical, captured half the number of cases identified by the connectivity model. When assessed together, the synchronicity and directionality properties explained when and where an infectious disease spreads. Conclusions: Geo-temporal constructs of Network Theory’s nodes and links were retrospectively validated in rapidly disseminating infectious diseases. They distinguished classes of cases, nodes, and networks, generating information usable to revise theory and optimize control measures. Prospective studies that consider pre-outbreak predictors, such as connecting networks, are recommended.

59 BASIC BIOLOGICAL SCIENCES↗

Optimizing Performance on Trinity Utilizing Machine Learning, Proxy Applications and Scheduling Priorities

The sheer number of nodes continues to increase in today’s supercomputers, the first half of Trinity alone contains more than 9400 compute nodes. Since the speed of today’s clusters are limited by the slowest nodes, it more important than ever to identify slow nodes, improve their performance if it can be done, and assure minimal usage of slower nodes during performance critical runs. This is an ongoing maintenance task that occurs on a regular basis and, therefore, it is important to minimize the impact upon its users by assessing and addressing slow performing nodes and mitigating their consequences while minimizing down time. These issues can be solved, in large part, through a systematic application of fast running hardware assessment tests, the application of Machine Learning, and making use of performance data to increase efficiency of large clusters. Proxy applications utilizing both MPI and OpenMP were developed to produce data as a substitute for long runtime applications to evaluate node performance. Machine learning is applied to identify underperforming nodes, and policies are being discussed to both minimize the impact of underperforming nodes and increase the efficiency of the system. In this paper, I will describe the process used to produce quickly performing proxy tests, consider various methods to isolate the outliers, and produce ordered lists for use in scheduling to accomplish this task.

97 MATHEMATICS AND COMPUTING↗