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,207 records · Page 67

Peer-to-peer architectures for exascale computing : LDRD final report.

The goal of this research was to investigate the potential for employing dynamic, decentralized software architectures to achieve reliability in future high-performance computing platforms. These architectures, inspired by peer-to-peer networks such as botnets that already scale to millions of unreliable nodes, hold promise for enabling scientific applications to run usefully on next-generation exascale platforms ({approx} 10{sup 18} operations per second). Traditional parallel programming techniques suffer rapid deterioration of performance scaling with growing platform size, as the work of coping with increasingly frequent failures dominates over useful computation. Our studies suggest that new architectures, in which failures are treated as ubiquitous and their effects are considered as simply another controllable source of error in a scientific computation, can remove such obstacles to exascale computing for certain applications. We have developed a simulation framework, as well as a preliminary implementation in a large-scale emulation environment, for exploration of these 'fault-oblivious computing' approaches. High-performance computing (HPC) faces a fundamental problem of increasing total component failure rates due to increasing system sizes, which threaten to degrade system reliability to an unusable level by the time the exascale range is reached ({approx} 10{sup 18} operations per second, requiring of order millions of processors). As computer scientists seek a way to scale system software for next-generation exascale machines, it is worth considering peer-to-peer (P2P) architectures that are already capable of supporting 10{sup 6}-10{sup 7} unreliable nodes. Exascale platforms will require a different way of looking at systems and software because the machine will likely not be available in its entirety for a meaningful execution time. Realistic estimates of failure rates range from a few times per day to more than once per hour for these platforms. P2P architectures give us a starting point for crafting applications and system software for exascale. In the context of the Internet, P2P applications (e.g., file sharing, botnets) have already solved this problem for 10{sup 6}-10{sup 7} nodes. Usually based on a fractal distributed hash table structure, these systems have proven robust in practice to constant and unpredictable outages, failures, and even subversion. For example, a recent estimate of botnet turnover (i.e., the number of machines leaving and joining) is about 11% per week. Nonetheless, P2P networks remain effective despite these failures: The Conficker botnet has grown to {approx} 5 x 10{sup 6} peers. Unlike today's system software and applications, those for next-generation exascale machines cannot assume a static structure and, to be scalable over millions of nodes, must be decentralized. P2P architectures achieve both, and provide a promising model for 'fault-oblivious computing'. This project aimed to study the dynamics of P2P networks in the context of a design for exascale systems and applications. Having no single point of failure, the most successful P2P architectures are adaptive and self-organizing. While there has been some previous work applying P2P to message passing, little attention has been previously paid to the tightly coupled exascale domain. Typically, the per-node footprint of P2P systems is small, making them ideal for HPC use. The implementation on each peer node cooperates en masse to 'heal' disruptions rather than relying on a controlling 'master' node. Understanding this cooperative behavior from a complex systems viewpoint is essential to predicting useful environments for the inextricably unreliable exascale platforms of the future. We sought to obtain theoretical insight into the stability and large-scale behavior of candidate architectures, and to work toward leveraging Sandia's Emulytics platform to test promising candidates in a realistic (ultimately {ge} 10{sup 7} nodes) setting. Our primary example applications are drawn from linear algebra: a Jacobi relaxation solver for the heat equation, and the closely related technique of value iteration in optimization. We aimed to apply P2P concepts in designing implementations capable of surviving an unreliable machine of 10{sup 6} nodes.

99 GENERAL AND MISCELLANEOUS↗

Depth-first search approach for fault-tolerant routing in hypercube multicomputers

Using depth-first search, the authors develop and analyze the performance of a routing scheme for hypercube multicomputers in the presence of an arbitrary number of faulty components. They derive an exact expression for the probability of routing messages by way of optimal paths (of length equal to the Hamming distance between the corresponding pair of nodes) from the source node to an obstructed node. The obstructed node is defined as the first node encountered by the message that finds no optimal path to the destination node. It is noted that the probability of routing messages over an optimal path between any two nodes is a special case of the present results and can be obtained by replacing the obstructed node with the destination node. Numerical examples are given to illustrate the results, and they show that, in the presence of component failures, depth-first search routing can route a message to its destination by means of an optimal path with a very high probability.

Chen, Ming-Syan↗

Dynamic resource allocation scheme for distributed heterogeneous computer systems

This invention relates to a resource allocation in computer systems, and more particularly, to a method and associated apparatus for shortening response time and improving efficiency of a heterogeneous distributed networked computer system by reallocating the jobs queued up for busy nodes to idle, or less-busy nodes. In accordance with the algorithm (SIDA for short), the load-sharing is initiated by the server device in a manner such that extra overhead in not imposed on the system during heavily-loaded conditions. The algorithm employed in the present invention uses a dual-mode, server-initiated approach. Jobs are transferred from heavily burdened nodes (i.e., over a high threshold limit) to low burdened nodes at the initiation of the receiving node when: (1) a job finishes at a node which is burdened below a pre-established threshold level, or (2) a node is idle for a period of time as established by a wakeup timer at the node. The invention uses a combination of the local queue length and the local service rate ratio at each node as the workload indicator.

Liu, Howard T.↗

Wireless Data-Acquisition System for Testing Rocket Engines

A prototype wireless data-acquisition system has been developed as a potential replacement for a wired data-acquisition system heretofore used in testing rocket engines. The traditional use of wires to connect sensors, signal-conditioning circuits, and data acquisition circuitry is time-consuming and prone to error, especially when, as is often the case, many sensors are used in a test. The system includes one master and multiple slave nodes. The master node communicates with a computer via an Ethernet connection. The slave nodes are powered by rechargeable batteries and are packaged in weatherproof enclosures. The master unit and each of the slave units are equipped with a time-modulated ultra-wide-band (TMUWB) radio transceiver, which spreads its RF energy over several gigahertz by transmitting extremely low-power and super-narrow pulses. In this prototype system, each slave node can be connected to as many as six sensors: two sensors can be connected directly to analog-to-digital converters (ADCs) in the slave node and four sensors can be connected indirectly to the ADCs via signal conditioners. The maximum sampling rate for streaming data from any given sensor is about 5 kHz. The bandwidth of one channel of the TM-UWB radio communication system is sufficient to accommodate streaming of data from five slave nodes when they are fully loaded with data collected through all possible sensor connections. TM-UWB radios have a much higher spatial capacity than traditional sinusoidal wave-based radios. Hence, this TM-UWB wireless data-acquisition can be scaled to cover denser sensor setups for rocket engine test stands. Another advantage of TM-UWB radios is that it will not interfere with existing wireless transmission. The maximum radio-communication range between the master node and a slave node for this prototype system is about 50 ft (15 m) when the master and slave transceivers are equipped with small dipole antennas. The range can be increased by changing to larger antennas and/or greater transmission power. The battery life of a slave node ranges from about six hours during operation at full capacity to as long as three days when the system is in a "sleep" mode used to conserve battery charge during times between setup and rocket-engine testing. Batteries can be added to prolong operational lifetimes. The radio transceiver dominates the power consumption.

Lin, Chujen↗

Distributed Transforms for Efficient Data Gathering in Sensor Networks

Devices, systems, and techniques for data collecting network such as wireless sensors are disclosed. A described technique includes detecting one or more remote nodes included in the wireless sensor network using a local power level that controls a radio range of the local node. The technique includes transmitting a local outdegree. The local outdegree can be based on a quantity of the one or more remote nodes. The technique includes receiving one or more remote outdegrees from the one or more remote nodes. The technique includes determining a local node type of the local node based on detecting a node type of the one or more remote nodes, using the one or more remote outdegrees, and using the local outdegree. The technique includes adjusting characteristics, including an energy usage characteristic and a data compression characteristic, of the wireless sensor network by selectively modifying the local power level and selectively changing the local node type.

Ortega, Antonio↗

Routing Based on Length of Time of Available Connection

In an embodiment, a method of routing packets at a first node in an ad-hoc network is provided. The method includes receiving, at the first node, a plurality of route-alive messages corresponding to a destination, each of the plurality of route-alive messages including a route time indicating a length of time in which a communicative connection is available between the second node that sent the respective route-alive message and the destination. The method also includes determining an updated route time for each second node. The updated route time corresponds to a length of time in which a communication connection is available between the first node and the destination through the respective second node. A second node is selected for sending a packet to based on the updated route time for each of the second nodes, wherein a node having a longer updated route time is given higher priority for selection.

Anandappan, Thanga↗

Complex Dynamics of Air Traffic Flow

Air traffic in the United States has continued to grow at a steady pace since 1980, except for a dip immediately after the tragic events of September 11, 2001. There are different growth scenarios associated both with the magnitude and the composition of the future air traffic. The Terminal Area Forecast (TAF), prepared every year by the FAA, projects the growth of traffic in the United States. Both Boeing and Airbus publish market outlooks for air travel annually. Although predicting the future growth of traffic is difficult, there are two significant trends: heavily congested major airports continue to see an increase in traffic, and the emergence of regional jets and other smaller aircraft with fewer passengers operating directly between non-major airports. The interaction between air traffic demand and the ability of the system to provide the necessary airport and airspace resources can be modeled as a network. The size of the resulting network varies depending on the choice of its nodes. It would be useful to understand the properties of this network to guide future design and development. Many questions, such as the growth of delay with increasing traffic demand and impact of the en route weather on future air traffic, require a systematic understanding of the properties of the air traffic network. There has been a major advance in the understanding of the behavior of networks with a large number of components. Several theories have been advanced about the evolution of large biological and engineering networks by authors in diversified disciplines like physics, mathematics, biology and computer science. Several networks exhibit a scale-free property in the sense that the probabilistic distribution of their nodes as a function of connections decreases slower than an exponential. These networks are characterized by the fact that a small number of components have a disproportionate influence on the performance of the network. Scale-free networks are tolerant to random failure of components, but are vulnerable to selective attack on components. This paper examines two network representations for the baseline air traffic system. A network defined with the 40 major airports as nodes and with standard flight routes as links has a characteristic scale: all nodes have 60 or more links and no node has more than 460 links. Another network is defined with baseline aircraft routing structure exhibits an exponentially truncated scale-free behavior. Its degree ranges from 2 connections to 2900 connections, and 225 nodes have more than 250 connections. Furthermore, those high-degree nodes are homogeneously distributed in the airspace. A consequence of this scale-free behavior is that the random loss of a single node has little impact, but the loss of multiple high-degree nodes (such as occurs during major storms in busy airspace) can adversely impact the system. Two future scenarios of air traffic growth are used to predict the growth of air traffic in the United States. It is shown that a three-times growth in the overall traffic may result in a ten-times impact on the density of traffic in certain parts of the United States.

Scale-free Networks↗

Method and system for monitoring environmental conditions

A system for detecting the occurrence of anomalies includes a plurality of spaced apart nodes, with each node having adjacent nodes, each of the nodes having one or more sensors associated with the node and capable of detecting anomalies, and each of the nodes having a controller connected to the sensors associated with the node. The system also includes communication links between adjacent nodes, whereby the nodes form a network. At least one software agent is capable of changing the operation of at least one of the controllers in response to the detection of an anomaly by a sensor.

Kulesz, James J↗

Link failure detection in a parallel computer

Methods, apparatus, and products are disclosed for link failure detection in a parallel computer including compute nodes connected in a rectangular mesh network, each pair of adjacent compute nodes in the rectangular mesh network connected together using a pair of links, that includes: assigning each compute node to either a first group or a second group such that adjacent compute nodes in the rectangular mesh network are assigned to different groups; sending, by each of the compute nodes assigned to the first group, a first test message to each adjacent compute node assigned to the second group; determining, by each of the compute nodes assigned to the second group, whether the first test message was received from each adjacent compute node assigned to the first group; and notifying a user, by each of the compute nodes assigned to the second group, whether the first test message was received.

Archer, Charles J↗

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

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.

97 MATHEMATICS AND COMPUTING↗

Hybrid data storage system in an HPC exascale environment

A computer-executable method, system, and computer program product for managing I/O requests from a compute node in communication with a data storage system, including a first burst buffer node and a second burst buffer node, the computer-executable method, system, and computer program product comprising striping data on the first burst buffer node and the second burst buffer node, wherein a first portion of the data is communicated to the first burst buffer node and a second portion of the data is communicated to the second burst buffer node, processing the first portion of the data at the first burst buffer node, and processing the second portion of the data at the second burst buffer node.

97 MATHEMATICS AND COMPUTING↗

Dynamic, resilient sensing system for automatic cyber-attack neutralization

An industrial asset may have monitoring nodes that generate current monitoring node values. An abnormality detection computer may determine that an abnormal monitoring node is currently being attacked or experiencing fault. A dynamic, resilient estimator constructs, using normal monitoring node values, a latent feature space (of lower dimensionality as compared to a temporal space) associated with latent features. The system also constructs, using normal monitoring node values, functions to project values into the latent feature space. Responsive to an indication that a node is currently being attacked or experiencing fault, the system may compute optimal values of the latent features to minimize a reconstruction error of the nodes not currently being attacked or experiencing a fault. The optimal values may then be projected back into the temporal space to provide estimated values and the current monitoring node values from the abnormal monitoring node are replaced with the estimated values.

97 MATHEMATICS AND COMPUTING↗

Identifying location of data granules in global virtual address space

An approach is disclosed that identifies a home node of a data granule. The process is performed by an information handling system (a local node) that retrieves a global virtual address directory. The global virtual address directory maps shared virtual addresses to a number nodes that includes the local node with one of the nodes being the home node. The shared virtual addresses correspond to a plurality of memory addresses that are stored in a shared virtual memory that is shared amongst the plurality of nodes. The approach receives a selected shared virtual address, retrieves, from the global virtual address directory, the home node associated with the selected shared virtual address, and accesses the data granule corresponding to the selected shared virtual address from the home node.

Johns, Charles R.↗

Mapping Patterns of Ipsilateral Supraclavicular Nodal Metastases in Breast Cancer: Rethinking the Clinical Target Volume for High-risk Patients

Purpose: To map the location of metastatic supraclavicular (SCV) lymph nodes (LNMs) in breast cancer patients with SCV node involvement and determine whether and where the radiation therapy clinical target volume (CTV) of this region could be modified in high-risk subsets. Methods and Materials: Fifty-five patients with metastatic SCV LNMs were eligible for geographic mapping and atlas coverage analysis. All LNMs and their epicenters were registered proportionally by referencing the surrounding landmarks onto simulation computed tomography images of a standard patient. CTVs based on selected SCV atlases, including the one by the Radiation Therapy Oncology Group (RTOG) were contoured. A modified SCV CTV was tried and shown to have better involved-node coverage and thus theoretically improved prophylaxis in this setting. Results: A total of 50 (91%) and 45 (81.8%) patients had LNMs in the medial and lateral SCV subregions, respectively. Also, 36 patients (65.5%) had LNMs located at the junction of the jugular-subclavian veins. All nodes were covered in only 25.5% to 41.8% of patients by different atlases. The RTOG atlas covered all nodes in 25.5% of patients. Stratified by the nodes in all the patients as a whole, 49.2% to 81.3% were covered, and the RTOG atlas covered 62.6%. The lateral and posterior borders were the most overlooked locations. Modification by extending the borders to natural anatomic barriers allowed the new CTV to cover all the nodes in 81.8% of patients and encompass 96.1% of all the nodes. Conclusions: According to the distribution of SCV LNMs, the extent of existing atlases might not be adequate for potential metastatic sites in certain groups of patients. The extension of the lateral and posterior CTV borders in high-risk or recurrent patients might be a reasonable approach for increasing coverage. However, additional data in more homogeneous populations with localized disease are needed before routine application.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Strategy of Using Intratreatment Hypoxia Imaging to Selectively and Safely Guide Radiation Dose De-escalation Concurrent With Chemotherapy for Locoregionally Advanced Human Papillomavirus–Related Oropharyngeal Carcinoma

Purpose: To report a small substudy of an ongoing large, multi-arm study using functional imaging to assess pre-/intratreatment hypoxia for all head and neck cancer, in which we hypothesized that pre- and early-treatment hypoxia assessment using functional positron emission tomography (PET) imaging may help select which human papillomavirus (HPV)-positive (HPV{sup +}) oropharyngeal cancer (OPC) patients can safely receive radiation de-escalation without jeopardizing treatment outcomes. Methods and Materials: Patients with HPV{sup +} oropharyngeal carcinoma were enrolled on an institutional review board–approved prospective study of which de-escalation based on imaging response was done for node(s) only. Pretreatment {sup 18}F-fluorodeoxyglucose and dynamic {sup 18}F-FMISO (fluoromisonidazole) positron emission tomography (PET) scans were performed. For patients with pretreatment hypoxia on{sup 18}F-FMISO PET (defined as a >1.2 tumor to muscle standard uptake value ratio), a repeat scan was done 1 week after chemoradiation. Patients without pretreatment hypoxia or with resolution of hypoxia on repeat scan received a 10-Gy dose reduction to metastatic lymph node(s). The 2-year local, regional, distant metastasis–free, and overall survival rates were estimated using the Kaplan-Meier product-limit method. A subset of patients had biopsy of a hypoxic node done under image guidance. Results: Thirty-three HPV{sup +} OPC patients were enrolled in this pilot study. One hundred percent showed pretreatment hypoxia (at primary site and/or node[s]), and among these, 48% resolved (at primary site and/or node[s]); 30% met criteria and received 10-Gy reduction to the lymph node(s). At the median follow-up of 32 months (range, 21-61 months), the 2-year locoregional control rate was 100%. One patient failed distantly with persistence of hypoxia on {sup 18}F-FMISO PET. The 2-year distant metastasis–free rate was 97%. The 2-year OS rate was 100%. Hypoxia on imaging was confirmed pathologically. Conclusions: Hypoxia is present in HPV{sup +} tumors but resolves within 1 week of treatment in 48% of cases either at the primary site and/or lymph node(s). Our 100% locoregional control rate suggests that intratreatment functional imaging used to selectively de-escalate node(s) to 60 Gy was confirmed safe using our stringent imaging criteria. Intratreatment functional imaging warrants further study to determine its ultimate role in de-escalation treatment strategies.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Automated temporal tracking and segmentation of lymphoma on serial CT examinations

Purpose: It is challenging to reproducibly measure and compare cancer lesions on numerous follow-up studies; the process is time-consuming and error-prone. In this paper, we show a method to automatically and reproducibly identify and segment abnormal lymph nodes in serial computed tomography (CT) exams. Methods: Our method leverages initial identification of enlarged (abnormal) lymph nodes in the baseline scan. We then identify an approximate region for the node in the follow-up scans using nonrigid image registration. The baseline scan is also used to locate regions of normal, non-nodal tissue surrounding the lymph node and to map them onto the follow-up scans, in order to reduce the search space to locate the lymph node on the follow-up scans. Adaptive region-growing and clustering algorithms are then used to obtain the final contours for segmentation. We applied our method to 24 distinct enlarged lymph nodes at multiple time points from 14 patients. The scan at the earlier time point was used as the baseline scan to be used in evaluating the follow-up scan, resulting in 70 total test cases (e.g., a series of scans obtained at 4 time points results in 3 test cases). For each of the 70 cases, a ''reference standard'' was obtained by manual segmentation by a radiologist. Assessment according to response evaluation criteria in solid tumors (RECIST) using our method agreed with RECIST assessments made using the reference standard segmentations in all test cases, and by calculating node overlap ratio and Hausdorff distance between the computer and radiologist-generated contours. Results: Compared to the reference standard, our method made the correct RECIST assessment for all 70 cases. The average overlap ratio was 80.7 {+-} 9.7% s.d., and the average Hausdorff distance was 3.2 {+-} 1.8 mm s.d. The concordance correlation between automated and manual segmentations was 0.978 (95% confidence interval 0.962, 0.984). The 100% agreement in our sample between our method and the standard with regard to RECIST classification suggests that the true disagreement rate is no more than 6%. Conclusions: Our automated lymph node segmentation method achieves excellent overall segmentation performance and provides equivalent RECIST assessment. It potentially will be useful to streamline and improve cancer lesion measurement and tracking and to improve assessment of cancer treatment response.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Identification and Preservation of Arm Lymphatic System in Axillary Dissection for Breast Cancer to Reduce Arm Lymphedema Events: A Randomized Clinical Trial

Background: Controversy in axillary reverse mapping in axillary lymph node dissection (ALND) possibly results from incomplete recognition of the arm lymphatic system (ALS) and its compromise to oncological safety. The iDEntification and Preservation of ARm lymphaTic system (DEPART) technique facilitates complete identification of ALS; therefore, its use may decrease the occurrence of arm lymphedema. This study aimed to examine the arm lymphedema rate, locoregional recurrence, and feasibility to perform DEPART in ALND. Methods: Patients from February 2013 to October 2017 from two tertiary referral centers were randomly assigned to two groups. In the study group, indocyanine green and methylene blue (MB) were utilized to identify arm sentinel nodes, and 0.1 ml MB was injected into the arm sentinel nodes to reveal the subsequent-echelon nodes and lymphatics. Gross arm lymph nodes were examined by intraoperative partial frozen section and were removed if positive. Arm lymphedema, local recurrence, regional recurrence, and distant metastasis were recorded at different follow-up examinations. Results: Arm sentinel nodes were identified in 573 (83.2%) patients. Subsequent-echelon nodes and lymphatics were visualized in 558 (97.4%) patients. Metastatic arm nodes were identified in 38 (6.8%) patients. The arm lymphedema rate was 3.3% (18/543) in the study group versus 15.3% (99/648) in the control group (p < 0.001) after 37-month median follow-up. Regional recurrence showed no difference between the two groups (1.4% and 1.2%, respectively) (p = 0.392). Conclusions: DEPART can benefit breast cancer patients who undergo ALND, reducing the arm lymphedema rate without adversely affecting the morbidity of regional recurrence.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Dynamic Contrast-Enhanced MRI Kinetics of Invasive Breast Cancer: A Potential Prognostic Marker for Radiation Therapy

Purpose: Our goal was to determine the correlations between dynamic contrast-enhanced MRI (DCE-MRI) kinetics of breast cancers and axillary nodal status (ANS) which may have prognostic value in designing radiation therapy recommendations. Methods and Materials: A retrospective review identified 167 consecutive patients treated with external beam radiotherapy for invasive breast cancer from Jan 1, 2006 to Nov 1, 2007. Patients with DCE-MRI kinetic data from our institution who underwent axillary surgical staging prior to chemotherapy were included. ANS was assessed as positive or negative by pathology record review. For each primary cancer, maximum tumor diameter and kinetic values for initial peak enhancement (PE), percent initial rapid enhancement (RE), and percent delayed washout enhancement (WE) were measured with a computer-aided evaluation program. Univariate, multivariate, and receiver operating characteristic curve analyses were performed according to the ANS. Results: Forty-six patients met study criteria, with 32 (70%) node-negative and 14 (30%) node-positive patients. Median PE was significantly greater in node-positive patients (209%) than in node-negative patients (138%, p = 0.0027). Similarly, median RE was significantly greater in node-positive patients (57%) than in node-negative patients (27%, p = 0.0436). WE was not different between groups (p = 0.9524). Median maximum tumor diameter was greater in node-positive patients (26 mm) than in node-negative patients (15 mm, p = 0.015). Multivariate analysis showed that only PE trended toward significance (p = 0.18). Conclusions: DCE-MRI kinetics of primary breast cancers correlate with ANS. Multivariate analysis demonstrates the correlation is not due simply to underlying lesion size. If validated prospectively, DCE-MRI kinetics may aid as a tool in selecting patients or designing fields for radiation therapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗