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 109 records · Page 6

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

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.

97 MATHEMATICS AND COMPUTING↗

Shortening treatment time in robotic radiosurgery using a novel node reduction technique

Purpose: The fraction duration of robotic radiosurgery treatments can be reduced by generating more time-efficient treatment plans with a reduced number of node positions, beams, and monitor units (MUs). Node positions are preprogramed locations where the robot can position the focal spot of the x-ray beam. As the time needed for the robot to travel between node positions takes up a large part of the treatment time, the aim of this study was to develop and evaluate a node reduction technique in order to reduce the treatment time per fraction for robotic radiosurgery. Methods: Node reduction was integrated into the inverse planning algorithm, developed in-house for the robotic radiosurgery modality. It involved repeated inverse optimization, each iteration excluding low-contribution node positions from the planning and resampling new candidate beams from the remaining node positions. Node reduction was performed until the exclusion of a single node position caused a constraint violation, after which the shortest treatment plan was selected retrospectively. Treatment plans were generated with and without node reduction for two lung cases of different complexity, one oropharyngeal case and one prostate case. Plan quality was assessed using the number of node positions, beams and MUs, and the estimated treatment time per fraction. All treatment plans had to fulfill all clinical dose constraints. Extra constraints were added to maintain the low-dose conformality and restrict skin doses during node reduction. Results: Node reduction resulted in 12 residual node positions, on average (reduction by 77%), at the cost of an increase in the number of beams and total MUs of 28% and 9%, respectively. Overall fraction durations (excluding patient setup) were shortened by 25% (range of 18%-40%), on average. Dose distributions changed only little and dose in low-dose regions was effectively restricted by the additional constraints. Conclusions: The fraction duration of robotic radiosurgery treatments can be reduced considerably by node reduction with minimal changes in dosimetrical plan quality. Additional constraints are required to guarantee low-dose conformality and to avoid unacceptable skin dose.

60 APPLIED LIFE SCIENCES↗

Scalable Node Monitoring

Project description is: (1) Build a high performance computer; and (2) Create a tool to monitor node applications in Component Based Tool Framework (CBTF) using code from Lightweight Data Metric Service (LDMS). The importance of this project is that: (1) there is a need a scalable, parallel tool to monitor nodes on clusters; and (2) New LDMS plugins need to be able to be easily added to tool. CBTF stands for Component Based Tool Framework. It's scalable and adjusts to different topologies automatically. It uses MRNet (Multicast/Reduction Network) mechanism for information transport. CBTF is flexible and general enough to be used for any tool that needs to do a task on many nodes. Its components are reusable and 'EASILY' added to a new tool. There are three levels of CBTF: (1) frontend node - interacts with users; (2) filter nodes - filters or concatenates information from backend nodes; and (3) backend nodes - where the actual work of the tool is done. LDMS stands for lightweight data metric servies. It's a tool used for monitoring nodes. Ltool is the name of the tool we derived from LDMS. It's dynamically linked and includes the following components: Vmstat, Meminfo, Procinterrupts and more. It works by: Ltool command is run on the frontend node; Ltool collects information from the backend nodes; backend nodes send information to the filter nodes; and filter nodes concatenate information and send to a database on the front end node. Ltool is a useful tool when it comes to monitoring nodes on a cluster because the overhead involved with running the tool is not particularly high and it will automatically scale to any size cluster.

99 GENERAL AND MISCELLANEOUS↗

RTOG GU Radiation Oncology Specialists Reach Consensus on Pelvic Lymph Node Volumes for High-Risk Prostate Cancer

Purpose: Radiation therapy to the pelvic lymph nodes in high-risk prostate cancer is required on several Radiation Therapy Oncology Group (RTOG) clinical trials. Based on a prior lymph node contouring project, we have shown significant disagreement in the definition of pelvic lymph node volumes among genitourinary radiation oncology specialists involved in developing and executing current RTOG trials. Materials and Methods: A consensus meeting was held on October 3, 2007, to reach agreement on pelvic lymph node volumes. Data were presented to address the lymph node drainage of the prostate. Extensive discussion ensued to develop clinical target volume (CTV) pelvic lymph node consensus. Results: Consensus was obtained resulting in computed tomography image-based pelvic lymph node CTVs. Based on this consensus, the pelvic lymph node volumes to be irradiated include: distal common iliac, presacral lymph nodes (S{sub 1}-S{sub 3}), external iliac lymph nodes, internal iliac lymph nodes, and obturator lymph nodes. Lymph node CTVs include the vessels (artery and vein) and a 7-mm radial margin being careful to 'carve out' bowel, bladder, bone, and muscle. Volumes begin at the L5/S1 interspace and end at the superior aspect of the pubic bone. Consensus on dose-volume histogram constraints for OARs was also attained. Conclusions: Consensus on pelvic lymph node CTVs for radiation therapy to address high-risk prostate cancer was attained and is available as web-based computed tomography images as well as a descriptive format through the RTOG. This will allow for uniformity in evaluating the benefit and risk of such treatment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

High Occurrence of Aberrant Lymph Node Spread on Magnetic Resonance Lymphography in Prostate Cancer Patients With a Biochemical Recurrence After Radical Prostatectomy

Purpose: To investigate the pattern of lymph node spread in prostate cancer patients with a biochemical recurrence after radical prostatectomy, eligible for salvage radiotherapy; and to determine whether the clinical target volume (CTV) for elective pelvic irradiation in the primary setting can be applied in the salvage setting for patients with (a high risk of) lymph node metastases. Methods and Materials: The charts of 47 prostate cancer patients with PSA recurrence after prostatectomy who had positive lymph nodes on magnetic resonance lymphography (MRL) were reviewed. Positive lymph nodes were assigned to a lymph node region according to the guidelines of the Radiation Therapy Oncology Group (RTOG) for delineation of the CTV for pelvic irradiation (RTOG-CTV). We defined four lymph node regions for positive nodes outside this RTOG-CTV: the para-aortal, proximal common iliac, pararectal, and paravesical regions. They were referred to as aberrant lymph node regions. For each patient, clinical and pathologic features were recorded, and their association with aberrant lymph drainage was investigated. The distribution of positive lymph nodes was analyzed separately for patients with a prostate-specific antigen (PSA) <1.0 ng/mL. Results: MRL detected positive aberrant lymph nodes in 37 patients (79%). In 20 patients (43%) a positive lymph node was found in the pararectal region. Higher PSA at the time of MRL was associated with the presence of positive lymph nodes in the para-aortic region (2.49 vs. 0.82 ng/mL; p = 0.007) and in the proximal common iliac region (1.95 vs. 0.59 ng/mL; p = 0.009). There were 18 patients with a PSA <1.0 ng/mL. Ten of these patients (61%) had at least one aberrant positive lymph node. Conclusion: Seventy-nine percent of the PSA-recurrent patients had at least one aberrant positive lymph node. Application of the standard RTOG-CTV for pelvic irradiation in the salvage setting therefore seems to be inappropriate.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Extended Field Intensity Modulated Radiation Therapy With Concomitant Boost for Lymph Node–Positive Cervical Cancer: Analysis of Regional Control and Recurrence Patterns in the Positron Emission Tomography/Computed Tomography Era

Purpose: Positron emission tomography/computed tomography (PET/CT) is commonly used for nodal staging in locally advanced cervical cancer; however the false negative rate for para-aortic disease are 20% to 25% in PET-positive pelvic nodal disease. Unless surgically staged, pelvis-only treatment may undertreat para-aortic disease. We have treated patients with PET-positive nodes with extended field intensity modulated radiation therapy (IMRT) to address the para-aortic region prophylactically with concomitant boost to involved nodes. The purpose of this study was to assess regional control rates and recurrence patterns. Methods and Materials: Sixty-one patients with cervical cancer (stage IBI-IVA) diagnosed from 2003 to 2012 with PET-avid pelvic nodes treated with extended field IMRT (45 Gy in 25 fractions with concomitant boost to involved nodes to a median of 55 Gy in 25 fractions) with concurrent cisplatin and brachytherapy were retrospectively analyzed. The nodal location was pelvis-only in 41 patients (67%) and pelvis + para-aortic in 20 patients (33%). There were a total of 179 nodes, with a median number of positive nodes of 2 (range, 1-16 nodes) per patient and a median nodal size of 1.8 cm (range, 0.7-4.5 cm). Response was assessed by PET/CT at 12 to 16 weeks. Results: Complete clinical and imaging response at the first follow-up visit was seen in 77% of patients. At a mean follow-up time of 29 months (range, 3-116 months), 8 patients experienced recurrence. The sites of persistent/recurrent disease were as follows: cervix 10 (16.3%), regional nodes 3 (4.9%), and distant 14 (23%). The rate of para-aortic failure in patients with pelvic-only nodes was 2.5%. There were no significant differences in recurrence patterns by the number/location of nodes, largest node size, or maximum node standardized uptake value. The rate of late grade 3+ adverse events was 4%. Conclusions: Extended field IMRT was well tolerated and resulted in low regional recurrence in node-positive cervical cancer. The dose of 55 Gy in 25 fractions was effective in eradicating disease in involved nodes, with acceptable late adverse events. Distant metastasis is the predominant mode of failure, and the OUTBACK trial may challenge the presented paradigms.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Multi-node and Multi-core Performance Studies of a Monte Carlo code RMC

Over the past 15 years the architecture of high-performance computing systems has become increasingly heterogeneous with individual computing cores being subdivided into nodes and even auxiliary co-processing units such as graphics processing units or the Intel many integrated core co-processors. In fact, future computer platforms is moving toward a larger number of nodes and cores with lower memory available per node. Today, several production Monte Carlo codes use some types of hybrid parallelism strategy that makes use of shared-memory parallelism within a computing node and message-passing parallelism between nodes, which enables the codes to utilize available computing resources as much as possible, both among and within computing nodes on a cluster. The so-called hybrid parallelization is also possible with Reactor Monte Carlo Code RMC by activating both MPI and OpenMP parallel algorithms together. On HPC' which typically consists of several or several-ten thousand nodes equipping 16-32 computing intra-cores per node, simulation of RMC can be carried out in the hybrid parallelization with the MPI inter-node parallelization and the OpenMP intra-node parallelization. RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material, cross section and tally data, thus reducing the memory usage per processor. The calculation on the Tianhe-2 supercomputer took 6144 cores, resulting in a rate of 173,314,000 neutrons/minute for BEAVRS benchmark. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Keeping up with the continuing trend for increases in the number of computing resources within modern HPC systems is a significant challenge for teams that develop and maintain high-performance MC radiation transport solvers. order to address this challenge, RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material and composition definitions, and cross section data, thus reducing the memory usage per processor. The parallel performance has been studied by using two complex and representative benchmarks, H-M and BEAVRS benchmark. All simulations were run on Intel Xeon E5-2692 12 core, 2.2 GHz processors at MilkyWay-2 Super Computer with up to 12,288 available computing cores. While employing MPI parallelism, excellent parallel efficiency is achieved even above 12,000 processors and RMC reaches the parallel efficiency of 96% on 12,288 cores for the pin-by-pin computation of the BEAVRS benchmark. While BEAVRS criticality benchmark was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 173,314,000 particles per minute. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Results from these studies demonstrate that RMC, using the hybrid parallel model described in this paper, is able to handle pin-wise full core burnup calculations with millions of depletion regions and scales well through thousands of processors. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Mediastinal lymph node detection and station mapping on chest CT using spatial priors and random forest

Purpose: To develop an automated system for mediastinal lymph node detection and station mapping for chest CT. Methods: The contextual organs, trachea, lungs, and spine are first automatically identified to locate the region of interest (ROI) (mediastinum). The authors employ shape features derived from Hessian analysis, local object scale, and circular transformation that are computed per voxel in the ROI. Eight more anatomical structures are simultaneously segmented by multiatlas label fusion. Spatial priors are defined as the relative multidimensional distance vectors corresponding to each structure. Intensity, shape, and spatial prior features are integrated and parsed by a random forest classifier for lymph node detection. The detected candidates are then segmented by the following curve evolution process. Texture features are computed on the segmented lymph nodes and a support vector machine committee is used for final classification. For lymph node station labeling, based on the segmentation results of the above anatomical structures, the textual definitions of mediastinal lymph node map according to the International Association for the Study of Lung Cancer are converted into patient-specific color-coded CT image, where the lymph node station can be automatically assigned for each detected node. Results: The chest CT volumes from 70 patients with 316 enlarged mediastinal lymph nodes are used for validation. For lymph node detection, their system achieves 88% sensitivity at eight false positives per patient. For lymph node station labeling, 84.5% of lymph nodes are correctly assigned to their stations. Conclusions: Multiple-channel shape, intensity, and spatial prior features aggregated by a random forest classifier improve mediastinal lymph node detection on chest CT. Using the location information of segmented anatomic structures from the multiatlas formulation enables accurate identification of lymph node stations.

60 APPLIED LIFE SCIENCES↗

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

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.

97 MATHEMATICS AND COMPUTING↗

Distributing an executable job load file to compute nodes in a parallel computer

Distributing an executable job load file to compute nodes in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: determining, by a compute node in the parallel computer, whether the compute node is participating in a job; determining, by the compute node in the parallel computer, whether a descendant compute node is participating in the job; responsive to determining that the compute node is participating in the job or that the descendant compute node is participating in the job, communicating, by the compute node to a parent compute node, an identification of a data communications link over which the compute node receives data from the parent compute node; constructing a class route for the job, wherein the class route identifies all compute nodes participating in the job; and broadcasting the executable load file for the job along the class route for the job.

97 MATHEMATICS AND COMPUTING↗

Distributing an executable job load file to compute nodes in a parallel computer

Distributing an executable job load file to compute nodes in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: determining, by a compute node in the parallel computer, whether the compute node is participating in a job; determining, by the compute node in the parallel computer, whether a descendant compute node is participating in the job; responsive to determining that the compute node is participating in the job or that the descendant compute node is participating in the job, communicating, by the compute node to a parent compute node, an identification of a data communications link over which the compute node receives data from the parent compute node; constructing a class route for the job, wherein the class route identifies all compute nodes participating in the job; and broadcasting the executable load file for the job along the class route for the job.

97 MATHEMATICS AND COMPUTING↗

Checkpointing using compute node health information

A method is disclosed, as well as an associated apparatus and computer program product, for checkpointing using a plurality of communicatively coupled compute nodes. The method comprises acquiring health information for a first node of the plurality of compute nodes, and determining a first failure probability for the first node using the health information. The first failure probability corresponds to a predetermined time interval. The method further comprises selecting a second node of the plurality of compute nodes as a partner node for the first node. The second node has a second failure probability for the time interval. A composite failure probability of the first node and the second node is less than the first failure probability. The method further comprises copying checkpoint information from the first node to the partner node.

97 MATHEMATICS AND COMPUTING↗

Seawifs Technical Report Series. Volume 2: Analysis of Orbit Selection for Seawifs: Ascending Versus Descending Node

Due to range safety considerations, the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) ocean color instrument may be required to be launched into a near-noon descending node, as opposed to the ascending node used by the predecessor sensor, the Coastal Zone Color Scanner (CZCS). The relative importance of ascending versus descending near-noon orbits was assessed here to determine if descending node will meet the scientific requirements of SeaWiFS. Analyses focused on ground coverage, local times of coverage, solar and viewing geometries (zenith and azimuth angles), and sun glint. Differences were found in the areas covered by individual orbits, but were not important when taken over a 16 day repeat time. Local time of coverage was also different: for ascending node orbits the Northern Hemisphere was observed in the morning and the Southern Hemisphere in the afternoon, while for descending node orbits the Northern Hemisphere was observed in the afternoon and the Southern in the morning. There were substantial differences in solar azimuth and spacecraft azimuth angles both at equinox and at the Northern Hemisphere summer solstice. Negligible differences in solar and spacecraft zenith angles, relative azimuth angles, and sun glint were obtained at the equinox. However, large differences were found in solar zenith angles, relative azimuths, and sun glint for the solstice. These differences appeared to compensate across the scan, however, an increase in sun glint in descending node over that in ascending node on the western part of the scan was compensated by a decrease on the eastern part of the scan. Thus, no advantage or disadvantage could be conferred upon either ascending node or descending node for noon orbits. Analyses were also performed for ascending and descending node orbits that deviated from a noon equator crossing time. For ascending node, afternoon orbits produced the lowest mean solar zenith angles in the Northern Hemisphere, and morning orbits produced the lowest angles for the Southern Hemisphere. For descending node, morning orbits produced the lowest mean solar zenith angles for the Northern Hemisphere; afternoon orbits produced the lowest angles for the Southern Hemisphere.

Hooker, Stanford B.↗

Alternate Approach to Multi Layer Insulation Modeling to Reduce Node Count

For models with a limitation on the overall node count, the typical approach to Multi-Layer Insulation (MLI) modeling may generate nodes that are necessary for the analysis, but do not represent components of particular interest. This leaves fewer nodes that can be utilized to model components of greater importance than the MLI. A common approach to modeling MLI is to include a separate MLI node representing the outer layer of the insulation and a radiative coupling based on the area multiplied by an effective emissivity. Therefore, wherever insulation is included, one node is needed for the underlying surface and another node for the insulation. Since many spacecraft and instruments include MLI covering a sizable portion of their designs, this may result in a considerable number of nodes being used for MLI. An alternate method to MLI modeling was developed that eliminates the MLI node, while still preserving the effect of the insulation for the underlying surface, thereby increasing the available nodes that could be used elsewhere in the model. This approach relies on preserving the baseline reflectivity, while reducing the absorptivity (based on the blanket effective emittance) and including a transparency. An inactive second surface is placed just behind the base surface that fully absorbs any energy that is transmitted without including its effect in the model. In essence, this approach applies only the energy that makes it through the blanket to the underlying surface. This method was tested out on the Roman Space Telescope model in local areas in preparation for its use in the generation of a launch model, which is constrained in the allowable node count. This paper documents the performance of the method and presents a comparison between the One-Node MLI method and the traditional two node MLI approach.

Thermal↗

Synchronizing compute node time bases in a parallel computer

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.

97 MATHEMATICS AND COMPUTING↗

Synchronizing compute node time bases in a parallel computer

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.

97 MATHEMATICS AND COMPUTING↗

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

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.

97 MATHEMATICS AND COMPUTING↗

Magnetic Resonance Lymphography-Guided Selective High-Dose Lymph Node Irradiation in Prostate Cancer

Purpose: To demonstrate the feasibility of magnetic resonance lymphography (MRL) -guided delineation of a boost volume and an elective target volume for pelvic lymph node irradiation in patients with prostate cancer. The feasibility of irradiating these volumes with a high-dose boost to the MRL-positive lymph nodes in conjunction with irradiation of the prostate using intensity-modulated radiotherapy (IMRT) was also investigated. Methods and Materials: In 4 prostate cancer patients with a high risk of lymph node involvement but no enlarged lymph nodes on CT and/or MRI, MRL detected pathological lymph nodes in the pelvis. These lymph nodes were identified and delineated on a radiotherapy planning CT to create a boost volume. Based on the location of the MRL-positive lymph nodes, the standard elective pelvic target volume was individualized. An IMRT plan with a simultaneous integrated boost (SIB) was created with dose prescriptions of 42 Gy to the pelvic target volume, a boost to 60 Gy to the MRL-positive lymph nodes, and 72 Gy to the prostate. Results: All MRL-positive lymph nodes could be identified on the planning CT. This information could be used to delineate a boost volume and to individualize the pelvic target volume for elective irradiation. IMRT planning delivered highly acceptable radiotherapy plans with regard to the prescribed dose levels and the dose to the organs at risk (OARs). Conclusion: MRL can be used to select patients with limited lymph node involvement for pelvic radiotherapy. MRL-guided delineation of a boost volume and an elective pelvic target volume for selective high-dose lymph node irradiation with IMRT is feasible. Whether this approach will result in improved outcome for these patients needs to be investigated in further clinical studies.

62 RADIOLOGY AND NUCLEAR MEDICINE↗